Skip to main content

Crossover in Grammatical Evolution: The Search Continues

  • Conference paper
  • First Online:
Genetic Programming (EuroGP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2038))

Included in the following conference series:

Abstract

Grammatical Evolution is an evolutionary automatic programming algorithm that can produce code in any language, requiring as inputs a BNF grammar definition describing the output language, and the fitness function. The utility of crossover in GP systems has been hotly debated for some time, and this debate has also arisen with respect to Grammatical Evolution. This paper serves to continue an analysis of the crossover operator in Grammatical Evolution by looking at the result of turning off crossover, and by exchanging randomly generated blocks in a headless chicken-like crossover. Results show that crossover in Grammatical Evolution is essential on the problem domains examined. The mechanism of one-point crossover in Grammatical Evolution is discussed, resulting in the discovery of some interesting properties that could yield an insight into the operator’s success.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angeline, P.J. 1997. Subtree Crossover: Building block engine or macromutation? In Proceedings of GP’97, pages 9–17.

    Google Scholar 

  2. Collins, R. 1992. Studies in Artificial Life. PhD thesis. University of California, Los Angeles.

    Google Scholar 

  3. Francone F.D., Banzhaf W., Conrads M, Nordin P. 1999. Homologous Crossover in Genetic Programming. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 99, pages 1021–1038.

    Google Scholar 

  4. Goldberg, David E. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley.

    Google Scholar 

  5. Keijzer M., Ryan C., O’Neill M., Cattolico M., Babovic V. 2001. Ripple Crossover in Genetic Programming. In Proceedings of EuroGP 2001.

    Google Scholar 

  6. Koza, J. 1992. Genetic Programming. MIT Press.

    Google Scholar 

  7. Langdon W.B. 1999. Size Fair and Homologous Tree Genetic Programming Crossovers. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 99, pages 1092–1097.

    Google Scholar 

  8. Langdon W.B., Soule T., Poli R., and Foster J.A. 1999. The Evolution of Size and Shape. In Advances in Genetic Programming Volume 3, MIT Press 1999, pp 162–190.

    Google Scholar 

  9. O’Neill M. and Ryan C. 2001. Grammatical Evolution. IEEE Trans. Evolutionary Computation, 2001.

    Google Scholar 

  10. Justinian P. Rosca and Dana H. Ballard. 1999. Rooted-Tree Schemata in Genetic Programming, in Advances in Genetic Programming 3, Chapter 11, pp 243–271, 1999, MIT Press.

    Google Scholar 

  11. O’Neill M. and Ryan C. 2000. Crossover in Grammatical Evolution: A Smooth Operator? Lecture Notes in Computer Science 1802, Proceedings of the European Conference on Genetic Programming, pages 149–162. Springer-Verlag.

    Google Scholar 

  12. O’Neill M. and Ryan C. 1999. Genetic Code Degeneracy: Implications for Grammatical Evolution and Beyond. In Proceedings of the Fifth European Conference on Artificial Life.

    Google Scholar 

  13. O’Neill M. and Ryan C. 1999. Under the Hood of Grammatical Evolution. In Proceedings of the Genetic & Evolutionary Computation Conference 1999.

    Google Scholar 

  14. O’Neill M. and Ryan C. 1999. Evolving Multi-line Compilable C Programs. Lecture Notes in Computer Science 1598, Proceedings of the Second European Workshop on Genetic Programming, pages 83–92. Springer-Verlag.

    Google Scholar 

  15. Poli Riccardo, Langdon W.B. 1998. On the Search Properties of Different Crossover Operators in Genetic Programming. In Proceedings of the Third annual Genetic Programming conference 1998, pages 293–301.

    Google Scholar 

  16. Ryan C. and O’Neill M. 1998. Grammatical Evolution: A Steady State Approach. In Late Breaking Papers, Genetic Programming 1998, pages 180–185.

    Google Scholar 

  17. Ryan C., Collins J.J., and O’Neill M. 1998. Grammatical Evolution: Evolving Programs for an Arbitrary Language. Lecture Notes in Computer Science 1391, Proceedings of the First European Workshop on Genetic Programming, pages 83–95. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

O’Neill, M., Ryan, C., Keijzer, M., Cattolico, M. (2001). Crossover in Grammatical Evolution: The Search Continues. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tettamanzi, A.G.B., Langdon, W.B. (eds) Genetic Programming. EuroGP 2001. Lecture Notes in Computer Science, vol 2038. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45355-5_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-45355-5_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41899-3

  • Online ISBN: 978-3-540-45355-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics