Evolution strategies – A comprehensive introduction

This article gives a comprehensive introduction into one of the main branches of evolutionary computation – the evolution strategies (ES) the history of which dates back to the 1960s in Germany. Starting from a survey of history the philosophical background is explained in order to make understandable why ES are realized in the way they are. Basic ES algorithms and design principles for variation and selection operators as well as theoretical issues are presented, and future branches of ES research are discussed.

[1]  John H. Holland,et al.  Outline for a Logical Theory of Adaptive Systems , 1962, JACM.

[2]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[3]  Hans-Paul Schwefel,et al.  TWO-PHASE NOZZLE AND HOLLOW CORE JET EXPERIMENTS. , 1970 .

[4]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

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

[6]  Dietrich Hartmann,et al.  Optimierung balkenartiger Zylinderschalen aus Stahlbeton mit elastischem und plastischem Werkstoffverhalten , 1974 .

[7]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

[9]  E. T. Jaynes,et al.  Where do we Stand on Maximum Entropy , 1979 .

[10]  Hans-Paul Schwefel,et al.  Numerical optimization of computer models , 1981 .

[11]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[12]  G. Rappl.  On Linear Convergence of a Class of Random Search Algorithms , 1989 .

[13]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[14]  H. Beyer.  Simulation of Steady States in Dissipative Systems by Darwin’s Paradigm of Evolution , 1990 .

[15]  Michael Herdy,et al.  Application of the 'Evolutionsstrategie' to Discrete Optimization Problems , 1990, PPSN.

[16]  Frank Kursawe,et al.  A Variant of Evolution Strategies for Vector Optimization , 1990, PPSN.

[17]  Frank Kursawe,et al.  Evolution Strategies for Vector Optimization , 1992 .

[18]  Michael Herdy,et al.  Reproductive Isolation as Strategy Parameter in Hierarichally Organized Evolution Strategies , 1992, PPSN.

[19]  Günter Rudolph,et al.  On Correlated Mutations in Evolution Strategies , 1992, PPSN.

[20]  G. Unter Rudolph.  On Correlated Mutations in Evolution Strategies , 1992 .

[21]  D. Farnsworth.  A First Course in Order Statistics , 1993 .

[22]  John H. Holland,et al.  When will a Genetic Algorithm Outperform Hill Climbing , 1993, NIPS.

[23]  Hans-Paul Schwefel,et al.  Evolution and Optimum Seeking: The Sixth Generation , 1993 .

[24]  Kalyanmoy Deb,et al.  Long Path Problems , 1994, PPSN.

[25]  N. Hansen,et al.  Step-Size Adaptation Based on Non-Local Use Selection Information , 1994 .

[26]  Nikolaus Hansen,et al.  Step-Size Adaption Based on Non-Local Use of Selection Information , 1994, PPSN.

[27]  L. Altenberg.  The evolution of evolvability in genetic programming , 1994 .

[28]  Günter Rudolph,et al.  An Evolutionary Algorithm for Integer Programming , 1994, PPSN.

[29]  B. Arnold,et al.  A first course in order statistics , 1994 .

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

[31]  John H. Holland,et al.  Hidden Order: How Adaptation Builds Complexity , 1995 .

[32]  John R. Koza,et al.  Hidden Order: How Adaptation Builds Complexity. , 1995, Artificial Life.

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

[34]  Günter Rudolph,et al.  Contemporary Evolution Strategies , 1995, ECAL.

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

[36]  Volkmar Pieper,et al.  Wahrscheinlichkeitsrechnung und mathematische Statistik , 1995 .

[37]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.

[38]  Günter Rudolph,et al.  How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time , 1996, Evolutionary Computation.

[39]  Cornelia Kappler,et al.  Refueling of a Nuclear Power Plant: Comparison of a Naive and a Specialized Mutation Operator , 1996, PPSN.

[40]  Nikolaus Hansen,et al.  Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[41]  David B. Fogel,et al.  A history of evolutionary computation , 2018, Evolutionary Computation 1.

[42]  Hans-Georg Beyer,et al.  The Dynamics of Evolution Strategies in the Optimization of Traveling Salesman Problems , 1997, Evolutionary Programming.

[43]  N. Hansen,et al.  Convergence Properties of Evolution Strategies with the Derandomized Covariance Matrix Adaptation: T , 1997 .

[44]  Bernhard Sendhoff,et al.  A Condition for the Genotype-Phenotype Mapping: Causality , 1997, ICGA.

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

[46]  David B. Fogel,et al.  Evolutionary algorithms in theory and practice , 1997, Complex.

[47]  Jeffrey Horn,et al.  Handbook of evolutionary computation , 1997 .

[48]  F. Kursawe,et al.  On natural life's tricks to survive and evolve , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[49]  David B. Fogel,et al.  Evolutionary Computation: The Fossil Record , 1998 .

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

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

[52]  Marco Laumanns,et al.  A Spatial Predator-Prey Approach to Multi-objective Optimization: A Preliminary Study , 1998, PPSN.

[53]  Heinz Mühlenbein,et al.  FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions , 1999, Evolutionary Computation.

[54]  X. Yao.  Evolving Artificial Neural Networks , 1999 .

[55]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

[56]  Frank Kursawe,et al.  Grundlegende empirische Untersuchungen der Parameter von Evolutionsstrategien - Metastrategien , 1999 .

[57]  Ahmet Irfan Oyman,et al.  Convergence behavior of evolution strategies on ridge functions , 1999 .

[58]  H. Beyer,et al.  Some observations on the interaction of recombination and self-adaptation in evolution strategies , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[59]  Thomas Jansen,et al.  Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen , 2000, Ausgezeichnete Informatikdissertationen.

[60]  H. Beyer.  Evolutionary algorithms in noisy environments : theoretical issues and guidelines for practice , 2000 .

[61]  Dirk Wiesmann,et al.  Metric Based Evolutionary Algorithms , 2000, EuroGP.

[62]  Hans-Georg Beyer,et al.  Analysis of the (/, )-ES on the Parabolic Ridge , 2000, Evolutionary Computation.

[63]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[64]  Hans-Georg Beyer,et al.  Local Performance of the (μ/μ, μ)-ES in a Noisy Environment , 2000, FOGA.

[65]  A I Oyman,et al.  Analysis of the (1, )-ES on the Parabolic Ridge , 2000, Evolutionary Computation.

[66]  Günter Rudolph,et al.  Convergence properties of some multi-objective evolutionary algorithms , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[67]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods On the Choice of the Mutation Probability for the ( 1 + 1 ) EA , 2006 .

[68]  Hans-Georg Beyer,et al.  On the performance of (1,l)-Evolution Strategies at the ridge function class , 2001 .

[69]  増山 繁,et al.  グラフの構造的特徴と効率の良い並列アルゴリズムについて (Algorithm Engineering as a New Paradigm) , 2001 .

[70]  Ingo Wegener,et al.  Theoretical Aspects of Evolutionary Algorithms , 2001, ICALP.

[71]  Kalyanmoy Deb,et al.  On self-adaptive features in real-parameter evolutionary algorithms , 2001, IEEE Trans. Evol. Comput..

[72]  Hans-Georg Beyer,et al.  The Theory of Evolution Strategies , 2001, Natural Computing Series.

[73]  Marco Laumanns,et al.  Mutation Control and Convergence in Evolutionary Multi-Object Optimization , 2001 .

[74]  Hans-Georg Beyer,et al.  On the performance of (1, Lambda)-evolution strategies for the ridge function class , 2001, IEEE Trans. Evol. Comput..

[75]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[76]  Hans-Georg Beyer,et al.  Local performance of the (1 + 1)-ES in a noisy environment , 2002, IEEE Trans. Evol. Comput..

[77]  Hans-Georg Beyer,et al.  Performance analysis of evolution strategies with multi-recombination in high-dimensional RN-search spaces disturbed by noise , 2002, Theor. Comput. Sci..

[78]  Thomas Jansen,et al.  The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help , 2002, Algorithmica.

[79]  Wolfgang Banzhaf,et al.  Advances in Artificial Life , 2003, Lecture Notes in Computer Science.

[80]  Reinhard Lohmann,et al.  Structure evolution and incomplete induction , 1993, Biological Cybernetics.

[81]  Ingo Wegener,et al.  Real royal road functions--where crossover provably is essential , 2001, Discret. Appl. Math..

[82]  Ingo Wegener,et al.  On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions , 2005, J. Discrete Algorithms.