Abstract
Grammatical Evolution (GE), a form of grammar-based genetic programming (Chap. 18), is an algorithm that can evolve computer programs, rulesets or, more generally, sentences in any language [150, 460, 470, 472, 547]. Rulesets could be as diverse as a regression model, a set of design instructions, or a trading system for a financial market. Rather than representing the programs as syntax trees, as in GP (Chap. 7) [340, 514], a linear genome representation is used in conjunction with a grammar.
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
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brabazon, A., O’Neill, M., McGarraghy, S. (2015). Grammatical Evolution. In: Natural Computing Algorithms. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43631-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-662-43631-8_19
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)