Skip to main content

An Emperical Study on GAs “Without Parameters”

  • Conference paper

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

Abstract

In this paper we implement GAs that have one or more parameters that are adjusted during the run. In particular we use an existing self-adaptive mutation rate mechanism, propose a new mechanism for self-adaptive crossover rates, and redesign an existing variable population size model. We compare the simple GA with GAs featuring only one of the parameter adjusting mechanisms and with a GA that applies all three mechanisms - and is therefore almost “parameterless”. The experimental results on a carefully designed test suite indicate the superiority of the parameterless GA and give a hint on the power of adapting the population size.

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. Ackley, D.H.: A Connectionist Machine for Genetic Hillclimbing, Kluwer, Boston, 1987.

    Google Scholar 

  2. Bäck, T.: The Interaction of Mutation Rate, Selection, and Self-Adaptation within a Genetic Algorithm, in [MäMa92], pp.85–94.

    Google Scholar 

  3. Bäck, T.: Self-Adaptation in Genetic Algorithms, in [VaBo92], pp.263–271.

    Google Scholar 

  4. Bäck, T., Fogel, D.B., & Michalewicz, Z. (editors): Handbook of Evolutionary Computation, Institute of Physics Publishing & Oxford University Press, New York, 1997.

    MATH  Google Scholar 

  5. Bäck, T., & Michalewicz, Z.: Test Landscapes, in Fogel, D.B., & Michalewicz, Z. (editors): Handbook of Evolutionary Computation, Institute of Physics Publishing & Oxford University Press, New York, 1997 [BFM97], Chapter B2.7, pp. 14–20.

    Google Scholar 

  6. Bäck, T., & Schwefel, H-P.: An Overview of Evolutionary Algorithms for Parameter Optimization, Evolutionary Computation, Vol.1, No.1, pp. 1–23, 1993.

    Google Scholar 

  7. Davis, L.: Adapting Operator Probabilities in Genetic Algorithms, in [Scha89], pp. 61–69.

    Google Scholar 

  8. Deb, K.: Deceptive Landscapes, in Fogel, D.B., & Michalewicz, Z. (editors): Handbook of Evolutionary Computation, Institute of Physics Publishing & Oxford University Press, New York, 1997 [BFM97], Chapter B2.7, pp.1–5.

    Google Scholar 

  9. De Jong, K.A.: An Analysis of the Behaviour of a Class of Genetic Adaptive Systems. Ph.d. dissertation, Department of Computer Science, University of Michigan, Ann Arbor, Michigan, 1975.

    Google Scholar 

  10. Eiben, A.E., Hinterding, R., & Michalewicz, Z.: Parameter Control in Evolutionary Algorithms, IEEE Transactions on Evolutionary Computation, Vol.3, No.2, pp. 124–141, 1999.

    Article  Google Scholar 

  11. Eshelman, L.J. (editor): Proceedings of the Sixth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, San Francisco, California, 1995.

    Google Scholar 

  12. Fogarty, T.C., & Smith, J.: Self Adaptation of Mutation Rates in a Steady-State Genetic Algorithm, in [ICEC96], pp.318–323.

    Google Scholar 

  13. Hoffmeister, F., & Bäck, T.: Genetic Algorithms and Evolution Strategies: Similarities and Differences, in Männer, R.: Parallel Problem Solving from Nature-PPSN 1 (or Lecture Notes in Computer Science; Vol.496), Springer-Verlag, Berlin, 1991 [ScMä91], pp.455–470.

    Chapter  Google Scholar 

  14. Julstrom, B.A.: What have you done for me lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm, in [Eshe95], pp.81–87.

    Google Scholar 

  15. Michalewicz, Z.: Genetic Algorithms + Datastructures = Evolution Programs, 2nd extendend edition, Springer-Verlag, New York, 1994.

    Google Scholar 

  16. Rosenbrock, H.H.: An Automatic Method for Finding the Greatest or Least Value of a Function, The Computer Journal, Vol.3, No.3, pp.175–184, 1960.

    Article  Google Scholar 

  17. Schaffer, J.D. (editor): Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, San Mateo, California, 1989.

    Google Scholar 

  18. Schwefel, H-P., & Männer, R.: Parallel Problem Solving from Nature-PPSN 1 (or Lecture Notes in Computer Science; Vol.496), Springer-Verlag, Berlin, 1991.

    Google Scholar 

  19. Torn, A., & Zilinskas, A.: Global Optimization (or Lecture Notes in Computer Science; Vol.350), Springer-Verlag, Berlin, 1989.

    Google Scholar 

  20. van der Vaart, N.A.L.: Towards Totally Self-Adjusting Genetic Algorithms: Let Nature Sort it Out, Masters Thesis, Leiden University, 1999.

    Google Scholar 

  21. Whitley, L.D., Mathias, K.E., Rana, S., & Dzubera, J.: Building Better Test Functions, in [Eshe95], pp.239–246.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bäck, T., Eiben, A.E., van der Vaart, N.A.L. (2000). An Emperical Study on GAs “Without Parameters”. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-45356-3_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41056-0

  • Online ISBN: 978-3-540-45356-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics