Abstract
In this book we discussed different strategies, called Evolution Programs, which might be applied to hard optimization problems and which were based on the principle of evolution. Evolution programs borrow heavily from genetic algorithms. However, they incorporate problem-specific knowledge by using “natural” data structures and problem-sensitive “genetic” operators. The basic difference between GAs and EPs is that the former are classified as weak, problem-independent methods, which is not the case for the latter.
A disciple was one day recalling how Buddha, Jesus, and Mohammed were branded as rebels and heretics by their contemporaries
Said the Master, ‘Nobody can be said to have attained the pinnacle of Truth until a thousand sincere people have denounced him for blasphemy.’
Anthony de Mello, One Minute Wisdom
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
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Michalewicz, Z. (1992). Conclusions. In: Genetic Algorithms + Data Structures = Evolution Programs. Artificial Intelligence. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02830-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-02830-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-02832-2
Online ISBN: 978-3-662-02830-8
eBook Packages: Springer Book Archive