Skip to main content

Alternative Bloat Control Methods

  • Conference paper
Genetic and Evolutionary Computation – GECCO 2004 (GECCO 2004)

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

Included in the following conference series:

Abstract

Bloat control is an important aspect of evolutionary computation methods, such as genetic programming, which must deal with genomes of arbitrary size. We introduce three new methods for bloat control: Biased Multi-Objective Parsimony Pressure (BMOPP), the Waiting Room, and Death by Size. These methods are unusual approaches to bloat control, and are not only useful in various circumstances, but two of them suggest novel approaches to attack the problem. BMOPP is a more traditional parsimony-pressure style bloat control method, while the other two methods do not consider parsimony as part of the selection process at all, but instead penalize for parsimony at other stages in the evolutionary process. We find parameter settings for BMOPP and the Waiting Room which are effective across all tested problem domains. Death by Size does not appear to have this consistency, but we find it a useful tool as it has particular applicability to steady-state evolution.

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. Smith, S.F.: A Learning System Based on Genetic Adaptive Algorithms. PhD thesis, Computer Science Department, University of Pittsburgh (1980)

    Google Scholar 

  2. Bassett, J.K., De Jong, K.A.: Evolving behaviors for cooperating agents. In: International Syposium on Methodologies for Intelligent Systems, pp. 157–165 (2000)

    Google Scholar 

  3. Luke, S.: Issues in Scaling Genetic Programming: Breeding Strategies, Tree Generation, and Code Bloat. PhD thesis, Department of Computer Science, University of Maryland, A. V. Williams Building, University of Maryland, College Park, MD 20742 USA (2000)

    Google Scholar 

  4. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  5. Martin, P., Poli, R.: Crossover operators for A hardware implementation of GP using FPGAs and Handel-C. In: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, pp. 845–852. Morgan Kaufmann Publishers, San Francisco (2002)

    Google Scholar 

  6. Silva, S., Almeida, J.: Dynamic maximum tree depth. In: Genetic and Evolutionary Computation – GECCO-2003, Chicago, pp. 1776–1787. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Haynes, T.: Collective adaptation: The exchange of coding segments. Evolutionary Computation 6, 311–338 (1998)

    Article  Google Scholar 

  8. Luke, S., Panait, L.: Lexicographic parsimony pressure. In: GECCO-2002: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 829–836. Morgan Kauffman, San Francisco (2002)

    Google Scholar 

  9. Luke, S., Panait, L.: Fighting bloat with nonparametric parsimony pressure. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 411–421. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Burke, D.S., De Jong, K.A., Grefenstette, J.J., Ramsey, C.L., Wu, A.S.: Putting more genetics into genetic algorithms. Evolutionary Computation 6, 387–410 (1998)

    Article  Google Scholar 

  11. Poli, R.: A simple but theoretically-motivated method to control bloat in genetic programming. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 204–217. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Bleuler, S., Brack, M., Thiele, L., Zitzler, E.: Multiobjective genetic programming: Reducing bloat using SPEA2. In: Proceedings of the 2001 Congress on Evolutionary Computation, pp. 536–543. IEEE Press, Los Alamitos (2001)

    Google Scholar 

  13. de Jong, E.D., Pollack, J.B.: Multi-objective methods for tree size control. Genetic Programming and Evolvable Machines 4, 211–233 (2003)

    Article  Google Scholar 

  14. Ekart, A., Nemeth, S.Z.: Selection based on the pareto nondomination criterion for controlling code growth in genetic programming. Genetic Programming and Evolvable Machines 2, 61–73 (2001)

    Article  MATH  Google Scholar 

  15. Luke, S.: ECJ 10 : An Evolutionary Computation research system in Java (2003), Available at http://www.cs.umd.edu/projects/plus/ec/ecj/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Panait, L., Luke, S. (2004). Alternative Bloat Control Methods. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24855-2_71

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24855-2_71

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22343-6

  • Online ISBN: 978-3-540-24855-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics