Keywords
Travelling salesman problemAnt colony optimization algorithmsSimulated annealingExtremal optimizationComputer scienceAnt colony2-optCombinatorial optimizationLin–Kernighan heuristicComputationArtificial intelligenceMathematical optimizationMetaheuristicMathematicsAlgorithmMeta-optimization
Affiliated Institutions
Related Publications
Ant colony system: a cooperative learning approach to the traveling salesman problem
This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents calle...
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...
Local Search for the Asymmetric Traveling Salesman Problem
We present an extension of the Lin-Kernighan local search algorithm for the solution of the asymmetric traveling salesman problem. Computational results suggest that our heurist...
Solving symmetric and asymmetric TSPs by ant colonies
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 b...
A new version of ant system for subset problems
Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., traveling salesman problem). We introduce a new version of A...
Publication Info
- Year
- 1997
- Type
- article
- Volume
- 43
- Issue
- 2
- Pages
- 73-81
- Citations
- 1984
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1984
OpenAlex
Cite This
Marco Dorigo,
Luca Maria Gambardella
(1997).
Ant colonies for the travelling salesman problem.
Biosystems
, 43
(2)
, 73-81.
https://doi.org/10.1016/s0303-2647(97)01708-5
Identifiers
- DOI
- 10.1016/s0303-2647(97)01708-5