48 search results - page 1 / 10 » Runtime Analysis of a Simple Ant Colony Optimization Algorit... |
ECCC
2006
13 years 4 months ago
2006
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...
COR
2008
13 years 5 months ago
2008
: 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...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
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...
SWARM
2012
SPRINGER
12 years 12 days ago
2012
SPRINGER
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...
SAGA
2005
Springer
13 years 10 months ago
2005
Springer
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization ...