Abstract
Grammatical Evolution (GE) is an evolutionary system that employs variable length linear chromosomes to represent computer programs. GE uses the individuals to produce derivation trees that adhere to a Backus Naur Form grammar, which are then mapped onto a program. One unusual characteristic of the system is the manner in which chromosomes can be “wrapped”, that is, if an individual has used up all of its genes before a program is completely mapped, the chromosome is reread. While this doesn’t guarantee that an individual will map, prior work suggested that wrapping is beneficial for the system, both in terms of increased success rates and a reduced number of invalid individuals. However, there has been no research into the number of times an individual should be wrapped before the system gives up, and an arbitrary upper limit is usually chosen.
This paper discusses the different types of grammars that could be used with this system, and indicates the circumstances under which individuals will fail. It then presents a heuristic to minimize the number of wraps that have to be made before the system can determine that an individual will fail. It is shown that this can drastically reduce the amount of wrapping on a pathologically difficult problem, as well as on two classes of grammar often used by the system.
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.
References
Keijzer M. Scientific Discovery using Genetic Programming PhD Thesis, Danish Hydraulic Institute, 2001.
Koza, J.R., Genetic Programming: On the Programming of Computers by Means of Natural Evolution, MIT Press, Cambridge, MA, 1992.
Keijzer M., Ryan C., O’Neill M., Cattolico M., and Babovic V. Ripple crossover in genetic programming. In Proceedings of EuroGP 2001, 2001.
M. O’Neill. Automatic Programming in an Arbitrary Language: Evolving Programs with Grammatical Evolution. PhD thesis, University Of Limerick, 2001.
O’Neill M. and Ryan C. Genetic code degeneracy: Implications for grammatical evolution and beyond. In ECAL’99: Proc. of the Fifth European Conference on Artificial Life, Lausanne, Switzerland, 1999.
O’Neill M. and Ryan C. Grammatical Evolution. IEEE Transactions on Evolutionary Computation. 2001.
O’Sullivan, J., and Ryan, C., An Investigation into the Use of Different Search Strategies with Grammatical Evolution. In the proceedings of European Conference on Genetic Programming (EuroGP2002) (pp. 268–277), Springer, 2002.
Ryan, C., and Azad, R.M.A., Sensible Initialisation in Chorus. Accepted for European Conference on Genetic Programming (EuroGP 2003).
Ryan, C., Azad, A., Sheahan, A., and O’Neill, M., No Coercion and No Prohibition, A Position Independent Encoding Scheme for Evolutionary Algorithms-The Chorus System. In the Proceedings of European Conference on Genetic Programming (EuroGP 2002) (pp. 131–141), Springer, 2002.
Ryan, C., Collins, J.J., and O’Neill, M., Grammatical Evolution: Evolving Programs for an Arbitrary Language, in EuroGP’98: Proc. of the First European Workshop on Genetic Programming (Lecture Notes in Computer Science 1391, pp-83–95), Springer, Paris, France, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ryan, C., Keijzer, M., Nicolau, M. (2003). On the Avoidance of Fruitless Wraps in Grammatical Evolution. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_67
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive