Fast Evolution Strategies

Evolution strategies are a class of general optimisation algorithms which are applicable to functions that are multimodal, non-differentiable, or even discontinuous. Although recombination operators have been introduced into evolution strategies, their primary search operator is still mutation. Classical evolution strategies rely on Gaussian mutations. A new mutation operator based on the Cauchy distribution is proposed in this paper. It is shown empirically that the new evolution strategy based on Cauchy mutation outperforms the classical evolution strategy on most of the 23 benchmark problems tested in this paper. These results, along with those obtained by fast evolutionary programming

[1]  Bruce E. Rosen,et al.  Genetic Algorithms and Very Fast Simulated Reannealing: A comparison , 1992 .

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

[3]  Emile H. L. Aarts,et al.  Global optimization and simulated annealing , 1991, Math. Program..

[4]  Thomas Bäck,et al.  An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.

[5]  Cornelia Kappler,et al.  Are Evolutionary Algorithms Improved by Large Mutations? , 1996, PPSN.

[6]  Thomas Bäck,et al.  Evolutionary Algorithms in Theory and Practice , 1996 .

[7]  David B. Fogel,et al.  An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.

[8]  X. Yao,et al.  Analysing crossover operators by search step size , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[9]  Xin Yao,et al.  Fast Evolutionary Programming , 1996, Evolutionary Programming.

[10]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[11]  Robert G. Reynolds,et al.  Evolutionary computation: Towards a new philosophy of machine intelligence , 1997 .

[12]  Xin Yao,et al.  An Analysis of Evolutionary Algorithms Based on Neighborhood and Step Sizes , 1997, Evolutionary Programming.

[13]  David B. Fogel,et al.  System Identification Through Simulated Evolution: A Machine Learning Approach to Modeling , 1991 .

[14]  Xin Yao,et al.  A new simulated annealing algorithm , 1995, Int. J. Comput. Math..

[15]  Thomas Bäck,et al.  Evolutionary computation: an overview , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[16]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[17]  H. Szu,et al.  Nonconvex optimization by fast simulated annealing , 1987, Proceedings of the IEEE.

[18]  David B. Fogel,et al.  Tuning Evolutionary Programming for Conformationally Flexible Molecular Docking , 1996, Evolutionary Programming.

[19]  L. Devroye.  Non-Uniform Random Variate Generation , 1986 .

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

[21]  Thomas Bäck,et al.  An Overview of Evolutionary Computation , 1993, ECML.

[22]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[23]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

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