Abstract
As discussed in the previous chapter, there are some problems that GA applications encounter that sometimes delay, if not prohibit, finding the optimal solutions with the desired precision. One of the implications of these problems was premature convergence of the entire population to a non-global optimum (Chapter 4); other consequences include inability to perform fine local tuning and inability to operate in the presence of nontrivial constraints (Chapters 6 and 7).
There were rules in the monastery, but the Master always warned against the tyranny of the law.
Anthony de Mello, One Minute Wisdom
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Michalewicz, Z. (1994). Binary or Float?. In: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07418-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-07418-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-07420-6
Online ISBN: 978-3-662-07418-3
eBook Packages: Springer Book Archive