Abstract
John Holland’s Schema Theorem was the first rigorous, mathematical explanation of how genetic algorithms function (Holland, 1975, 1992). He defines a schema as a pattern of binary-coded gene values.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1996 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Shiroma, P.J. (1996). Theoretical Foundations of Genetic Algorithms. In: Efficient Production Planning and Scheduling. Information Engineering und IV-Controlling. Deutscher Universitätsverlag, Wiesbaden. https://doi.org/10.1007/978-3-663-08438-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-663-08438-9_3
Publisher Name: Deutscher Universitätsverlag, Wiesbaden
Print ISBN: 978-3-8244-6426-5
Online ISBN: 978-3-663-08438-9
eBook Packages: Springer Book Archive