Concepedia

Publication | Closed Access

Solving symmetric and asymmetric TSPs by ant colonies

504

Citations

9

References

2002

Year

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.

References

YearCitations

Page 1