Title: Ant colony system: a cooperative learning approach to the traveling salesman problem
Abstract:This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to fin...This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSPs. Ants cooperate using an indirect form of communication mediated by a pheromone they deposit on the edges of the TSP graph while building solutions. We study the ACS by running experiments to understand its operation. The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and we conclude comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs.Read More
Publication Year: 1997
Publication Date: 1997-04-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 7723
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot