A review on the ant colony optimization metaheuristic: basis, models and new trends
View/Open
Cita com:
hdl:2099/3624
Document typeArticle
Defense date2002
PublisherUniversitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
Ant 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.
ISSN1134-5632
Collections
Files | Description | Size | Format | View |
---|---|---|---|---|
1-cordon-herrera-stuetzle.pdf | 439,3Kb | View/Open |