Evolutionary programming using mutations based on the Levy probability distribution

Studies evolutionary programming with mutations based on the Levy probability distribution. The Levy probability distribution has an infinite second moment and is, therefore, more likely to generate an offspring that is farther away from its parent than the commonly employed Gaussian mutation. Such likelihood depends on a parameter /spl alpha/ in the Levy distribution. We propose an evolutionary programming algorithm using adaptive as well as nonadaptive Levy mutations. The proposed algorithm was applied to multivariate functional optimization. Empirical evidence shows that, in the case of functions having many local optima, the performance of the proposed algorithm was better than that of classical evolutionary programming using Gaussian mutation.

[1]  J. W. Atmar,et al.  Comparing genetic operators with gaussian mutations in simulated evolutionary processes using linear systems , 1990, Biological Cybernetics.

[2]  G. Weiss,et al.  Expected Number of Distinct Sites Visited by a Random Walk with an Infinite Variance , 1970 .

[3]  J. Reed,et al.  Simulation of biological evolution and machine learning. I. Selection of self-reproducing numeric patterns by data processing machines, effects of hereditary control, mutation type and crossing. , 1967, Journal of theoretical biology.

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

[5]  David B. Fogel,et al.  Evolving artificial intelligence , 1992 .

[6]  R. Mantegna,et al.  Fast, accurate algorithm for numerical simulation of Lévy stable stochastic processes. , 1994, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

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

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

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

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

[11]  B. Gnedenko,et al.  Limit Distributions for Sums of Independent Random Variables , 1955 .

[12]  C. Sparrow.  The Fractal Geometry of Nature , 1984 .

[13]  Anthony V. Sebald,et al.  Minimax design of neural net controllers for highly uncertain plants , 1994, IEEE Trans. Neural Networks.

[14]  Thomas Bäck,et al.  Evolutionary computation: Toward a new philosophy of machine intelligence , 1997, Complex..

[15]  Yi-Cheng Zhang,et al.  Emergence of cooperation and organization in an evolutionary game , 1997 .

[16]  David B. Fogel,et al.  Meta-evolutionary programming , 1991, [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers.

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

[18]  Xin Yao,et al.  Evolutionary algorithms with adaptive Levy mutations , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[19]  Hans-Paul Schwefel,et al.  Numerical Optimization of Computer Models , 1982 .

[20]  L. C. Stayton,et al.  On the effectiveness of crossover in simulated evolutionary optimization. , 1994, Bio Systems.

[21]  George Sugihara,et al.  Fractals in science , 1995 .