New Ant Colony Optimization Algorithm for the Traveling Salesman Problem
As one suitable optimization method implementing computational intelligence, ant colony optimization (ACO) can be used to solve the traveling salesman problem (TSP). However, traditional ACO has many shortcomings, including slow convergence and low efficiency. By enlarging the ants' search spac...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2020-01-01
|
| Series: | International Journal of Computational Intelligence Systems |
| Subjects: | |
| Online Access: | https://www.atlantis-press.com/article/125932620/view |