Ant Colony Optimization: models and applications
-
Autores: Óscar Cordón García
, Francisco Herrera Triguero , Thomas Stützle
- Localización: Mathware & soft computing: The Magazine of the European Society for Fuzzy Logic and Technology, ISSN-e 1134-5632, Vol. 9, Nº. 3, 2002, págs. 137-139
- Idioma: inglés
- Títulos paralelos:
- Optimización basada en colonias de hormigas: modelos y aplicaciones
- Enlaces
-
Resumen
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.
¿Es nuevo? Regístrese
Ventajas de registrarse
