Abstract
The previous chapters have fully outlined schema theories for recombination and for mutation. Two aspects of these operators were investigated — the disruptive aspect and the constructive aspect. Disruption refers to the likelihood that a kth-order hyperplane H k will not survive either recombination or mutation. Construction refers to the likelihood that a kth-order hyperplane will be created, given that one parent is a member of a lower-order hyperplane H m , and that the other parent is a member of another lower-order hyperplane H n . In order to provide for a fair comparison of mutation and recombination, care was taken to ensure that the mathematical framework was always the same for both operators (e.g., both operators are taken to be two-parent operators that produce two children). The framework is not repeated here (see Chaps. 3–7 for full details).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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). Schema Theory: Mutation versus Recombination. In: Evolutionary Algorithms. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04199-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-04199-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08624-3
Online ISBN: 978-3-662-04199-4
eBook Packages: Springer Book Archive