Skip to main content
Top

2016 | OriginalPaper | Chapter

5. Evolutionary Strategies

Authors : Ke-Lin Du, M. N. S. Swamy

Published in: Search and Optimization by Metaheuristics

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Evolutionary strategy (ES) paradigm is one of the most successful EAs. Evolutionary gradient search and gradient evolution are two methods that use EA to construct gradient information for directing the search efficiently. Covariance matrix adaptation (CMA) ES [11] accelerates the search efficiency by supposing that the local solution space of the current point has a quadratic shape.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Arnold D, Salomon R. Evolutionary gradient search revisited. IEEE Trans Evol Comput. 2007;11(4):480–95.CrossRef Arnold D, Salomon R. Evolutionary gradient search revisited. IEEE Trans Evol Comput. 2007;11(4):480–95.CrossRef
2.
go back to reference Back T, Schwefel H. An overview of evolutionary algorithms for parameter optimization. Evol Comput. 1993;1(1):1–23.CrossRef Back T, Schwefel H. An overview of evolutionary algorithms for parameter optimization. Evol Comput. 1993;1(1):1–23.CrossRef
3.
go back to reference Beyer H-G. Toward a theory of evolution strategies: self-adaptation. Evol Comput. 1995;3(3):311–47.CrossRef Beyer H-G. Toward a theory of evolution strategies: self-adaptation. Evol Comput. 1995;3(3):311–47.CrossRef
4.
go back to reference Beyer H-G. Convergence analysis of evolutionary algorithms that are based on the paradigm of information geometry. Evol Comput. 2014;22(4):679–709.CrossRef Beyer H-G. Convergence analysis of evolutionary algorithms that are based on the paradigm of information geometry. Evol Comput. 2014;22(4):679–709.CrossRef
5.
go back to reference Beyer H-G, Melkozerov A. The dynamics of self-adaptive multi-recombinant evolution strategies on the general ellipsoid model. IEEE Trans Evol Comput. 2014;18(5):764–78.CrossRef Beyer H-G, Melkozerov A. The dynamics of self-adaptive multi-recombinant evolution strategies on the general ellipsoid model. IEEE Trans Evol Comput. 2014;18(5):764–78.CrossRef
6.
go back to reference Beyer H-G, Hellwig M. The dynamics of cumulative step size adaptation on the ellipsoid model. Evol Comput. 2016;24:25–57.CrossRef Beyer H-G, Hellwig M. The dynamics of cumulative step size adaptation on the ellipsoid model. Evol Comput. 2016;24:25–57.CrossRef
7.
go back to reference Eshelman LJ. The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In: Rawlins GJE, editor. Foundations of genetic algorithms. San Mateo, CA: Morgan Kaufmann; 1991. p. 265–283. Eshelman LJ. The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In: Rawlins GJE, editor. Foundations of genetic algorithms. San Mateo, CA: Morgan Kaufmann; 1991. p. 265–283.
8.
go back to reference Fogel DB. An analysis of evolutionary programming. In: Proceedings of the 1st annual conference on evolutionary programming, La Jolla, CA, May 1992. p. 43–51. Fogel DB. An analysis of evolutionary programming. In: Proceedings of the 1st annual conference on evolutionary programming, La Jolla, CA, May 1992. p. 43–51.
9.
go back to reference Fogel L, Owens J, Walsh M. Artificial intelligence through simulated evolution. New York: Wiley; 1966.MATH Fogel L, Owens J, Walsh M. Artificial intelligence through simulated evolution. New York: Wiley; 1966.MATH
10.
go back to reference Hansen N, Ostermeier A. Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of IEEE international conference on evolutionary computation, Nagoya, Japan, 1996. p. 312–317. Hansen N, Ostermeier A. Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of IEEE international conference on evolutionary computation, Nagoya, Japan, 1996. p. 312–317.
11.
go back to reference Hansen N, Ostermeier A. Completely derandomized self-adaptation in evolution strategies. Evol Comput. 2001;9(2):159–95.CrossRef Hansen N, Ostermeier A. Completely derandomized self-adaptation in evolution strategies. Evol Comput. 2001;9(2):159–95.CrossRef
12.
go back to reference Hansen N, Muller SD, Koumoutsakos P. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol Comput. 2003;11(1):1–18.CrossRef Hansen N, Muller SD, Koumoutsakos P. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol Comput. 2003;11(1):1–18.CrossRef
13.
go back to reference Herdy M. Application of the evolution strategy to discrete optimization problems.In: Schwefel HP, Manner R, editors. Parallel problem solving from nature, Lecture notes on computer science, vol. 496. Berlin: Springer; 1991. p. 188–192 Herdy M. Application of the evolution strategy to discrete optimization problems.In: Schwefel HP, Manner R, editors. Parallel problem solving from nature, Lecture notes on computer science, vol. 496. Berlin: Springer; 1991. p. 188–192
14.
go back to reference Kuo RJ, Zulvia FE. The gradient evolution algorithm: a new metaheuristic. Inf Sci. 2015;316:246–65.CrossRef Kuo RJ, Zulvia FE. The gradient evolution algorithm: a new metaheuristic. Inf Sci. 2015;316:246–65.CrossRef
15.
go back to reference Lee CY, Yao X. Evolutionary programming using mutations based on the Levy probability distribution. IEEE Trans Evol Comput. 2004;8(1):1–13.CrossRef Lee CY, Yao X. Evolutionary programming using mutations based on the Levy probability distribution. IEEE Trans Evol Comput. 2004;8(1):1–13.CrossRef
16.
go back to reference Li R, Emmerich MTM, Eggermont J, Back T, Schutz M, Dijkstra J, Reiber JHC. Mixed integer evolution strategies for parameter optimization. Evol Comput. 2013;21(1):29–64.CrossRef Li R, Emmerich MTM, Eggermont J, Back T, Schutz M, Dijkstra J, Reiber JHC. Mixed integer evolution strategies for parameter optimization. Evol Comput. 2013;21(1):29–64.CrossRef
17.
go back to reference Loshchilov I. CMA-ES with restarts for solving CEC 2013 benchmark problems. In: Proceedings of IEEE congress on evolutionary computation (CEC 2013), Cancun, Mexico, June 2013. p. 369–376. Loshchilov I. CMA-ES with restarts for solving CEC 2013 benchmark problems. In: Proceedings of IEEE congress on evolutionary computation (CEC 2013), Cancun, Mexico, June 2013. p. 369–376.
18.
go back to reference Loshchilov I. LM-CMA: an alternative to L-BFGS for large scale black-box optimization. Evol Comput. 2016. Loshchilov I. LM-CMA: an alternative to L-BFGS for large scale black-box optimization. Evol Comput. 2016.
19.
go back to reference Ostermeier A, Gawelczyk A, Hansen N. Step-size adaptation based on non-local use of selection information. In: Parallel problem solving from nature (PPSN III), Lecture notes in computer science, vol. 866. Berlin: Springer; 1994. p. 189–198. Ostermeier A, Gawelczyk A, Hansen N. Step-size adaptation based on non-local use of selection information. In: Parallel problem solving from nature (PPSN III), Lecture notes in computer science, vol. 866. Berlin: Springer; 1994. p. 189–198.
20.
go back to reference Rechenberg I. Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen biologischen Evolution. Freiburg, Germany: Formman Verlag; 1973. Rechenberg I. Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen biologischen Evolution. Freiburg, Germany: Formman Verlag; 1973.
21.
go back to reference Salomon R. Evolutionary algorithms and gradient search: similarities and differences. IEEE Trans Evol Comput. 1998;2(2):45–55.CrossRef Salomon R. Evolutionary algorithms and gradient search: similarities and differences. IEEE Trans Evol Comput. 1998;2(2):45–55.CrossRef
22.
go back to reference Schwefel HP. Numerical optimization of computer models. Chichester: Wiley; 1981.MATH Schwefel HP. Numerical optimization of computer models. Chichester: Wiley; 1981.MATH
23.
go back to reference Yao X, Liu Y, Lin G. Evolutionary programming made faster. IEEE Trans Evol Comput. 1999;3(2):82–102.CrossRef Yao X, Liu Y, Lin G. Evolutionary programming made faster. IEEE Trans Evol Comput. 1999;3(2):82–102.CrossRef
24.
go back to reference Yuen SY, Chow CK. A genetic algorithm that adaptively mutates and never revisits. IEEE Trans Evol Comput. 2009;13(2):454–72.CrossRef Yuen SY, Chow CK. A genetic algorithm that adaptively mutates and never revisits. IEEE Trans Evol Comput. 2009;13(2):454–72.CrossRef
Metadata
Title
Evolutionary Strategies
Authors
Ke-Lin Du
M. N. S. Swamy
Copyright Year
2016
DOI
https://doi.org/10.1007/978-3-319-41192-7_5

Premium Partner