Skip to main content

On the “Explorative power” of ES/EP-like algorithms

  • Conference paper
  • First Online:

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

Abstract

This paper discusses the question how ES/EP-like algorithms perform the evolutionary search in real-valued N-dimensional parameter spaces. It will be shown that the sometimes invoked model of a perturbed gradient search does not seem to give an appropriate picture of the search process. Instead, the search behavior is described as the antagonism of exploitation and exploration, where exploitation works in one dimension, whereas the exploration is a random walk on a (N−1)-dimensional manifold in the search space. As an example the exploration dynamics on the sphere model will be investigated.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. T. Alander. Indexed Bibliography of Genetic Algorithms. Report, University of Vaasa, Department of Information Technology and Production Economics, 1996. available via ftp.uwasa.fi:/cs/report94-1/ga96bib.ps.Z.

    Google Scholar 

  2. H.-G. Beyer. Toward a Theory of Evolution Strategies: On the Benefit of Sex — the (μ/μ, λ)-Theory. Evolutionary Computation, 3(1):81–111, 1995.

    Google Scholar 

  3. H.-G. Beyer. Toward a Theory of Evolution Strategies: The (μ, λ)-Theory. Evolutionary Computation, 2(4):381–407, 1995.

    Google Scholar 

  4. H.-G. Beyer. Toward a Theory of Evolution Strategies: Self-Adaptation. Evolutionary Computation, 3(3):311–347, 1996.

    Google Scholar 

  5. H.-G. Beyer. Zur Analyse der Evolutionsstrategien. Habilitationsschrift, University of Dortmund, 1996.

    Google Scholar 

  6. H.-G. Beyer. An Alternative Explanation for the Manner in which Genetic Algorithms Operate. BioSystems, 41:1–15, 1997.

    Google Scholar 

  7. H.-G. Beyer and D. B. Fogel. A Note on the Escape Probabilities for Two Alternative Methods of Selection under Gaussian Mutation. In P.J. Angeline, R.G. Reynolds, J.R McDonnell, and R. Eberhart, editors, Evolutionary Programming VI: Proceedings of the Sixth Annual Conference on Evolutionary Programming, pages 265–274, Heidelberg, 1997. Springer-Verlag.

    Google Scholar 

  8. K. S. Miller. Multidimensional Gaussian Distributions. J. Wiley, New York, 1964.

    Google Scholar 

  9. H. Mühlenbein and D. Schlierkamp-Voosen. Predictive models for the Breeder Genetic Algorithm. Evolutionary Computation, 1(1):25–49, 1993.

    Google Scholar 

  10. I. Rechenberg. Evolutionsstrategie '94. Frommann-Holzboog Verlag, Stuttgart, 1994.

    Google Scholar 

  11. A. Törn and A. Zilinskas. Global Optimization. Springer-Verlag, Berlin, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

V. W. Porto N. Saravanan D. Waagen A. E. Eiben

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beyer, HG. (1998). On the “Explorative power” of ES/EP-like algorithms. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040785

Download citation

  • DOI: https://doi.org/10.1007/BFb0040785

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64891-8

  • Online ISBN: 978-3-540-68515-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics