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

Kezong Tang, Xiong-Fei Wei (), Yuan-Hao Jiang (), Zi-Wei Chen and Lihua Yang
Additional contact information
Kezong Tang: School of Information Engineering, Jingdezhen Ceramic University, Jingdezhen 333403, China
Xiong-Fei Wei: School of Information Engineering, Jingdezhen Ceramic University, Jingdezhen 333403, China
Yuan-Hao Jiang: School of Computer Science and Technology, East China Normal University, Shanghai 200062, China
Zi-Wei Chen: School of Information Engineering, Jingdezhen Ceramic University, Jingdezhen 333403, China
Lihua Yang: School of Information Engineering, Jingdezhen Ceramic University, Jingdezhen 333403, China

Mathematics, 2023, vol. 11, issue 21, 1-26

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

Keywords: meta-heuristic algorithm; adaptive optimization; traveling salesman problem; large-scale optimization; path optimization (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/21/4439/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/21/4439/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:21:p:4439-:d:1267953

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().