Drift Analysis
arXiv:1712.00964
Abstract
Drift analysis is one of the major tools for analysing evolutionary algorithms and nature-inspired search heuristics. In this chapter we give an introduction to drift analysis and give some examples of how to use it for the analysis of evolutionary algorithms.
This article will become a chapter in a book on Theory of Evolutionary Algorithms that will be published by Springer, edited by Benjamin Doerr and Frank Neumann
Cited by in corpus (7)
- Does Comma Selection Help To Cope With Local Optima
- Multiplicative Up-Drift
- Lower Bounds from Fitness Levels Made Easy
- Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise
- Fast Mutation in Crossover-based Algorithms
- Fixed-Target Runtime Analysis
- How Well Does the Metropolis Algorithm Cope With Local Optima?