Combining mutation operators in evolutionary programming

Traditional investigations with evolutionary programming for continuous parameter optimization problems have used a single mutation operator with a parametrized probability density function (PDF), typically a Gaussian. Using a variety of mutation operators that can be combined during evolution to generate PDFs of varying shapes could hold the potential for producing better solutions with less computational effort. In view of this, a linear combination of Gaussian and Cauchy mutations is proposed. Simulations indicate that both the adaptive and nonadaptive versions of this operator are capable of producing solutions that are statistically as good as, or better, than those produced when using Gaussian or Cauchy mutations alone.

[1]  D. Ackley A connectionist machine for genetic hillclimbing , 1987 .

[2]  D. Fogel,et al.  A comparison of methods for self-adaptation in evolutionary algorithms. , 1995, Bio Systems.

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

[4]  David B. Fogel,et al.  Multi-operator Evolutionary Programming: A Preliminary Study on Function Optimization , 1997, Evolutionary Programming.

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

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

[7]  David B. Fogel,et al.  Two new mutation operators for enhanced search and optimization in evolutionary programming , 1997, Optics & Photonics.

[8]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.

[9]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[10]  Xin Yao,et al.  Fast Evolution Strategies , 1997, Evolutionary Programming.

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

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

[13]  Ko-Hsin Liang,et al.  An Experimental Investigation of Self-Adaptation in Evolutionary Programming , 1998, Evolutionary Programming.

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

[15]  A. Griewank Generalized descent for global optimization , 1981 .