Lihua Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lihua Yang has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Kezong Tang
School of Information Engineering, Jingdezhen Ceramic University, Jingdezhen 333403, China
1 shared publication - Xiong-Fei Wei
School of Information Engineering, Jingdezhen Ceramic University, Jingdezhen 333403, China
1 shared publication - Yuan-Hao Jiang
Shanghai Institute of AI for Education, East China Normal University, Shanghai, China and Graduate School, Shanghai Jiao Tong University, Shanghai, China
1 shared publication - Zi-Wei Chen
School of Information Engineering, Jingdezhen Ceramic University, Jingdezhen 333403, China
1 shared publication
Latest Publications
- Open Access
- 26 October 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (21) , 4439
An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem
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.
- 26 October 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (21) , 4439
Open AccessAn Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem
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.