A Multi Ant Colony Optimization Approach For The Traveling Salesman Problem
2021 ◽
Vol Volume 34 - 2020 - Special...
◽
Keyword(s):
International audience In this paper, we propose a new approach to solving the Traveling Salesman Problem (TSP), for which no exact algorithm is known that allows to find a solution in polynomial time. The proposed approach is based on optimization by ants. It puts several colonies in competition for improved solutions (in execution time and solution quality) to large TSP instances, and allows to efficiently explore the range of possible solutions. The results of our experiments show that the approach leads to better results compared to other heuristics from the literature, especially in terms of the quality of solutions obtained and execution time.
2015 ◽
Vol 6
(2)
◽
pp. 33-44
◽
2015 ◽
Vol 15
(2)
◽
pp. 390
1998 ◽
Vol 01
(02n03)
◽
pp. 149-159
◽