Solving symmetric and asymmetric TSPs by ant colonies
Luca Maria Gambardella, Marco Dorigo · 2002
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.