Ant Colony Optimization (ACO) is a recent metaheuristic method that is inspired by the behavior of real ant colonies. In this paper, we review the underlying ideas of this approach that lead from the biological inspiration to the ACO metaheuristic, which gives a set of rules of how to apply ACO algorithms to challenging combinatorial problems. We present some of the algorithms that were developed under this framework, give an overview of current applications, and analyze the relationship between ACO and some of the best known metaheuristics. In addition, we describe recent theoretical developments in the field and we conclude by showing several new trends and new research directions in this field.
@article{urn:eudml:doc:39241,
title = {A review on the ant colony optimization metaheuristic: basis, models and new trends.},
journal = {Mathware and Soft Computing},
volume = {9},
year = {2002},
pages = {141-175},
zbl = {1175.90426},
mrnumber = {MR1983790},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39241}
}
Cordón, Oscar; Herrera, Francisco; Stützle, Thomas. A review on the ant colony optimization metaheuristic: basis, models and new trends.. Mathware and Soft Computing, Tome 9 (2002) pp. 141-175. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39241/