Mutation Strategy Based on Step Size and Survival Rate for Evolutionary Programming

Evolutionary programming (EP) uses a mutation as a unique operator. Gaussian, Cauchy, Lévy, and double exponential probability distributions and single-point mutation were nominated as mutation operators. Many mutation strategies have been proposed over the last two decades. The most recent EP variant was proposed using a step-size-based self-adaptive mutation operator. In SSEP, the mutation type with its parameters is selected based on the step size, which differs from generation to generation. Several principles for choosing proper parameters have been proposed; however, SSEP still has limitations and does not display outstanding performance on some benchmark functions. In this work, we proposed a novel mutation strategy based on both the “step size” and “survival rate” for EP (SSMSEP). SSMSEP-1 and SSMSEP-2 are two variants of SSMSEP, which use “survival rate” or “step size” separately. Our proposed method can select appropriate mutation operators and update parameters for mutation operators according to diverse landscapes during the evolutionary process. Compared with SSMSEP-1, SSMSEP-2, SSEP, and other EP variants, the SSMSEP demonstrates its robustness and stable performance on most benchmark functions tested.

[1]  Xin Yao,et al.  Evolutionary programming using mutations based on the Levy probability distribution , 2004, IEEE Transactions on Evolutionary Computation.

[2]  Sancho Salcedo-Sanz,et al.  A hybrid evolutionary programming approach for optimal worst case tolerance design of magnetic devices , 2012, Appl. Soft Comput..

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

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

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

[6]  Ponnuthurai N. Suganthan,et al.  Ensemble strategies with adaptive evolutionary programming , 2010, Inf. Sci..

[7]  Kit Po Wong,et al.  Evolutionary programming based optimal power flow algorithm , 1999 .

[8]  Libin Hong,et al.  Hyper-heuristic approach: automatically designing adaptive mutation operators for evolutionary programming , 2021, Complex & Intelligent Systems.

[9]  Marco A. Contreras-Cruz,et al.  Mobile robot path planning using artificial bee colony and evolutionary programming , 2015, Appl. Soft Comput..

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

[11]  Xin Yao,et al.  Adapting Self-Adaptive Parameters in Evolutionary Algorithms , 2001, Applied Intelligence.

[12]  P. K. Chattopadhyay,et al.  Evolutionary programming techniques for economic load dispatch , 2003, IEEE Trans. Evol. Comput..

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

[14]  Libin Hong,et al.  Automated Design of Probability Distributions as Mutation Operators for Evolutionary Programming Using Genetic Programming , 2013, EuroGP.

[15]  Libin Hong,et al.  A hyper-heuristic approach to automated generation of mutation operators for evolutionary programming , 2018, Appl. Soft Comput..

[16]  Wei Hou,et al.  Evolutionary programming using a mixed mutation strategy , 2007, Inf. Sci..

[17]  Kengo Katayama,et al.  Evolutionary Programming With Only Using Exponential Mutation , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[18]  Yong Wang,et al.  Improved Evolutionary Programming Algorithm and Its Application Research on the Optimization of Ordering Plan , 2009 .

[19]  Liang Shen,et al.  A mixed strategy for Evolutionary Programming based on local fitness landscape , 2010, IEEE Congress on Evolutionary Computation.

[20]  Libin Hong,et al.  A step size based self-adaptive mutation operator for evolutionary programming , 2014, GECCO.

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