An empirical study on Differential Evolution algorithm and its several variants

Differential Evolution (DE) is a simple and efficient global optimization algorithm. However, DE has indicated its weaknesses, such as the convergence rate. This fact has inspired many computer scientists to improve upon DE by proposing modifications to the original algorithm. This paper presents a survey on DE and its several variants. In this paper, we design two sets of function optimization experiments. One is about the five different mutation strategy of the Conventional Differential Evolution (CDE), and the other is the comparison several variants of Differential Evolution algorithm with a new improved DE algorithm (GPBXDE). To evaluate the performance of the algorithm, we selected twelve widely used benchmark functions. The results of the experiment prove that the strategy CDE/rand/1/bin and CDE/rand-to-best/1/bin are better and the GPBXDE algorithm performs outstanding.

[1]  Arthur C. Sanderson,et al.  JADE: Adaptive Differential Evolution With Optional External Archive , 2009, IEEE Transactions on Evolutionary Computation.

[2]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[3]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[4]  Wenyin Gong,et al.  ODE: A Fast and Robust Differential Evolution Based on Orthogonal Design , 2006, Australian Conference on Artificial Intelligence.

[5]  Álvaro Fialho,et al.  Adaptive strategy selection in differential evolution , 2010, GECCO '10.

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

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  Pascal Bouvry,et al.  Improving Classical and Decentralized Differential Evolution With New Mutation Operator and Population Topologies , 2011, IEEE Transactions on Evolutionary Computation.

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

[10]  Francisco Herrera,et al.  Real-Coded Memetic Algorithms with Crossover Hill-Climbing , 2004, Evolutionary Computation.

[11]  P. N. Suganthan,et al.  Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[12]  Zelda B. Zabinsky,et al.  A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems , 2005, J. Glob. Optim..

[13]  Wenyin Gong,et al.  Enhancing the performance of differential evolution using orthogonal design method , 2008, Appl. Math. Comput..

[14]  Ville Tirronen,et al.  Recent advances in differential evolution: a survey and experimental analysis , 2010, Artificial Intelligence Review.

[15]  Janez Brest,et al.  Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems , 2006, IEEE Transactions on Evolutionary Computation.

[16]  Jouni Lampinen,et al.  A Trigonometric Mutation Operation to Differential Evolution , 2003, J. Glob. Optim..