Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic (2018)
- Authors:
- Autor USP: TINÓS, RENATO - FFCLRP
- Unidade: FFCLRP
- DOI: 10.1007/978-3-319-99253-2_8
- Subjects: OTIMIZAÇÃO COMBINATÓRIA; MATEMÁTICA DA COMPUTAÇÃO; CIÊNCIA DA COMPUTAÇÃO
- Keywords: Traveling salesman problem; Recombination operator; Heuristic search; Evolutionary combinatorial optimization
- Language: Inglês
- Imprenta:
- Publisher: Springer International Publishing
- Publisher place: Cham
- Date published: 2018
- Source:
- Título: Lecture Notes in Computer Science
- Volume/Número/Paginação/Ano: v. 11101, p. 95-107
- Conference titles: International Conference on Parallel Problem Solving from Nature (PPSN)
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
TINÓS, Renato e HELSGAUN, Keld e WHITLEY, Darrell. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. Lecture Notes in Computer Science. Cham: Springer International Publishing. Disponível em: https://doi.org/10.1007/978-3-319-99253-2_8. Acesso em: 09 fev. 2026. , 2018 -
APA
Tinós, R., Helsgaun, K., & Whitley, D. (2018). Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. Lecture Notes in Computer Science. Cham: Springer International Publishing. doi:10.1007/978-3-319-99253-2_8 -
NLM
Tinós R, Helsgaun K, Whitley D. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic [Internet]. Lecture Notes in Computer Science. 2018 ; 11101 95-107.[citado 2026 fev. 09 ] Available from: https://doi.org/10.1007/978-3-319-99253-2_8 -
Vancouver
Tinós R, Helsgaun K, Whitley D. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic [Internet]. Lecture Notes in Computer Science. 2018 ; 11101 95-107.[citado 2026 fev. 09 ] Available from: https://doi.org/10.1007/978-3-319-99253-2_8 - Programação evolutiva com distribuição de mutações auto-adaptativa aplicada a redes neurais artificiais
- A new method for identification of recombining components in the generalized partition crossover
- Quasi-optimal recombination operator
- Artificial neural network based crossover for evolutionary algorithms
- Analyzing evolutionary algorithms for dynamic optimization problems based on the dynamical systems approach
- Use of self-organizing suppression and q-Gaussian mutation in artificial immune systems
- Diversity control in genetic algorithms for protein structure prediction
- An efficient implementation of iterative partial transcription for the traveling salesman problem
- Tolerância a falhas em robôs manipuladores cooperativos
- Analysing fitness landscape changes in evolutionary robots
Informações sobre o DOI: 10.1007/978-3-319-99253-2_8 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
002966710.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
