Abstract
Genetic programming (GP) was initially developed to allow the automatic creation of a computer program from a high-level statement of a problem’s requirements, by means of an evolutionary process. In GP, a computer program to solve a defined task is evolved from an initial population of random computer programs. An iterative evolutionary process is employed by GP, where better (fitter) programs for the task at hand are allowed to ‘reproduce’ using recombination processes to recombine components of existing programs. The reproduction process is supplemented by incremental trial-and-error development, and both variety-generating mechanisms act to generate variants of existing good programs. Over time, the utility of the programs in the population improves as poorer solutions to the problem are replaced by better solutions. More generally, GP has been applied to evolve a wide range of ‘structures’ (and their associated parameters) including electronic circuits, mathematical models, engineering designs, etc.
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
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brabazon, A., O’Neill, M., McGarraghy, S. (2015). Genetic Programming. In: Natural Computing Algorithms. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43631-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-43631-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43630-1
Online ISBN: 978-3-662-43631-8
eBook Packages: Computer ScienceComputer Science (R0)