English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm

MPS-Authors
/persons/resource/persons44338

Doerr,  Benjamin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44705

Johannsen,  Daniel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Doerr, B., & Johannsen, D. (2007). Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm. In IEEE Congress on Evolutionary Computation 2007 (pp. 501-507). Piscataway, NJ: IEEE.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2080-E
Abstract
Neumann and Witt (2006) analyzed the runtime of the basic ant colony optimization (ACO) algorithm {\sc 1-Ant} on pseudo-boolean optimization problems. For the problem {\sc OneMax} they showed how the runtime depends on the evaporation factor. In particular, they proved a phase transition from exponential to polynomial runtime. In this work, we simplify the view on this problem by an appropriate translation of the pheromone model. This results in a profound simplification of the pheromone update rule and, by that, a refinement of the results of Neumann and Witt. In particular, we show how the exponential runtime bound gradually changes to a polynomial bound inside the phase of transition.