Skip to main content

Reducing Population Size while Maintaining Diversity

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

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

Included in the following conference series:

Abstract

This paper presents a technique to drastically reduce the size of a population, while still maintaining sufficient diversity for evolution. An advantage of a reduced population size is the reduced number of fitness evaluations necessary. In domains where calculation of fitness values is expensive, this results in a huge speedup of the search. Additionally, in the experiments performed, smaller populations also resulted in a faster convergence speed towards an optimal solution.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. De Jong, E.; Watson, R.; Pollack, J.: Reducing Bloat and Promoting Diversity using Multi-Objective Methods. In Proceedings of the Genetic and Evolutionary Computation Conference, San Fransisco, USA, July 7–11 2001, pp. 11–18.

    Google Scholar 

  2. Ekárt, A.; Németh, S. Z.: A Metric for Genetic Programs and Fitness Sharing. in Genetic Programming, Proceedings of EUROGP’2000, Edinburgh, 15–16 April 2000, LNCS volume 1802, pp. 259–270, ISBN 3-540-67339-3.

    Google Scholar 

  3. Goldberg, D. E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.

    Google Scholar 

  4. Handley, S.: On the Use of a Directed Acyclic Graph to Represent a Population of Computer Programs. in Proceedings of the 1994 IEEE World Congress on Computational Intelligence, pp. 154–159, Orlando, Florida, USA: IEEE Press.

    Google Scholar 

  5. Keijzer, M.: Efficiently Representing Populations in Genetic Programming. In Advances of Genetic Programming Volume 2, MIT Press (1996), pp. 259–278.

    Google Scholar 

  6. Keller, R. E.; Banzhaf, W.: Explicit Maintenance of Genetic Diversity on Genospaces. Unpublished manuscript, June 1994, available at http://citeseer.nj.nec.com/keller94explicit.html.

  7. Koza, J. R.: Genetic Programming. MIT Press, Cambridge, MA, 1992.

    MATH  Google Scholar 

  8. Langdon, W. B.; Poli, R.: Genetic Programming Bloat with Dynamic Fitness. In Genetic Programming: Proceedings of the First European Workshop, EuroGP’98, Paris, France, April 14–15 1998. Springer-Verlag, Berlin, pp. 97–112.

    Google Scholar 

  9. Luke, S.: Genetic Programming Produced Competitive Soccer Softbot Teams for Robocup 97. In Genetic Programming 1998: Proceedings of the Third Annual Conference, University of Wisconsin, Madison, Wisconsin, USA, July 22–25 1998, Morgan Kaufman, pp. 214–222.

    Google Scholar 

  10. Mahwinney, D.: Prevention of Premature Convergence in Genetic Programming. Honours Thesis, RMIT, Department of Computer Science, 2000.

    Google Scholar 

  11. Monsieurs, P.: Evolving Virtual Agents using Genetic Programming. Ph.D. dissertation, Department of Computer Science, Transnationale Universiteit Limburg, Belgium, 1992.

    Google Scholar 

  12. Monsieurs, P.; Flerackers, E.: Reducing Bloat in Genetic Programming. In Computational Intelligence, Proceedings of 7th Fuzzy Days, Dortmund, Germany, October 1–3 2001, pp. 471–478, ISBN 3-540-42732-5.

    Google Scholar 

  13. Nienhuys-Cheng, S.-H.: Distance Between Herbrand Interpretations: a Measure for Approximations to a Target Concept. In N. Lavraĉ, S. Džeroski (eds): Proceedings of the 7th International Workshop on Inductive Logic Programming, volume 1297 of LNAI, pp. 213–226. Springer-Verlag, 1997.

    Google Scholar 

  14. O’Reilly, U.-M.: Using a Distance Metric on Genetic Programs to Understand Genetic Operators. IEEE International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, Orlando, Florida, USA, October 12–15, 1997, pp. 4092–4097.

    Google Scholar 

  15. Rosca, J. P.: An Analysis of Hierarchical Genetic Programming. Technical Report 566, University of Rochester, Rochester, NY, USA, 1995. http://citeseer.nj.nec.com/rosca95analysis.html.

  16. Rosca, J. P.: Entropy-Driven Adaptive Representation. In Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, Tahoe City, California, USA, july 9, 1995, pp. 23–32.

    Google Scholar 

  17. Wineberg, M.; Oppacher, F.: The Benefits of Computing with Introns. In Genetic Programming 1996, Proceedings of the First Annual Conference, July 28–31 1996, Stanford University, MIT Press, pp. 410–415.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monsieurs, P., Flerackers, E. (2003). Reducing Population Size while Maintaining Diversity. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds) Genetic Programming. EuroGP 2003. Lecture Notes in Computer Science, vol 2610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36599-0_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-36599-0_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00971-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics