Quarterly (spring, summer, fall, winter)
176 pp. per issue
7 x 10
ISSN
1063-6560
E-ISSN
1530-9304
2014 Impact factor:
2.37

Evolutionary Computation

Summer 1996, Vol. 4, No. 2, Pages 133-167
(doi: 10.1162/evco.1996.4.2.133)
© 1996 by the Massachusetts Institute of Technology
Analysis of Selection Algorithms: A Markov Chain Approach
Article PDF (1.47 MB)
Abstract

A Markov chain framework is developed for analyzing a wide variety of selection techniques used in genetic algorithms (GAs) and evolution strategies (ESs). Specifically, we consider linear ranking selection, probabilistic binary tournament selection, deterministic s-ary (s = 3,4, …) tournament selection, fitness-proportionate selection, selection in Whitley's GENITOR, selection in (μ, λ)-ES, selection in (μ + λ)-ES, (μ, λ)-linear ranking selection in GAs, (μ + λ)-linear ranking selection in GAs, and selection in Eshelman's CHC algorithm. The analysis enables us to compare and contrast the various selection algorithms with respect to several performance measures based on the probability of takeover. Our analysis is exact—we do not make any assumptions or approximations. Finite population sizes are considered. Our approach is perfectly general, and following the methods of this paper, it is possible to analyze any selection strategy in evolutionary algorithms.