Ant Colony Optimisation: models and applications.
Cordón, Oscar ; Herrera, Francisco ; Stützle, Thomas
Mathware and Soft Computing, Tome 9 (2002), p. 141-175 / Harvested from Biblioteca Digital de Matemáticas
Access to full text

Ant Colony Optimization (ACO) is a metaheuristic that is inspired by the shortest path searching behavior of various ant species [1,2]. The initial work of Dorigo, Maniezzo and Colorni [3,4] who proposed the first ACO algorithm called Ant System, has stimulated a still strongly increasing number of researchers to develop more sophisticated and better performing ACO algorithms that are used to successfully solve a large number of hard combinatorial optimization problems such as the traveling salesman problem, the quadratic assignment problem, and routing in telecommunication networks.

Publié le : 2002-01-01
DMLE-ID : 2027 
@article{urn:eudml:doc:39293,
     title = {Ant Colony Optimisation: models and applications.},
     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:39293}
}

Cordón, Oscar; Herrera, Francisco; Stützle, Thomas. Ant Colony Optimisation: models and applications.. Mathware and Soft Computing, Tome 9 (2002) pp. 141-175. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39293/