Randomized algorithms
Future Generation Computer Systems
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Modeling the dynamics of ant colony optimization
Evolutionary Computation
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Ant Colony Optimization
A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC
Probability in the Engineering and Informational Sciences
Crossover is provably essential for the Ising model on trees
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Ant colony optimization theory: a survey
Theoretical Computer Science
First steps to the runtime complexity analysis of ant colony optimization
Computers and Operations Research
Speeding up evolutionary algorithms through restricted mutation operators
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Worst-case and average-case approximations by simple randomized search heuristics
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Runtime analysis of a simple ant colony optimization algorithm
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Computational complexity and evolutionary computation
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Runtime analysis of binary PSO
Proceedings of the 10th annual conference on Genetic and evolutionary computation
How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Ant Colony Optimization and the Minimum Spanning Tree Problem
Learning and Intelligent Optimization
Computational complexity and evolutionary computation
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Running Time Analysis of ACO Systems for Shortest Path Problems
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Runtime analysis of an ant colony optimization algorithm for TSP instances
IEEE Transactions on Evolutionary Computation
Comparing variants of MMAS ACO algorithms on pseudo-boolean functions
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Runtime analysis of a binary particle swarm optimizer
Theoretical Computer Science
Ant Colony Optimization and the minimum spanning tree problem
Theoretical Computer Science
A few ants are enough: ACO with iteration-best update
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Ant colony optimization and the minimum cut problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Ant colony optimization for stochastic shortest path problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Computational complexity and evolutionary computation
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Runtime analysis of the 1-ANT ant colony optimizer
Theoretical Computer Science
Using markov-chain mixing time estimates for the analysis of ant colony optimization
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Simple max-min ant systems and the optimization of linear pseudo-boolean functions
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Ants easily solve stochastic shortest path problems
Proceedings of the 14th annual conference on Genetic and evolutionary computation
ACO beats EA on a dynamic pseudo-boolean function
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Hi-index | 0.00 |
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 particularly to classical search heuristics such as Evolutionary Algorithms (EAs) and Simulated Annealing. First runtime analyses of modern search heuristics have been conducted only recently w.r.t a simple Ant Colony Optimization (ACO) algorithm called 1-ANT. In particular, the influence of the evaporation factor in the pheromone update mechanism and the robustness of this parameter w.r.t the runtime behavior have been determined for the example function OneMax.This paper puts forward the rigorous runtime analysis of the 1-ANT on example functions, namely on the functions LeadingOnes and BinVal. With respect to EAs, such analyses have been essential to develop methods for the analysis on more complicated problems. The proof techniques required for the 1-ANT, unfortunately, differ significantly from those for EAs, which means that a new reservoir of methods has to be built up. Again, the influence of the evaporation factor is analyzed rigorously, and it is proved that its choice can be very crucial to allow efficient runtimes. Moreover, the analyses provide insight into the working principles of ACO algorithms and, in terms of their robustness, describe essential differences to other randomized search heuristics.