Solving symmetric and asymmetric TSPs by ant colonies
- 24 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 622-627
- https://doi.org/10.1109/icec.1996.542672
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Ant-Q: A Reinforcement Learning approach to the traveling salesman problemPublished by Elsevier ,1995
- Probabilistic behaviour in ants: A strategy of errors?Journal of Theoretical Biology, 1983