EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem

Kezong Tang, Xiong-Fei Wei, Yuan-Hao Jiang, Zi-Wei Chen, Lihua Yang

Mathematics · 26.10.2023 · 11 (21) · 4439

DOI: 10.3390/math11214439 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 26.10.2023. Verfasst von Kezong Tang und 4 weiteren Autor:innen. Die Arbeit wurde bisher 23-mal zitiert (Crossref) und nennt 52 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Innovation Training Program for College Students, Science and Technology Research Project of Jiangxi Provincial Department of Education.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The ant colony algorithm faces dimensional catastrophe problems when solving the large-scale traveling salesman problem, which leads to unsatisfactory solution quality and convergence speed. To solve this problem, an adaptive ant colony optimization for large-scale traveling salesman problem (AACO-LST) is proposed. First, AACO-LST improves the state transfer rule to make it adaptively adjust with the population evolution, thus accelerating its convergence speed; then, the 2-opt operator is used to locally optimize the part of better ant paths to further optimize the solution quality of the proposed algorithm. Finally, the constructed adaptive pheromone update rules can significantly improve the search efficiency and prevent the algorithm from falling into local optimal solutions or premature stagnation. The simulation based on 45 traveling salesman problem instances shows that AACO-LST improves the solution quality by 79% compared to the ant colony system (ACS), and in comparison with other algorithms, the PE of AACO-LST is not more than 1% and the Err is not more than 2%, which indicates that AACO-LST can find high-quality solutions with high stability. Finally, the convergence speed of the proposed algorithm was tested. The data shows that the average convergence speed of AACO-LST is more than twice that of the comparison algorithm. The relevant code can be found on our project homepage.

Förderung

  • National Innovation Training Program for College Students
  • Science and Technology Research Project of Jiangxi Provincial Department of Education

Zitieren

APA

Tang, K., Wei, X., Jiang, Y., Chen, Z., & Yang, L. (2023). An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem. Mathematics, 11(21), 4439. https://doi.org/10.3390/math11214439

Vancouver

Tang K, Wei X, Jiang Y, Chen Z, Yang L. An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem. Mathematics. 2023;11(21):4439. doi:10.3390/math11214439

BibTeX
@article{Tang2023,
  author = {Tang, Kezong and Wei, Xiong-Fei and Jiang, Yuan-Hao and Chen, Zi-Wei and Yang, Lihua},
  title = {An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem},
  journal = {Mathematics},
  year = {2023},
  volume = {11},
  number = {21},
  pages = {4439},
  doi = {10.3390/math11214439}
}
Kostenlos starten →