Solving Symmetric and Asymmetric TSPs by Ant Colonies

- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We apply ACS to both symmetric and asymmetric traveling salesman problems. Results show that ACS is able to find good solutions to these problems.

• Type: Conference
• Year: 1996
• Where: ICEC
• Authors: Luca Maria Gambardella, Marco Dorigo
• Keywords: Asymmetric Traveling Salesman, Combinatorial Optimization Problems, ICEC 1996, Real Colonies