Skip to main content
SpringerLink
Log in

Cartesian Genetic Programming: Why No Bloat?

  • Conference paper
Genetic Programming (EuroGP 2014)

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

Included in the following conference series:

Abstract

For many years now it has been known that Cartesian Genetic Programming (CGP) does not exhibit program bloat. Two possible explanations have been proposed in the literature: neutral genetic drift and length bias. This paper empirically disproves both of these and thus, reopens the question as to why CGP does not suffer from bloat. It has also been shown for CGP that using a very large number of nodes considerably increases the effectiveness of the search. This paper also proposes a new explanation as to why this may be the case.

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

Access this chapter

Log in via an institution
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. Luke, S., Panait, L.: A comparison of bloat control methods for genetic programming. Evolutionary Computation 14(3), 309–344 (2006)

    Article  Google Scholar 

  2. Silva, S., Costa, E.: Dynamic limits for bloat control in genetic programming and a review of past and current bloat theories. Genetic Programming and Evolvable Machines 10(2), 141–179 (2009)

    Article  MathSciNet  Google Scholar 

  3. Miller, J.: What bloat? Cartesian genetic programming on Boolean problems. In: 2001 Genetic and Evolutionary Computation Conference Late Breaking Papers, pp. 295–302 (2001)

    Google Scholar 

  4. Goldman, B.W., Punch, W.F.: Length bias and search limitations in Cartesian genetic programming. In: Proceeding of the Fifteenth Annual Conference on Genetic and Evolutionary Computation Conference, pp. 933–940. ACM (2013)

    Google Scholar 

  5. Miller, J., Smith, S.: Redundancy and computational efficiency in Cartesian genetic programming. IEEE Transactions on Evolutionary Computation 10(2), 167–174 (2006)

    Article  Google Scholar 

  6. Rothlauf, F., Goldberg, D.E.: Representations for Genetic and Evolutionary Algorithms. Physica-Verlag (2002)

    Google Scholar 

  7. Miller, J.F., Thomson, P.: Cartesian genetic programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121–132. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Miller, D.J.F. (ed.): Cartesian Genetic Programming. Springer (2011)

    Google Scholar 

  9. Vassilev, V.K., Miller, J.F.: The Advantages of Landscape Neutrality in Digital Circuit Evolution. In: Miller, J.F., Thompson, A., Thompson, P., Fogarty, T.C. (eds.) ICES 2000. LNCS, vol. 1801, pp. 252–263. Springer, Heidelberg (2000)

    Google Scholar 

  10. Yu, T., Miller, J.F.: Neutrality and the evolvability of boolean function landscape. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tetamanzi, A.G.B., Langdon, W.B. (eds.) EuroGP 2001. LNCS, vol. 2038, pp. 204–217. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

  12. Vanneschi, L., Castelli, M., Silva, S.: Measuring bloat, overfitting and functional complexity in genetic programming. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 877–884. ACM (2010)

    Google Scholar 

  13. Soule, T., Heckendorn, R.B.: An analysis of the causes of code growth in genetic programming. Genetic Programming and Evolvable Machines 3(3), 283–309 (2002)

    Article  MATH  Google Scholar 

  14. Langdon, W., Soule, T., Poli, R., Foster, J.: The evolution of size and shape. Advances in Genetic Programming 3, 163 (1999)

    Google Scholar 

  15. Kimura, M.: The neutral theory of molecular evolution. Cambridge University Press (1984)

    Google Scholar 

  16. McDermott, J., White, D.R., Luke, S., Manzoni, L., Castelli, M., Vanneschi, L., Jaskowski, W., Krawiec, K., Harper, R., De Jong, K., et al.: Genetic programming needs better benchmarks. In: Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation Conference, pp. 791–798. ACM (2012)

    Google Scholar 

  17. Goldman, B.W., Punch, W.F.: Reducing wasted evaluations in cartesian genetic programming. In: Krawiec, K., Moraglio, A., Hu, T., Etaner-Uyar, A.Ş., Hu, B. (eds.) EuroGP 2013. LNCS, vol. 7831, pp. 61–72. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electronics Department, University of York, Heslington, York, YO10 5DD, UK

    Andrew James Turner & Julian Francis Miller

Authors
  1. Andrew James Turner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julian Francis Miller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University College Dublin, UCD CASL, Belfield, Dublin 4, Ireland

    Miguel Nicolau

  2. Institute of Computing Science, Poznan University of Technology, Piotowo 2, 60-965, Poznań, Poland

    Krzysztof Krawiec

  3. Faculty of Computer Science, Dalhousie University, University Avenue 6050, B3H 1W5, Halifax, NS, Canada

    Malcolm I. Heywood

  4. Instituto Superior de Estatística e Gestão de Informaticão, Universidade Nova de Lisboa, 1070-312, Lisbon, Portugal

    Mauro Castelli

  5. Departamento de Arquitectura y Tecnología de Computadores (ETS), Universidad de Granada, 18071, Granada, Spain

    Pablo García-Sánchez  & Juan J. Merelo  & 

  6. Departamento de Informática, Universidad de Jaén, 23071, Jaén, Spain

    Victor M. Rivas Santos

  7. Institute for Informatics and Digital Innovation, Edinburgh Napier University, Merchiston Campus, EH10 5DT, Edinburgh, UK

    Kevin Sim

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Turner, A.J., Miller, J.F. (2014). Cartesian Genetic Programming: Why No Bloat?. In: Nicolau, M., et al. Genetic Programming. EuroGP 2014. Lecture Notes in Computer Science, vol 8599. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44303-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44303-3_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44302-6

  • Online ISBN: 978-3-662-44303-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation