Drift analysis and average time complexity of evolutionary algorithms
Artificial Intelligence
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Towards an analytic framework for analysing the computation time of evolutionary algorithms
Artificial Intelligence
A study of drift analysis for estimating computation time of evolutionary algorithms
Natural Computing: an international journal
On the effect of populations in evolutionary multi-objective optimization
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Computing single source shortest paths using single-objective fitness
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Theoretical analysis of fitness-proportional selection: landscapes and efficiency
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
General lower bounds for the running time of evolutionary algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Drift analysis with tail bounds
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Sharp bounds by probability-generating functions and variable drift
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
On the analysis of the immune-inspired B-cell algorithm for the vertex cover problem
ICARIS'11 Proceedings of the 10th international conference on Artificial immune systems
Tight analysis of the (1+1)-ea for the single source shortest path problem
Evolutionary Computation
Revisiting the restricted growth function genetic algorithm for grouping problems
Evolutionary Computation
Non-existence of linear universal drift functions
Theoretical Computer Science
The impact of the power law exponent on the behavior of a dynamic epidemic type process
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Ants easily solve stochastic shortest path problems
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Computational complexity analysis of multi-objective genetic programming
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Proceedings of the 14th annual conference on Genetic and evolutionary computation
The choice of the offspring population size in the (1,λ) EA
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
When do evolutionary algorithms optimize separable functions in parallel?
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Optimizing expected path lengths with ant colony optimization using fitness proportional update
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Single- and multi-objective genetic programming: new bounds for weighted order and majority
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
How the (1+λ) evolutionary algorithm optimizes linear functions
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Mutation rate matters even when optimizing monotonic functions
Evolutionary Computation
Runtime analysis of evolutionary algorithms: basic introduction
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
Drift analysis is one of the strongest tools in the analysis of evolutionary algorithms. Its main weakness is that it is often very hard to find a good drift function. In this paper, we make progress in this direction. We prove a multiplicative version of the classical drift theorem. This allows easier analyses in those settings, where the optimization progress is roughly proportional to the current objective value. Our drift theorem immediately gives natural proofs for the best known run-time bounds for the (1+1) Evolutionary Algorithm computing minimum spanning trees and shortest paths, since here we may simply take the objective function as drift function. As a more challenging example, we give a relatively simple proof for the fact that any linear function is optimized in time O(n log n). In the multiplicative setting, a simple linear function can be used as drift function (without taking any logarithms). However, we also show that, both in the classical and the multiplicative setting, drift functions yielding good results for all linear functions exist only if the mutation probability is at most c/n for a small constant c.