Skip to main content

Dynamic Size Populations in Distributed Genetic Programming

  • Conference paper
Genetic Programming (EuroGP 2005)

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

Included in the following conference series:

Abstract

This paper proposes the association of two approaches of GP which improve efficiency and reduce bloat. The first approach is to use a multi-population version of GP and the second one is to employ populations that can change size dynamically and adaptively. The latter approach consists in deleting or adding individuals in the population as a function of the current fitness and two other parameters. We test this approach on three well-known problems in GP, artificial ant, even parity 5 and one instance of the symbolic regression. We find that the combination of these two methods improves the quality of the individuals in the populations while keeping their size as small as possible and decreases the amount of resources required.

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. Koza, J.R.: Genetic Programming. The MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  2. Banzhaf, W., Langdon, W.B.: Some considerations on the reason of bloat. Genetic Programming and Evolvable Machines 3, 81–91 (2002)

    Article  MATH  Google Scholar 

  3. Langdon, W.B., Poli, R.: Fitness causes bloat. In: Roy, R., Chawdhry, P.K., Pant, R.K. (eds.) Soft Computing in Engineering Design and Manufacturing, pp. 13–22. Springer, London (1997)

    Google Scholar 

  4. Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, Berlin (2002)

    MATH  Google Scholar 

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

    Article  Google Scholar 

  6. Vanneschi, L.: Theory and Practice for Efficient Genetic Programming. PhD thesis, University of Lausanne, Switzerland (2004)

    Google Scholar 

  7. Fernández, F., Tomassini, M., Vanneschi, L.: Saving computational effort in genetic programming by means of plagues. In: Congress on Evolutionary Computation (CEC 2003). IEEE Press, Piscataway (2003)

    Google Scholar 

  8. Fernández, F., Tomassini, M., Vanneschi, L.: A new technique for dynamic size populations in genetic programming. In: Congress on Evolutionary Computation (CEC 2004). IEEE Press, Piscataway (2004)

    Google Scholar 

  9. Arabas, J., Michalewicz, Z., Mulawka, J.: A genetic algorithm with varying population size. In: Proceedings of the 1994 IEEE Conference on Evolutionary Computation, pp. 73–78. IEEE Press, Piscataway (1994)

    Google Scholar 

  10. Eiben, A.E., Marchiori, E., Valkó, V.A.: Evolutionary algorithms with on-the-fly population size adjustment. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 41–50. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Krink, T., Mayoh, B.H., Michalewicz, Z.: A patchwork model for evolutionary algorithms with structured and variable size populations. In: Banzhaf, W., et al. (eds.) Genetic and evolutionary conference, GECCO 1999, vol. 2, pp. 1321–1328. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  12. Olsson, B.: Optimization using a host-parasite model with variable-size distributed populations. In: Third International Conference on Evolutionary Computation, pp. 295–299. IEEE Press, Piscataway (1996)

    Chapter  Google Scholar 

  13. Fernández, F., Tomassini, M., Vanneschi, L.: An empirical study of multipopulation genetic programming. Genetic Programming and Evolvable Machines 4(1), 21–52 (2003)

    Article  MATH  Google Scholar 

  14. Fernández, F., Vanneschi, L., Tomassini, M.: The effect of plagues in genetic programming: a study of variable-size populations. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 317–326. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Galeano, G., Fernández, F., Tomassini, M., Vanneschi, L.: Studying the influence of synchronous and asynchronous parallel GP on programs length evolution. In: Congress on Evolutionary Computation (CEC 2002), pp. 1727–1732. IEEE Press, Piscataway (2002)

    Google Scholar 

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

  17. Burke, E.K., Gustafson, S., Kendall, G.: Diversity in genetic programming: An analysis of measures and correlation with fitness. IEEE Transactions on Evolutionary Computation 8(1), 47–62 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rochat, D., Tomassini, M., Vanneschi, L. (2005). Dynamic Size Populations in Distributed Genetic Programming. In: Keijzer, M., Tettamanzi, A., Collet, P., van Hemert, J., Tomassini, M. (eds) Genetic Programming. EuroGP 2005. Lecture Notes in Computer Science, vol 3447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31989-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31989-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31989-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics