Modified Differential Evolution Algorithm for Numerical Optimization Problems

Article Preview

Abstract:

In this paper, a modified differential evolution algorithm (MDE) developed to solve unconstrained numerical optimization problems. The MDE algorithm employed random position updating and disturbance operation to replaces the traditional mutation operation. The former can rapidly enhance the convergence of the MDE, and the latter can prevent the MDE from being trapped into the local optimum effectively. Besides, we dynamic adjust the crossover rate (CR), which is aimed at further improving algorithm performance. Based on several benchmark experiment simulations, the MDE has demonstrated stronger convergence and stability than original differential (DE) algorithm and its two improved algorithms (JADE and SaDE) that reported in recent literature.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

2536-2539

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Jingqiao Zhang, Arthur C. JADE: adaptive differential evolution with optional external archive. IEEE Transaction on Evolution Computation, 2009, 13(5): 945-958.

DOI: 10.1109/tevc.2009.2014613

Google Scholar

[2] Quan-Ke Pan, Ling Wang, Bin Qian. A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Computers & Operations Research, 2009, 36(8): 2498-2511.

DOI: 10.1016/j.cor.2008.10.008

Google Scholar

[3] Liao T W. Two hybrid differential evolution algorithms for engineering design optimization. Applied Soft Computing, 2010, 10(4): 1188-1199.

DOI: 10.1016/j.asoc.2010.05.007

Google Scholar

[4] Varadarajan M, Swarup K S. Differential evolution approach for optimal reactive power dispatch. Applied Soft Computing, 2008, 8(4): 1549-1561.

DOI: 10.1016/j.asoc.2007.12.002

Google Scholar

[5] D. Zaharie, R. Matousek and P. Osmera. Control of population diversity and adaptation in differential evolution algorithms [C]. In Proc: Mendel 9th International Conference Soft Computer, Eds. Brno, Czech Republic, 2003(1): 41–46.

Google Scholar

[6] S. Das,A. Konar, U.K. Chakraborty. Two improved differential evolution schemes for faster global search [C]. In ACM-SIGEVO Proc. Genetic Evolut. Comput. Conf, Washington, DC, pp: 991–998.

DOI: 10.1145/1068009.1068177

Google Scholar

[7] A.K. Qin and P.N. Suganthan. Self-adaptive differential evolution algorithm for numerical optimization [C]. In Proc. The 2005 IEEE Congress on Evolutionary computation, 2005(2): 1785–1791.

DOI: 10.1109/cec.2005.1554904

Google Scholar