Cargando…
Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP)
In the process of solving the Traveling Salesman Problem (TSP), both Ant Colony Optimization and simulated annealing exhibit different limitations depending on the dataset. This article aims to address these limitations by improving and combining these two algorithms using the clustering method. The...
Autores principales: | Hao, Tan, Yingnian, Wu, Jiaxing, Zhang, Jing, Zhang |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10557949/ https://www.ncbi.nlm.nih.gov/pubmed/37810357 http://dx.doi.org/10.7717/peerj-cs.1609 |
Ejemplares similares
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
Solving optimization problems simultaneously: the variants of the traveling salesman problem with time windows using multifactorial evolutionary algorithm
por: Ban, Ha-Bang, et al.
Publicado: (2023) -
A novel approach for solving travelling thief problem using enhanced simulated annealing
por: Ali, Hamid, et al.
Publicado: (2021) -
Semi-supervised associative classification using ant colony optimization algorithm
por: Awan, Hamid Hussain, et al.
Publicado: (2021) -
GenACO a multi-objective cached data offloading optimization based on genetic algorithm and ant colony optimization
por: Indana Zulfa, Mulki, et al.
Publicado: (2021)