Abstract
The static (Chaps. 3–9) and dynamic (Chap. 10) theories that have been used to analyze mutation and recombination have omitted selection. These theories were relatively easy to analyze, and they provided useful insights into the various components of an EA. However, because they do not include selection, they are generally insufficient as predictive theories. Chapter 11 included selection, and modeled the behavior of an infinite-population EA with selection and mutation (with and without recombination). It turns out that the model without recombination can be efficiently analyzed on a restricted (but interesting) class of functions. The addition of recombination makes the model considerably more complex.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Spears, W.M. (2000). A Dynamic Model of Selection, Recombination, and Mutation. In: Evolutionary Algorithms. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04199-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-04199-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08624-3
Online ISBN: 978-3-662-04199-4
eBook Packages: Springer Book Archive