Sciweavers

3 search results - page 1 / 1
» On the runtime analysis of the 1-ANT ACO algorithm
Sort
View
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
13 years 9 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
ECCC
2006
97views more  ECCC 2006»
13 years 3 months ago
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
Frank Neumann, Carsten Witt
COR
2008
122views more  COR 2008»
13 years 3 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr