Ant Colony Optimisation: models and applications.

Oscar Cordón; Francisco Herrera; Thomas Stützle

Mathware and Soft Computing (2002)

  • Volume: 9, Issue: 2-3, page 141-175
  • ISSN: 1134-5632

Abstract

top
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.

How to cite

top

Cordón, Oscar, Herrera, Francisco, and Stützle, Thomas. "Ant Colony Optimisation: models and applications.." Mathware and Soft Computing 9.2-3 (2002): 141-175. <http://eudml.org/doc/39293>.

@article{Cordón2002,
abstract = {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.},
author = {Cordón, Oscar, Herrera, Francisco, Stützle, Thomas},
journal = {Mathware and Soft Computing},
keywords = {Algoritmo de búsqueda; Problemas combinatorios; Optimización global; Heurística},
language = {eng},
number = {2-3},
pages = {141-175},
title = {Ant Colony Optimisation: models and applications.},
url = {http://eudml.org/doc/39293},
volume = {9},
year = {2002},
}

TY - JOUR
AU - Cordón, Oscar
AU - Herrera, Francisco
AU - Stützle, Thomas
TI - Ant Colony Optimisation: models and applications.
JO - Mathware and Soft Computing
PY - 2002
VL - 9
IS - 2-3
SP - 141
EP - 175
AB - 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.
LA - eng
KW - Algoritmo de búsqueda; Problemas combinatorios; Optimización global; Heurística
UR - http://eudml.org/doc/39293
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.