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...

Descripción completa

Detalles Bibliográficos
Autores principales: Hao, Tan, Yingnian, Wu, Jiaxing, Zhang, Jing, Zhang
Formato: Online Artículo Texto
Lenguaje:English
Publicado: PeerJ Inc. 2023
Materias:
Algorithms and Analysis of Algorithms
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

Internet

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