title: Ant algorithms for discrete optimization.
abstract: This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and introduces the ant colony optimization (ACO) metaheuristic. In the first part of the article the basic biological findings on real ants are reviewed and their artificial counterparts as well as the ACO metaheuristic are defined. In the second part of the article a number of applications of ACO algorithms to combinatorial optimization and routing in communications networks are described. We conclude with a discussion of related work and of some of the most important aspects of the ACO metaheuristic.
authors.affiliation: Université Libre de Bruxelles, Brussels Belgium. mdorigo@ulb.ac.be
authors.forename: M
authors.initials: M
authors.lastname: Dorigo
authors.forename: G
authors.initials: G
authors.lastname: Di Caro
authors.forename: L M
authors.initials: LM
authors.lastname: Gambardella
mesh_terms: D000465:Algorithms; D000818:Animals; D001000:Ants; D005247:Feeding Behavior; D012919:Social Behavior