Skip to main content

Reducing Bloat in Genetic Programming

  • Conference paper
  • First Online:

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

Abstract

In this paper, several techniques will be presented to constrain the growth of solutions that are constructed by genetic programming. The most successful technique imposes a maximum size on the created individuals of the population that depends solely on the size of the best individual of the population. This method will be compared with other methods to reduce bloat, demonstrating that this method reduces bloat significantly better than the other methods.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Koza, J. R. Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA, USA: MIT Press (1995)

    Google Scholar 

  2. T. Soule and J. A. Foster. Effects of code growth and parsimony pressure on populations in genetic programming. In Evolutionary Computation, 6(4) (1998) 293–309

    Article  Google Scholar 

  3. Ryan, C. Pygmies and Civil Servants. In Advances in Genetic Programming. MIT Press (1994) 243–263

    Google Scholar 

  4. O’Reilly, U.-M. An Analysis of Genetic Programming. Ph.D. Dissertation, Carleton University, Ottawa-Carleton Institute for Computer Science, Ottawa, Ontario, Canada (1995)

    Google Scholar 

  5. Luke, Sean. Issues in Scaling Genetic Programming: Breeding Strategies, Tree Generation, and Code Bloat. Ph.D. Dissertation, Department of Computer Science, University of Maryland, College Park, Maryland (2000)

    Google Scholar 

  6. Tackett, W. A. Recombination, Selection, and the Genetic Construction of Computer Programs. Ph.D. Dissertation, University of Southern California, Department of Electrical Engineering Systems (1994)

    Google Scholar 

  7. Blickle, T. and Thiele, L. Genetic programming and redundancy. In Hopf, J., ed., Genetic Algorithms within the Framework of Evolutionary Computation (Workshop at KI-94, Saarbrücken). Saarbücken,Germany: Max-Planck-Institut fur Informatik (1994) 33–38

    Google Scholar 

  8. Soule, T. and Foster, J. A. Removal bias: a new cause of code growth in tree based evolutionary programming. In 1998 IEEE International Conference on Evolutionary Computation. Anchorage, Alaska, USA: IEEE Press (1998) 781–186

    Chapter  Google Scholar 

  9. Langdon, W. B. and Poli, R. Fitness causes bloat. In Chawdhry. Soft Computing in Engineering Design and Manufacturing. Springer-Verlag London (1997) 13–22

    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

Monsieurs, P., Flerackers, E. (2001). Reducing Bloat in Genetic Programming. In: Reusch, B. (eds) Computational Intelligence. Theory and Applications. Fuzzy Days 2001. Lecture Notes in Computer Science, vol 2206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45493-4_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-45493-4_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42732-2

  • Online ISBN: 978-3-540-45493-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics