DocumentCode
1709843
Title
Solving symmetric and asymmetric TSPs by ant colonies
Author
Gambardella, Luca Maria ; Dorigo, Marco
Author_Institution
IDSIA, Lugano, Switzerland
fYear
1996
Firstpage
622
Lastpage
627
Abstract
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
distributed algorithms; travelling salesman problems; ant colonies; asymmetric traveling salesman problem solving; combinatorial optimization problems; distributed algorithm; symmetric traveling salesman problem solving; Ant colony optimization; Cities and towns; Costs; Distributed algorithms; Euclidean distance; HTML; Learning; Length measurement; Scheduling algorithm; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1996., Proceedings of IEEE International Conference on
Conference_Location
Nagoya
Print_ISBN
0-7803-2902-3
Type
conf
DOI
10.1109/ICEC.1996.542672
Filename
542672
Link To Document