Ant colony optimization solves combinatorial optimization problems, most famously variants of the travelling salesman problem, by simulating a colony of artificial ants that construct candidate solutions step by step while depositing a virtual pheromone on the paths they use, the pheromone amount reflecting how good the resulting solution turned out to be; over many iterations pheromone evaporates from unused paths and accumulates on paths used by good solutions, biasing later ants toward stronger routes. It was introduced by Marco Dorigo in his 1992 doctoral thesis, drawing on the way real ant colonies find efficient paths to food sources through pheromone trails. It belongs to the broader family of swarm intelligence metaheuristics.
Facts
Classification
Design TechniqueHeuristic or Approximation 1 Connections
Associated With
Credited To
Source Wikipedia: Ant colony optimization algorithms
In Field
Source Wikipedia: Ant colony optimization algorithms
Invented By
Marco Dorigo introduced ant colony optimization in his 1992 doctoral thesis, modeling the foraging behavior of ants.
Uses Design Technique
Entity-backed identity for the design-technique enum value this algorithm already carries, resolved to a computing concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The design-technique fact itself stays on the algorithm unchanged.
Entity-backed identity for the design-technique enum value this algorithm already carries, resolved to a computing concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The design-technique fact itself stays on the algorithm unchanged.
Sources
1. Ant Colony Optimization Algorithm (Wikipedia)
Wikipedia: design technique heuristic-approximationQuote, Wikipedia: design technique heuristic-approximation
heuristic-approximation
2. Wikipedia: Ant colony optimization algorithms
Article body, sentence crediting Dorigo
Initially proposed by Marco Dorigo in 1992 in his PhD thesis
entity record, description (design-technique)
It belongs to the broader family of swarm intelligence metaheuristics.
Credited To: Marco Dorigo, Intro, lead sentence
Marco Dorigo
In Field: Evolutionary Computation, Lead sentence
ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems that can be reduced to finding good paths through graphs.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.