Skip to main content

A note on the escape probabilities for two alternative methods of selection under Gaussian mutation

  • Theory and Analysis of Evolutionary Computations
  • Conference paper
  • First Online:
Evolutionary Programming VI (EP 1997)

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

Included in the following conference series:

Abstract

The probabilities for generating improved solutions under two forms of selection under Gaussian mutation are studied. The results indicate that, under some simplifying assumptions, there can be advantage to retaining offspring that are of lesser value than the parent that generates them. The limitations of the analysis are identified, as well as directions for future research.

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. T. Bäck (1994) “Selective pressure in evolutionary algorithms,” Proceedings of the 1994 IEEE International Conference on Evolutionary Computation, IEEE Press, NY, pp. 57–62.

    Google Scholar 

  2. T. Bäck and H.-P. Schwefel (1993) “An overview of evolutionary algorithms for parameter optimization,” Evolutionary Computation, 1:1, 1–24.

    Google Scholar 

  3. D.B. Fogel (1988) “An evolutionary approach to the traveling salesman problem,” Biological Cybernetics, 60:2, 139–144.

    Article  Google Scholar 

  4. G.B. Fogel and D.B. Fogel (1995) “Continuous evolutionary programming: Analysis and experiments,” Cybernetics and Systems, 26, 79–90.

    Google Scholar 

  5. L.J. Fogel (1964) “On the organization of intellect,” Doctoral Dissertation, UCLA.

    Google Scholar 

  6. L.J. Fogel, A.J. Owens, and M.J. Walsh (1966) Artificial Intelligence Through Simulated Evolution, John Wiley, NY.

    Google Scholar 

  7. R. Galar (1985) “Handicapped individua in evolutionary processes,” Biological Cybernetics, 53, 1–9.

    Article  PubMed  Google Scholar 

  8. R. Galar (1989) “Evolutionary search with soft selection,” Biological Cybernetics, 60, 357–364.

    Article  Google Scholar 

  9. D.E. Goldberg (1990) “A note on Boltzmann tournament selection for genetic algorithms and population-oriented simulated annealing,” Complex Systems, 4, 445–460.

    Google Scholar 

  10. D.E. Goldberg and K. Deb. (1991) “A comparative analysis of selection schemes used in genetic algorithms,” Foundations of Genetic Algorithms, G.J.E. Rawlins (ed.), Morgan Kaufmann, San Mateo, CA, pp. 69–93.

    Google Scholar 

  11. J.H. Holland (1975) Adaptation in Natural and Artificial Systems, Univ. Mich. Press, Ann Arbor.

    Google Scholar 

  12. I. Rechenberg (1965) “Cybernetic solution path of an experimental problem,” Royal Aircraft Establishment, Library Translation No. 1122, Ministry of Aviation, Farnborough Hants.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Peter J. Angeline Robert G. Reynolds John R. McDonnell Russ Eberhart

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beyer, HG., Fogel, D.B. (1997). A note on the escape probabilities for two alternative methods of selection under Gaussian mutation. In: Angeline, P.J., Reynolds, R.G., McDonnell, J.R., Eberhart, R. (eds) Evolutionary Programming VI. EP 1997. Lecture Notes in Computer Science, vol 1213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014817

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics