Título inglés |
Ant Colony Optimisation: models and applications. |
Título español |
Optimización basada en colonias de hormigas: modelos y aplicaciones. |
Autor/es |
Cordón, Oscar ; Herrera, Francisco ; Stützle, Thomas |
Organización |
Dep. Cienc. Comput. Intel. Artif. Esc. Téc. Super. Ing. Informát. Univ. Granada, Granada, España;Intell. Group Dep. Comput. Sci. Darmstadt Univ. Technol., Darmstadt, Alemania |
Revista |
1134-5632 |
Publicación |
2002, 9 (2-3): 141-175, 6 Ref. |
Tipo de documento |
articulo |
Idioma |
Inglés |
Resumen inglés |
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. |
Clasificación UNESCO |
120304 ; 120700 |
Palabras clave español |
Algoritmo de búsqueda ; Problemas combinatorios ; Optimización global ; Heurística |
Código MathReviews |
MR1983790 |
Código Z-Math |
Zbl pre01960694 |
Acceso al artículo completo |