Skip to main content
SpringerLink
Log in

Adaption of Operator Probabilities in Genetic Programming

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

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

Included in the following conference series:

Abstract

In this work we tried to reduce the number of free parameters within Genetic Programming without reducing the quality of the results. We developed three new methods to adapt the probabilities, different genetic operators are applied with. Using two problems from the areas of symbolic regression and classification we showed that the results in these cases were better than randomly chosen parameter sets and could compete with parameter sets chosen with empirical knowledge.

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. P.J. Angeline: Adaptive and Self-adaptive Evolutionary Computations. In: M. Palaniswami, Y. Attikiouzel, R. Marks, D. Fogel and T. Fukuda (Eds.) Computational Intelligence: A Dynamic System Perspective, NJ: IEEE Press, 152–161, 1995

    Google Scholar 

  2. P.J. Angeline: Two Self-Adaptive Crossover Operators for Genetic Programming. In: P. Angeline, K. Kinnear (Eds.) Advances in Genetic Programming II. Cambridge, MA: MIT Press, 89–110, 1996

    Google Scholar 

  3. J. Arabas, Z. Michalewicz and J. Mulawka: GAVaPS-a Genetic Algorithm with Varying Population Size. In: Procceedings of the First IEEE Conference on Evolutionary Computation. Orlando, Florida: IEEE Press. 73–78, 1994

    Chapter  Google Scholar 

  4. T. Bäck, A.E. Eiben and N.A.L. van der Vaart: An empirical study on GAs “without parameters”. In: Parallel Problem Solving from Nature-PPSN VI. Berlin: Springer-Verlag, 315–324, 2000

    Chapter  Google Scholar 

  5. Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming: An Introduction. San Francisco, CA: Morgan Kaufmann, 1998

    MATH  Google Scholar 

  6. Brameier, M. and Banzhaf, W: Evolving Teams of Predictors with Genetic Programming. Technical Report, University of Dortmund, Computational Intelligence, Collaborative Research Center 531, 2001. To appear

    Google Scholar 

  7. W.J. Conover: Practical nonparametric statistics. New York: John Wiley & Sons, 309–314, 1971

    Google Scholar 

  8. L. Davis: Adapting Operator Probabilities in Genetic Algorithms. In: J.D. Schaffer (Ed.) Procceedings of the Third International Conference on Genetic Algorithms and Their Applications. San Mateo, CA: Morgan Kaufmann, 61–69, 1989

    Google Scholar 

  9. N. Hansen and A. Ostermeier: Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation. In: Proceedings of the 1996 IEEE International Conference on Evolutionary Computation. 312-317, 1996

    Google Scholar 

  10. J.R. Koza: Genetic Programming: On the Programming of Computers by Natural Selection. Cambridge, MA: MIT Press, 1992

    MATH  Google Scholar 

  11. P. Marenbach and H. Pohlheim: Generation of Structured Process Models Using Genetic Programming. In: Fogarty, T.C. (Ed.) Evolutionary Computing. Selected Papers, volume 1143 of Lecture Notes in Computer Science, Berlin: Springer Verlag, 102–109, 1996

    Google Scholar 

  12. R. Poli: Some Steps Towards a Form of Parallel Distributed Genetic Programming. In: The 1st Online Workshop on Soft Computing (WSC1). http://www.bioele.nuee.nagoya-u.ac.jp/wsc1/, 1996

  13. H.-P. Schwefel: Evolution and Optimum Seeking. New York: John Wiley & Sons, Inc., 1995

    Google Scholar 

  14. W.M. Spears: Adapting Crossover in Evolutionary Algorithms. In: R. Reynolds and D.B. Fogel (Eds.) Procceedings of the Fourth Annual Conference on Evolutionary Programming. MIT Press, 367–384, 1995

    Google Scholar 

  15. A. Teller and M. Veloso: PADO: A new learning architecture for object recognition. In: Symbolic Visual Learning. Oxford University Press, 81–116, 1996

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. System Analysis, Computer Science Department, University of Dortmund, D, 44221, Dortmund, Germany

    Jens Niehaus & Wolfgang Banzhaf

Authors
  1. Jens Niehaus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfgang Banzhaf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Birmingham, Birmingham

    Julian Miller

  2. Computer Science Institute, University of Lausanne, Lausanne

    Marco Tomassini

  3. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy

    Pier Luca Lanzi

  4. Computer Science and Information Systems, University of Limerick, Limerick

    Conor Ryan

  5. Dipartimento di Tecnologie dell’Informazione, Università degli Studi di Milano, Italy

    Andrea G. B. Tettamanzi

  6. Department of Computer Science, University College London, London

    William B. Langdon

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Niehaus, J., Banzhaf, W. (2001). Adaption of Operator Probabilities in Genetic Programming. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tettamanzi, A.G.B., Langdon, W.B. (eds) Genetic Programming. EuroGP 2001. Lecture Notes in Computer Science, vol 2038. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45355-5_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-45355-5_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41899-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation