Ant colony optimization: models and applications [Guest editorial]

Main Article Content

Oscar Cordón García
Francisco Herrera Triguero
Thomas Stützle
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.

Article Details

Com citar
Cordón García, Oscar et al. «Ant colony optimization: models and applications [Guest editorial]». Mathware & soft computing, 2002, vol.VOL 9, núm. 2, http://raco.cat/index.php/Mathware/article/view/84862.

Articles més llegits del mateix autor/a