JOURNAL ARTICLE

Research on path optimization of ant colony algorithm Improved Particle Swarm Optimization and Reverse Learning

Abstract

Aiming at the difficulty of determining the key parameters when applying ant colony optimization algorithm (ACO) to traveling salesman problem, we propose an improved particle swarm optimization (PSO) algorithm for adaptive parameter acquisition.Because repeated calls to ACO will increase the cost of computing and get the local optimal solution easily, the number of single ACO iterations is reduced, and the update of the pheromone is determined by the fitness function.After each call to ACO, the pheromone is not adjusted.In order to get better quality parameters of PSO, the reverse learning strategy is applied to PSO, and the speed of optimization is improved.The effectiveness of the algorithm is proved by the simulation experiment.

Keywords:
Ant colony optimization algorithms Parallel metaheuristic Metaheuristic Particle swarm optimization Computer science Path (computing) Swarm intelligence Mathematical optimization Multi-swarm optimization Meta-optimization Algorithm Artificial intelligence Mathematics

Metrics

3
Cited By
0.40
FWCI (Field Weighted Citation Impact)
5
Refs
0.67
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Metaheuristic Optimization Algorithms Research
Physical Sciences →  Computer Science →  Artificial Intelligence
Vehicle Routing Optimization Methods
Physical Sciences →  Engineering →  Industrial and Manufacturing Engineering
Robotic Path Planning Algorithms
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
© 2026 ScienceGate Book Chapters — All rights reserved.