Sciweavers

Share
ICEC
1996

Solving Symmetric and Asymmetric TSPs by Ant Colonies

9 years 18 days ago
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.
Luca Maria Gambardella, Marco Dorigo
Added 02 Nov 2010
Updated 02 Nov 2010
Type Conference
Year 1996
Where ICEC
Authors Luca Maria Gambardella, Marco Dorigo
Comments (0)
books