Skip to main content
SpringerLink
Log in

Evolution strategies: An alternative evolutionary algorithm

  • Invited Papers
  • Conference paper
  • First Online:
Artificial Evolution (AE 1995)

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

Included in the following conference series:

Abstract

In this paper, evolution strategies (ESs) — a class of evolutionary algorithms using normally distributed mutations, recombination, deterministic selection of the μ>1 best offspring individuals, and the principle of self-adaptation for the collective on-line learning of strategy parameters — are described by demonstrating their differences to genetic algorithms. By comparison of the algorithms, it is argued that the application of canonical genetic algorithms for continuous parameter optimization problems implies some difficulties caused by the encoding of continuous object variables by binary strings and the constant mutation rate used in genetic algorithms. Because they utilize a problem-adequate representation and a suitable self-adaptive step size control guaranteeing linear convergence for strictly convex problems, evolution strategies are argued to be more adequate for continuous problems.

The main advantage of evolution strategies, the self-adaptation of strategy parameters, is explained in detail, and further components such as recombination and selection are described on a rather general level. Concerning theory, recent results regarding convergence velocity and global convergence of evolution strategies are briefly summarized, especially including the results for (μ,λ)-ESs with recombination. It turns out that the theoretical ground of ESs provides many more results about their behavior as optimization algorithms than available for genetic algorithms, and that ESs have all properties required for global optimization methods. The paper concludes by emphasizing the necessity for an appropriate step size control and the recommendation to avoid encoding mappings by using a problem-adequate representation of solutions within evolutionary algorithms.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. T. Alander. An indexed bibliography of genetic algorithms: Years 1957–1993. Art of CAD Ltd, Espoo, Finland, 1994.

    Google Scholar 

  2. Th. Bäck. Self-Adaptation in Genetic Algorithms. In F. J. Varela and P. Bourgine, editors, Proceedings of the First European Conference on Artificial Life, pages 263–271. The MIT Press, Cambridge, MA, 1992.

    Google Scholar 

  3. Th. Bäck. Optimal mutation rates in genetic search. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 2–8. Morgan Kaufmann, San Mateo, CA, 1993.

    Google Scholar 

  4. Th. Bäck. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, 1995.

    Google Scholar 

  5. Th. Bäck. Generalized convergence models for tournament-and (μ,λ)-selection. In L. Eshelman, editor, Proceedings of the 6th International Conference on Genetic Algorithms, pages 2–8. Morgan Kaufmann Publishers, San Francisco, CA, 1995.

    Google Scholar 

  6. Th. Bäck, F. Hoffmeister, and H.-P. Schwefel. Applications of evolutionary algorithms. Report of the Systems Analysis Research Group SYS-2/92, University of Dortmund, Department of Computer Science, February 1992.

    Google Scholar 

  7. Th. Bäck and S. Khuri. An evolutionary heuristic for the maximum independent set problem. In Proceedings of the First IEEE Conference on Evolutionary Computation, pages 531–535. IEEE Press, 1994.

    Google Scholar 

  8. Th. Bäck, G. Rudolph, and H.-P. Schwefel. Evolutionary programming and evolution strategies: Similarities and differences. In D. B. Fogel and W. Atmar, editors, Proceedings of the Second Annual Conference on Evolutionary Programming, pages 11–22. Evolutionary Programming Society, San Diego, CA, 1993.

    Google Scholar 

  9. Th. Bäck and M. Schütz. Evolution strategies for mixed-integer optimization of optical multilayer systems. In Proceedings of the 4th Annual Conference on Evolutionary Programming, 1995.

    Google Scholar 

  10. Th. Bäck and H.-P. Schwefel. An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1(1):1–23, 1993.

    Google Scholar 

  11. H.-G. Beyer. Towards a theory of ‘evolution strategies’ — Results from the N-dependent (μ,λ) and the multi-recombinant (μ/μ,λ)-theory. Report of the Systems Analysis Research Group SYS-5/94, University of Dortmund, Department of Computer Science, 1994.

    Google Scholar 

  12. H.-G. Beyer. How GAs do NOT work. Understanding GAs without Schemata and Building Blocks. Report of the Systems Analysis Research Group SYS-2/95, University of Dortmund, Department of Computer Science, 1995.

    Google Scholar 

  13. H.-G. Beyer. Toward a theory of evolution strategies: On the benefits of sex — the (μ/μ,λ)-theory. Evolutionary Computation, 3(1):81–111, 1995.

    Google Scholar 

  14. R. A. Caruna and J. D. Schaffer. Representation and hidden bias: Gray vs. binary coding for genetic algorithms. In J. Laird, editor, Proceedings of the 5th International Conference on Machine Learning, pages 153–161. Morgan Kaufmann Publishers, San Mateo, CA, 1988.

    Google Scholar 

  15. L. Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, 1991.

    Google Scholar 

  16. R. Fletcher and M. J. D. Powell. A rapidly convergent descent method for minimization. Computer Journal, 6:163–168, 1963.

    Google Scholar 

  17. D. B. Fogel. Evolving Artificial Intelligence. PhD thesis, University of California, San Diego, CA, 1992.

    Google Scholar 

  18. D. B. Fogel. Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway, NJ, 1995.

    Google Scholar 

  19. L. Fogel, D. B. Fogel, and P. J. Angeline. A preliminary investigation on extending evolutionary programming to include self-adaptation on finite state machines. Informatica, 18:387–398, 1994.

    Google Scholar 

  20. L. J. Fogel, A. J. Owens, and M. J. Walsh. Artificial Intelligence through Simulated Evolution. Wiley, New York, 1966.

    Google Scholar 

  21. D. E. Goldberg. Genetic algorithms in search, optimization and machine learning. Addison Wesley, Reading, MA, 1989.

    Google Scholar 

  22. W. Gottschalk. Allgemeine Genetik. Georg Thieme Verlag, Stuttgart, 3 edition, 1989.

    Google Scholar 

  23. S. Hahn, K. H. Becks, and A. Hemker. Optimizing monte carlo generator parameters using genetic algorithms. In D. Perret-Gallix, editor, New Computing Techniques in Physics Research II — Proceedings 2nd International Workshop on Software Engineering, Artificial Intelligence and Expert Systems for High Energy and Nuclear Physics, pages 255–265, La Londe-Les-Maures, France, January 13–18 1992. World Scientific, Singapore, 1992.

    Google Scholar 

  24. R. Hinterding, H. Gielewski, and T. C. Peachey. On the nature of mutation in genetic algorithms. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the 6th International Conference, pages 65–72. Morgan Kaufmann Publishers, San Francisco, CA, 1995.

    Google Scholar 

  25. J. H. Holland. Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor, MI, 1975.

    Google Scholar 

  26. K. A. De Jong. Are genetic algorithms function optimizers ? In R. Männer and B. Manderick, editors, Parallel Problem Solving from Nature 2, pages 3–13. Elsevier, Amsterdam, 1992.

    Google Scholar 

  27. K. A. De Jong. Genetic algorithms are NOT function optimizers. In D. Whitley, editor, Foundations of Genetic Algorithms 2, pages 5–17. Morgan Kaufmann Publishers, San Mateo, CA, 1993.

    Google Scholar 

  28. S. Khuri and Th. Bäck. An evolutionary heuristic for the minimum vertex cover problem. In J. Kunze and H. Stoyan, editors, KI-94 Workshops (Extended Abstracts), pages 83–84. Gesellschaft für Informatik e. V., Bonn, 1994.

    Google Scholar 

  29. S. Khuri, Th. Bäck, and J. Heitkötter. An evolutionary approach to combinatorial optimization problems. In D. Cizmar, editor, Proceedings of the 22nd Annual ACM Computer Science Conference, pages 66–73. ACM Press, New York, 1994.

    Google Scholar 

  30. S. Khuri, Th. Bäck, and J. Heitkötter. The zero/one multiple knapsack problem and genetic algorithms. In E. Deaton, D. Oppenheim, J. Urban, and H. Berghel, editors, Proceedings of the 1994 ACM Symposium on Applied Computing, pages 188–193. ACM Press, New York, 1994.

    Google Scholar 

  31. E. Mayr. Toward a new Philosophy of Biology: Observations of an Evolutionist. The Belknap Press of Harvard University Press, Cambridge, MA, and London, GB, 1988.

    Google Scholar 

  32. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin, 1994.

    Google Scholar 

  33. J. Obalek. Rekombinationsoperatoren für Evolutionsstrategien. Diplomarbeit, Universität Dortmund, Fachbereich Informatik, 1994.

    Google Scholar 

  34. A. Ostermeier. An evolution strategy with momentum adaptation of the random number distribution. In R. Männer and B. Manderick, editors, Parallel Problem Solving from Nature 2, pages 197–206. Elsevier, Amsterdam, 1992.

    Google Scholar 

  35. I. Rechenberg. Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog, Stuttgart, 1973.

    Google Scholar 

  36. I. Rechenberg. Evolutionsstrategie '94, volume 1 of Werkstatt Bionik und Evolutionstechnik. frommann-holzboog, Stuttgart, 1994.

    Google Scholar 

  37. G. Rudolph. Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks, Special Issue on Evolutionary Computation, 5(1):96–101, 1994.

    Google Scholar 

  38. G. Rudolph. Convergence of non-elitist strategies. In Z. Michalewicz, J. D. Schaffer, H.-P. Schwefel, D. B. Fogel, and H. Kitano, editors, Proceedings of the First IEEE Conference on Evolutionary Computation, pages 63–66. IEEE Press, 1994.

    Google Scholar 

  39. M. Schütz. Eine Evolutionsstrategie für gemischt-ganzzahlige Optimierungsprobleme mit variabler Dimension. Diplomarbeit, Universität Dortmund, Fachbereich Informatik, 1994.

    Google Scholar 

  40. H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, volume 26 of Interdisciplinary Systems Research. Birkhäuser, Basel, 1977.

    Google Scholar 

  41. H.-P. Schwefel. Evolutionary learning optimum-seeking on parallel computer architectures. In A. Sydow, S. G. Tzafestas, and R. Vichnevetsky, editors, Proceedings of the International Symposium on Systems Analysis and Simulation 1988, I: Theory and Foundations, pages 217–225. Akademie-Verlag, Berlin, September 1988.

    Google Scholar 

  42. H.-P. Schwefel. Imitating evolution: Collective, two-level learning processes. In U. Witt, editor, Explaining Process and Change — Approaches to Evolutionary Economics, pages 49–63. The University of Michigan Press, Ann Arbor, MI, 1992.

    Google Scholar 

  43. H.-P. Schwefel. Natural evolution and collective optimum-seeking. In A. Sydow, editor, Computational Systems Analysis: Topics and Trends, pages 5–14. Elsevier, Amsterdam, 1992.

    Google Scholar 

  44. H.-P. Schwefel. Evolution and Optimum Seeking. Sixth-Generation Computer Technology Series. Wiley, New York, 1995.

    Google Scholar 

  45. H.-P. Schwefel and Th. Bäck. Evolution strategies ii: Theoretical aspects. In J. Périaux and G. Winter, editors, Genetic Algorithms in Engineering and Computer Science, chapter 7. Wiley, Chichester, 1995.

    Google Scholar 

  46. H.-P. Schwefel and G. Rudolph. Contemporary evolution strategies. In F. Morán, A. Moreno, J. J. Merelo, and P. Chacón, editors, Advances in Artificial Life. Third International Conference on Artificial Life, volume 929 of Lecture Notes in Artificial Intelligence, pages 893–907. Springer, Berlin, 1995.

    Google Scholar 

  47. G. Syswerda. Uniform crossover in genetic algorithms. In J. D. Schaffer, editor, Proceedings of the 3rd International Conference on Genetic Algorithms, pages 2–9. Morgan Kaufmann Publishers, San Mateo, CA, 1989.

    Google Scholar 

  48. H.-M. Voigt, H. Mühlenbein, and D. Cvetković. Fuzzy recombination for the breeder genetic algorithm. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the 6th International Conference, pages 104–111. Morgan Kaufmann Publishers, San Francisco, CA, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik Centrum Dortmund, Joseph-von-Fraunhofer-Str. 20, D-44227, Dortmund

    Thomas Bäck

Authors
  1. Thomas Bäck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Marc Alliot Evelyne Lutton Edmund Ronald Marc Schoenauer Dominique Snyers

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bäck, T. (1996). Evolution strategies: An alternative evolutionary algorithm. In: Alliot, JM., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds) Artificial Evolution. AE 1995. Lecture Notes in Computer Science, vol 1063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61108-8_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-61108-8_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation