The previous Chapters 3, 4 presented perhaps the simplest instances of genetic global optimization algorithms that only exploit basic mechanisms of genetic computation, such as mutation, crossover and selection. All these mechanisms do not change with respect to the genetic epoch and are “blind” to the optimization problem to be solved as well as to the knowledge about it currently gathered by the algorithm. Such simplicity allows us to construct the mathematical models and perform deep formal analysis of the asymptotic behavior, which is helpful in understanding the real nature of genetic global optimization. However, the efficiency of basic genetic search mechanisms are frequently criticized.
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
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schaefer, R. (2007). Adaptation in genetic search. In: Foundations of Global Genetic Optimization. Studies in Computational Intelligence, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73192-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-73192-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73191-7
Online ISBN: 978-3-540-73192-4
eBook Packages: EngineeringEngineering (R0)