Skip to content

Ant colony system: a cooperative learning approach to the traveling salesman problem

Marco Dorigo, Luca Maria Gambardella

IEEE Transactions on Evolutionary Computation · 1997 · 8,213 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Dorigo, M., & Gambardella, L. M. (1997). Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1), 53–66. https://doi.org/10.1109/4235.585892

In text: (Dorigo & Gambardella, 1997)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

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 called ants cooperate to find good solutions to TSPs. Ants cooperate using an indirect form of communication mediated by a pheromone they deposit on the edges of the TSP graph while building solutions. We study the ACS by running experiments to understand its operation. The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and we conclude comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs.

  1. A fast and elitist multiobjective genetic algorithm: NSGA-II2002
  2. Particle swarm optimization2002
  3. Optimization by Simulated Annealing1983
  4. Statistical Learning Theory1999
  5. A new optimizer using particle swarm theory2002

Metadata from OpenAlex (CC0). Citations are generated from the published record.