Skip to main content

Strategy adaptation by competing subpopulations

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN III (PPSN 1994)

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

Included in the following conference series:

Abstract

The breeder genetic algorithm BGA depends on a set of control parameters and genetic operators. In this paper it is shown that strategy adaptation by competing subpopulations makes the BGA more robust and more efficient. Each subpopulation uses a different strategy which competes with other subpopulations. Numerical results are presented for a number of test functions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Thomas Bäck. Self-Adaption in Genetic Algorithms. In Francisco Varela and Paul Bourgine, editors, Towards a Practice of Autonomous Systems, pages 263–271, 1992.

    Google Scholar 

  2. Thomas Bäck and Hans-Paul Schwefel. A Survey of Evolution Strategies. In Proceedings of the Fourth International Conference of Genetic Algorithms, pages 2–9, San Diego, 1991. ICGA.

    Google Scholar 

  3. Thomas Bäck and Hans-Paul Schwefel. An Overview of Evolutionary Algorithms for Parameter Optimization. Evolutionary Computation, 1:1–24, 1993.

    Google Scholar 

  4. Terence C. Fogarty. Varying the probability of Mutation in the Genetic Algorithm. In J. David Schaffer, editor, Proceedings of the Third International Conference of Genetic Algorithms, pages 104–109. Morgan-Kaufman, 1989.

    Google Scholar 

  5. Michael Herdy. Reproductive Isolation as Strategy Parameter in Hierarchical Organized Evolution Strategies. In PPSN 2 Bruxelles, pages 207–217, September 1992.

    Google Scholar 

  6. Heinz Mühlenbein and Dirk Schlierkamp-Voosen. Predictive Models for the Breeder Genetic Algorithm: Continuous Parameter Optimization. Evolutionary Computation, 1(1):25–49, 1993.

    Google Scholar 

  7. Heinz Mühlenbein and Dirk Schlierkamp-Voosen. The science of breeding and its application to the breeder genetic algorithm. Evolutionary Computation, 1(4):335–360, 1994.

    Google Scholar 

  8. H. H. Rosenbrock. An automatic method for finding the greatest or least value of a function. The Computer Journal, 3(3):175–184, 10 1960.

    Article  Google Scholar 

  9. Fabio Schoen. A Wide Class of Test Functions for Global Optimization. Journal of Global Optimization, 3(2):133–137, 1993.

    Article  Google Scholar 

  10. H.-P. Schwefel. Numerical Optimization of Computer Models. Wiley, Chichester, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Yuval Davidor Hans-Paul Schwefel Reinhard Männer

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schlierkamp-Voosen, D., Mühlenbein, H. (1994). Strategy adaptation by competing subpopulations. In: Davidor, Y., Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature — PPSN III. PPSN 1994. Lecture Notes in Computer Science, vol 866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58484-6_264

Download citation

  • DOI: https://doi.org/10.1007/3-540-58484-6_264

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58484-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics