Abstract
In this chapter we review briefly two powerful evolutionary techniques; these are evolutionary programming (section 13.1) and genetic programming (section 13.2). These two techniques were developed a quarter of a century apart from each other; they aimed at different problems; they use different chromosomal representations for individuals in the population, and they put emphasis on different operators. Yet, they are very similar from our perspective of “evolution programs”: for particular tasks they aim at, they use specialized data structures (finite state machines and tree-structured computer programs) and specialized “genetic” operators. Also, both methods must control the complexity of the structure (some measure of the complexity of a finite state machine or a tree might be incorporated in the evaluation function). We discuss them in turn.
The past is present, isn’t it? It’s the future too.
Eugene O’Neill, Long Day’s Journey Into Night
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
© 1996 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Michalewicz, Z. (1996). Evolutionary Programming and Genetic Programming. In: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03315-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-03315-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08233-7
Online ISBN: 978-3-662-03315-9
eBook Packages: Springer Book Archive