Skip to main content

Understanding Expansion Order and Phenotypic Connectivity in πGE

  • Conference paper
Genetic Programming (EuroGP 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7831))

Included in the following conference series:

Abstract

Since its inception, πGE has used evolution to guide the order of how to construct derivation trees. It was hypothesised that this would allow evolution to adjust the order of expansion during the run and thus help with search. This research aims to identify if a specific order is reachable, how reachable it may be, and goes on to investigate what happens to the expansion order during a πGE run. It is concluded that within πGE we do not evolve towards a specific order but a rather distribution of orders. The added complexity that an evolvable order gives πGE can make it difficult to understand how it can effectively search, by examining the connectivity of the phenotypic landscape it is hoped to understand this. It is concluded that the addition of an evolvable derivation tree expansion order makes the phenotypic landscape associated with πGE very densely connected, with solutions now linked via a single mutation event that were not previously connected.

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 49.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. Byrne, J.: Approaches to Evolutionary Architectural Design Exploration Using Grammatical Evolution. Ph.D. thesis, University College Dublin, Ireland (2012)

    Google Scholar 

  2. Dempsey, I., O’Neill, M., Brabazon, A.: Foundations in Grammatical Evolution for Dynamic Environments. SCI, vol. 194. Springer, Heidelberg (2009)

    Book  Google Scholar 

  3. Fagan, D., O’Neill, M., Galván-López, E., Brabazon, A., McGarraghy, S.: An Analysis of Genotype-Phenotype Maps in Grammatical Evolution. In: Esparcia-Alcázar, A.I., Ekárt, A., Silva, S., Dignum, S., Uyar, A.Ş. (eds.) EuroGP 2010. LNCS, vol. 6021, pp. 62–73. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Fagan, D., Nicolau, M., O’Neill, M., Galvan-Lopez, E., Brabazon, A., McGarraghy, S.: Investigating mapping order in piGE. In: WCCI 2010, July 18-23, pp. 3058–3064. IEEE Press, Barcelona (2010)

    Google Scholar 

  5. Galvan-Lopez, E., Fagan, D., Murphy, E., Swafford, J.M., Agapitos, A., O’Neill, M., Brabazon, A.: Comparing the performance of the evolvable pigrammatical evolution genotype-phenotype map to grammatical evolution in the dynamic ms. pac-man environment. In: WCCI 2010, pp. 1587–1594. IEEE Press, Barcelona (2010)

    Google Scholar 

  6. Hemberg, E.: An Exploration of Grammars in Grammatical Evolution. Ph.D. thesis, University College Dublin, Ireland (September 17, 2010)

    Google Scholar 

  7. Koza, J.R., Poli, R.: Genetic programming. In: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, ch. 5, pp. 127–164. Springer (2005)

    Google Scholar 

  8. McKay, R.I., Hoai, N.X., Whigham, P.A., Shan, Y., O’Neill, M.: Grammar-based genetic programming: a survey. Genetic Programming and Evolvable Machines 11(3/4), 365–396 (2010), Tenth Anniversary Issue: Progress in Genetic Programming and Evolvable Machines

    Google Scholar 

  9. Murphy, E., O’Neill, M., Brabazon, A.: Examining Mutation Landscapes in Grammar Based Genetic Programming. In: Silva, S., Foster, J.A., Nicolau, M., Machado, P., Giacobini, M. (eds.) EuroGP 2011. LNCS, vol. 6621, pp. 130–141. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. O’Neill, M.: Automatic Programming in an Arbitrary Language: Evolving Programs with Grammatical Evolution. Ph.D. thesis, University Of Limerick (2001)

    Google Scholar 

  11. O’Neill, M., Brabazon, A., Nicolau, M., Garraghy, S.M., Keenan, P.: πGrammatical Evolution. In: Deb, K., Tari, Z. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 617–629. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. O’Neill, M., Hemberg, E., Gilligan, C., Bartley, E., McDermott, J., Brabazon, A.: GEVA: Grammatical Evolution in Java. SIGEVOlution 3(2) (2008)

    Google Scholar 

  13. O’Neill, M., Ryan, C.: Grammatical Evolution: Evolutionary Automatic Programming in a Arbitrary Language. Genetic programming. Kluwer (2003)

    Google Scholar 

  14. Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming. Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk (2008), (With contributions by J. R. Koza)

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fagan, D., Hemberg, E., O’Neill, M., McGarraghy, S. (2013). Understanding Expansion Order and Phenotypic Connectivity in πGE. In: Krawiec, K., Moraglio, A., Hu, T., Etaner-Uyar, A.Ş., Hu, B. (eds) Genetic Programming. EuroGP 2013. Lecture Notes in Computer Science, vol 7831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37207-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37207-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37206-3

  • Online ISBN: 978-3-642-37207-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics