Abstract
Grammatical evolution is an evolutionary algorithm designed to evolve programs in any language. Grammatical evolution operates on binary strings and the mapping of the genotype onto the phenotype (the tree representation of the programs) is provided through the grammar described in the form of production rules. The program trees are constructed in a pre-order fashion, which means that as the genome is traversed first the left most branch of the tree is completed then the second from the left one etc. Once two individuals are crossed over by means of simple one-point crossover the tail parts of the chromosomes (originally encoding the structures on the right side of the program tree) may map on different program structures within the new context. Here we present a bidirectional representation which helps to equalize the survival rate of both the program structures appearing on the left and right side of the program parse tree.
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
Angeline, P. J.: Subtree Crossover: Building Block Engine or Macromutation? Genetic Programming 1997: Proceedings of the Second Annual Conference, pp. 9–17, Morgan Kaufmann, 13-16 July 1997.
Goldberg D. E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA, 1989.
Keijzer M., Ryan C., O’Neill M., Cattolico M., and Babovic V.: Ripple Crossover in Genetic Programming. Proceedings of EuroGP’2001, LNCS, Vol. 2038, pp. 74–86, Springer-Verlag, 2001.
Koza, J.: Genetic Programming. MIT Press. 1992.
O’Neill, M., Ryan, C.: Genetic Code Degeneracy: Implications for Grammatical Evolution and Beyond, Advances in Artificial Life, LNAI, Vol. 1674, p. 149, Springer Verlag, 1999.
O’Neill, M., Ryan, C.: Grammatical Evolution. IEEE Transactions on Evolutionary Computation, Vol. 5 No.4, August 2001.
Poli, R., Langdon, W. B.: A Review of Theoretical and Experimental Results on Schemata in Genetic Programming, Proceedings of the First European Workshop on Genetic Programming, LNCS, Vol. 1391, pp. 1–15, Springer-Verlag, 14-15 April 1998.
Poli, R.: Hyperschema Theory for GP with One-Point Crossover Building Blocks, and Some New Results in GA Theory, Genetic Programming, Proceedings of EuroGP’ 2000, LNCS, Vol. 1802, pp. 163–180, Springer-Verlag, 15-16, 2000.
Ryan C., Collins J.J., O’Neill M.: Grammatical Evolution: Evolving Programs for an Arbitrary Language. Proceedings of the First European Workshop on Genetic Programming, LNCS 1391. pp. 83–95. 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
Kubalík, J., Koutník, J., Rothkrantz, L.J. (2003). Grammatical Evolution with Bidirectional Representation. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds) Genetic Programming. EuroGP 2003. Lecture Notes in Computer Science, vol 2610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36599-0_33
Download citation
DOI: https://doi.org/10.1007/3-540-36599-0_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00971-9
Online ISBN: 978-3-540-36599-0
eBook Packages: Springer Book Archive