Evolutionary programming made faster

Evolutionary programming (EP) has been applied with success to many numerical and combinatorial optimization problems in recent years. EP has rather slow convergence rates, however, on some function optimization problems. In the paper, a "fast EP" (FEP) is proposed which uses a Cauchy instead of Gaussian mutation as the primary search operator. The relationship between FEP and classical EP (CEP) is similar to that between fast simulated annealing and the classical version. Both analytical and empirical studies have been carried out to evaluate the performance of FEP and CEP for different function optimization problems. The paper shows that FEP is very good at search in a large neighborhood while CEP is better at search in a small local neighborhood. For a suite of 23 benchmark problems, FEP performs much better than CEP for multimodal functions with many local minima while being comparable to CEP in performance for unimodal and multimodal functions with only a few local minima. The paper also shows the relationship between the search step size and the probability of finding a global optimum and thus explains why FEP performs better than CEP on some functions but not on others. In addition, the importance of the neighborhood size and its relationship to the probability of finding a near-optimum is investigated. Based on these analyses, an improved FEP (IFEP) is proposed and tested empirically. This technique mixes different search operators (mutations). The experimental results show that IFEP performs better than or as well as the better of FEP and CEP for most benchmark problems tested.

[1]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

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

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

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

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

[6]  Kumar Chellapilla,et al.  Combining mutation operators in evolutionary programming , 1998, IEEE Trans. Evol. Comput..

[7]  P. Husbands Evolving artificial intelligence , 2001, Trends in Cognitive Sciences.

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

[9]  D. Varberg,et al.  Calculus with Analytic Geometry , 1968 .

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

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

[12]  D. Fogel Applying evolutionary programming to selected traveling salesman problems , 1993 .

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

[14]  P. A. P. Moran,et al.  An introduction to probability theory , 1968 .

[15]  Joachim Born,et al.  An Evolution Strategy with Adaption of the Step Sizes by a Variance Function , 1996, PPSN.

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

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

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

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

[20]  C. H. Edwards,et al.  Calculus with analytic geometry , 1994 .

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

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

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

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

[25]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .