An Improved DE Algorithm Based on the New Crossover Strategy

Article Preview

Abstract:

Differential Evolution Algorithm (DE) is fast and stable, but it’s easy to fall into the local optimal solution and the population diversity reduces fast in the later period. In order to improve the algorithm optimization and convergence capability, this paper proposes an improved DE algorithm based on the new crossover strategy (CMDE). As to the Crossover-factor is decided by the proportion of the variance and the evolution process in each generation, so it can follow the process of evolution and constantly change; the added operation of Second Mutation can improve the capacity of solving problem, which algorithm falls into the local solution easily. With four standard test functions, the results show that the CMDE algorithm is superior to DE in convergence speed, precise and stability of algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1583-1588

Citation:

Online since:

January 2015

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Storn R, Price K. Differential Evolution-A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces [J]. Journal of Global Optimization, 1997, 11(4): 341-359.

Google Scholar

[2] Storn R, Price K. Differential Evolution-A Simple and Deficient Adaptive Scheme for Global Optimization over Continuous Spaces Technical Report [J]. TR-95-012. Berkeley, USA: University of California. International Computer Science Institute, (1995).

Google Scholar

[3] Liu Mingguang. Differential Evolution Algorithm and Modification [J]. Systems Engineering, 2005, 23(2): 108-111.

Google Scholar

[4] Liu Bo, Wang Ling, Jin Yihui. Research progress of differential evolution algorithm [J]. Control and Decision, 2007, 22(7): 722-755.

Google Scholar

[5] Chiou J P, Chang C F, Su C T. Ant direction hybrid differential evolution for solving large capacitor placement problems [J]. IEEE Trans on Power Systems, 2004, 19(4): 1794-1800.

DOI: 10.1109/tpwrs.2004.835651

Google Scholar

[6] Lin Y C, Hwang K S, Wang F S. A mixed-coding scheme of evolutionary algorithm to solve mixed-integer nonlinear programming problems [J]. Computers & Mathematics with Applications, 2004, 47(8/9): 1295-1307.

DOI: 10.1016/s0898-1221(04)90123-x

Google Scholar

[7] Cheng S L, Hwang C. Optimal approximation of linear systems by a differential evolution algorithm [J]. IEEE Trans on Systems, Man and Cybernetics: A, 2001, 31(6): 698-707.

DOI: 10.1109/3468.983425

Google Scholar

[8] Zhou Yanping, Gu Xingsheng. Research progress of differential evolution algorithm [J].  Chemical Antromation and Instrument, 2007, 34(3): 1-5.

Google Scholar

[9] Stron R, Price K. Differential Evolution Simple and Efficient Heuristic for Global Optimization over Continuous Spaces [J]. Journal of Global Optimization, 1997, 11(4): 341-359.

Google Scholar

[10] Yang Qiwen, Cai Liang, Xue Yuncan. The summary of Differential evolution algorithm[J]. Pattern Recognition and Artificial Intelligence, 2008, 21(4): 506-514.

DOI: 10.1109/grc.2008.4664643

Google Scholar