Abstract
We study the locality of the genotype-phenotype mapping used in grammatical evolution (GE). GE is a variant of genetic programming that can evolve complete programs in an arbitrary language using a variable-length binary string. In contrast to standard GP, which applies search operators directly to phenotypes, GE uses an additional mapping and applies search operators to binary genotypes. Therefore, there is a large semantic gap between genotypes (binary strings) and phenotypes (programs or expressions). The case study shows that the mapping used in GE has low locality leading to low performance of standard mutation operators. The study at hand is an example of how basic design principles of modern heuristics can be applied to explain performance differences between different GP approaches and demonstrates current challenges in the design of GE.
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
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rothlauf, F. (2011). High Locality Representations for Automated Programming. In: Design of Modern Heuristics. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72962-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-72962-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72961-7
Online ISBN: 978-3-540-72962-4
eBook Packages: Computer ScienceComputer Science (R0)