Theory of evolution strategies - a tutorial

Evolution strategies form a class of evolutionary optimization procedures the behavior of which is comparatively well understood theoretically, at least for simple cases. An approach commonly adopted is to view the optimization as a dynamical process. Local performance measures are introduced so as to arrive at quantitative results regarding the performance of the algorithms. By employing simple fitness models and approximations exact in certain limits, analytical results can be obtained for multi-parent strategies including recombination and even for some simple strategies employing self-adaptation of strategy parameters. This tutorial outlines the basic algorithms and the methods applied to their analysis. Local performance measures and the most commonly used fitness models are introduced and results from performance analyses are presented. Basic working principles of evolution strategies — namely the evolutionary progress principle, the genetic repair principle, and the phenomenon of speciation — are identified and discussed. Finally, open problems and areas of future research are outlined.

[1]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[2]  Thomas Jansen,et al.  On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm , 1998, PPSN.

[3]  I. Wegener,et al.  A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with Boolean inputs , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[4]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[5]  H. P. Schwefel,et al.  Numerische Optimierung von Computermodellen mittels der Evo-lutionsstrategie , 1977 .

[6]  Ingo Wegener,et al.  A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs , 1998, Evolutionary Computation.

[7]  H. Beyer An alternative explanation for the manner in which genetic algorithms operate. , 1997, Bio Systems.

[8]  Zbigniew Michalewicz,et al.  Evolutionary Computation 2 , 2000 .

[9]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: Self-Adaptation , 1995, Evolutionary Computation.

[10]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: Some Asymptotical Results from the (1,+ )-Theory , 1993, Evolutionary Computation.

[11]  Günter Rudolph,et al.  Local convergence rates of simple evolutionary algorithms with Cauchy mutations , 1997, IEEE Trans. Evol. Comput..

[12]  Zbigniew Michalewicz,et al.  Evolutionary Computation 1 , 2018 .

[13]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: The (, )-Theory , 1994, Evolutionary Computation.

[14]  W. Vent,et al.  Rechenberg, Ingo, Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. 170 S. mit 36 Abb. Frommann‐Holzboog‐Verlag. Stuttgart 1973. Broschiert , 1975 .

[15]  Hans-Paul Schwefel,et al.  Where Elitists Start Limping Evolution Strategies at Ridge Functions , 1998, PPSN.

[16]  Dirk V. Arnold,et al.  Evolution strategies in noisy environments- a survey of existing work , 2001 .

[17]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: On the Benefits of Sex the (/, ) Theory , 1995, Evolutionary Computation.