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
Travelling salesman problemCombinatorial optimizationMathematical optimizationAnt colony optimization algorithmsComputer scienceExtremal optimizationAnt colonyCombinatoricsMathematicsOptimization problemMeta-optimization
Affiliated Institutions
Related Publications
An Algorithm for the Traveling Salesman Problem
A “branch and bound” algorithm is presented for solving the traveling salesman problem. The set of all tours (feasible solutions) is broken up into increasingly small subsets by...
Neural networks for routing communication traffic
The use of neural network computational algorithms to determine optimal traffic routing for communication networks is introduced. The routing problem requires choosing multilink...
An improved elastic net method for the traveling salesman problem
An elastic net method is presented for finding traveling-salesman tours; the method improves on the convergence properties of a recent model proposed by R. Durbin and D. Willsha...
Ant system: optimization by a colony of cooperating agents
An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call ant system (AS). We propose it as a viable new approach...
Publication Info
- Year
- 2002
- Type
- article
- Pages
- 622-627
- Citations
- 502
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
502
OpenAlex
Cite This
Luca Maria Gambardella,
Marco Dorigo
(2002).
Solving symmetric and asymmetric TSPs by ant colonies.
, 622-627.
https://doi.org/10.1109/icec.1996.542672
Identifiers
- DOI
- 10.1109/icec.1996.542672