Mostra el registre d'ítem simple

dc.contributor.authorCordón García, Oscar
dc.contributor.authorHerrera Triguero, Francisco
dc.contributor.authorStützle, Thomas
dc.description.abstractAnt Colony Optimization (ACO) is a recent metaheuristic method that is inspired by the behavior of real ant colonies. In this paper, we review the underlying ideas of this approach that lead from the biological inspiration to the ACO metaheuristic, which gives a set of rules of how to apply ACO algorithms to challenging combinatorial problems. We present some of the algorithms that were developed under this framework, give an overview of current applications, and analyze the relationship between ACO and some of the best known metaheuristics. In addition, we describe recent theoretical developments in the field and we conclude by showing several new trends and new research directions in this field.
dc.publisherUniversitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica
dc.relation.ispartofMathware & soft computing . 2002 Vol. 9 Núm. 2 [ -3 ]
dc.rightsReconeixement-NoComercial-CompartirIgual 3.0 Espanya
dc.subject.otherAnt Colony Optimization (ACO)
dc.titleA review on the ant colony optimization metaheuristic: basis, models and new trends
dc.subject.lemacIntel·ligència artificial
dc.subject.lemacAlgorismes -- Anàlisi
dc.subject.amsClassificació AMS::68 Computer science::68T Artificial intelligence
dc.rights.accessOpen Access

Fitxers d'aquest items


Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple

Llevat que s'hi indiqui el contrari, els continguts d'aquesta obra estan subjectes a la llicència de Creative Commons: Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya