Cargando…
An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving...
Autores principales: | Sung, Jinmo, Jeong, Bongju |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3948472/ https://www.ncbi.nlm.nih.gov/pubmed/24701158 http://dx.doi.org/10.1155/2014/313767 |
Ejemplares similares
-
Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows
por: Yurtkuran, Alkın, et al.
Publicado: (2014) -
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
List-Based Simulated Annealing Algorithm for Traveling Salesman Problem
por: Zhan, Shi-hua, et al.
Publicado: (2016) -
The multi-stripe travelling salesman problem
por: Çela, Eranda, et al.
Publicado: (2017) -
The traveling salesman problem and its variations
por: Gutin, Gregory, et al.
Publicado: (2007)