Negative drift in populations

Authors:
Per Kristian Lehre
Affiliations:
Technical University of Denmark, Lyngby, Denmark
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Year:
2010

Citing 5
Cited 7

The time complexity of maximum matching by simulated annealing

Journal of the ACM (JACM)
Evolutionary Algorithms and the Maximum Matching Problem

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A study of drift analysis for estimating computation time of evolutionary algorithms

Natural Computing: an international journal
On the impact of the mutation-selection balance on the runtime of evolutionary algorithms

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

Non-uniform mutation rates for problems with unknown solution lengths

Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Fitness-levels for non-elitist populations

Proceedings of the 13th annual conference on Genetic and evolutionary computation
On the analysis of the simple genetic algorithm

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
Drift analysis

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Improved runtime analysis of the simple genetic algorithm

Proceedings of the 15th annual conference on Genetic and evolutionary computation
Runtime analysis of evolutionary algorithms: basic introduction

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An important step in gaining a better understanding of the stochastic dynamics of evolving populations, is the development of appropriate analytical tools. We present a new drift theorem for populations that allows properties of their long-term behaviour, e. g. the runtime of evolutionary algorithms, to be derived from simple conditions on the onestep behaviour of their variation operators and selection mechanisms.