中文

Operations Research Transactions >

2017 , Vol. 21 >Issue 1: 44 - 54

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2017.01.005

Differential evolution algorithm with double  mutation strategies for improving population diversity

Expand
  • 1. College of Computer Science and Technology, Nanjing Tech University, Nanjing 211816, China

Received date: 2016-02-01

  Online published: 2017-03-15

Fold

Abstract

Differential Evolution (DE) is an efficient population-based heuristic stochastic search technique. It is robust for solving continuous optimization problems. However, the discrepancy of population diversity and convergence rate exists in traditional Differential Evolution. In this paper, differential evolution algorithm based on double mutation strategies for improving population diversity (DADE}) was proposed. This algorithm presents a BFS-best mechanism to improve ``current-to-best'', which cooperates with DE/rand/1 to ensure population diversity. Meanwhile, the control parameters of individuals are updated automatically based on ranking. Finally, several benchmark functions in CEC2013 are used to test the proposed algorithm. The simulation results show that DADE can effectively improve population diversity, achieve better global searching ability and a higher convergence rate.

Key words： differential evolution; population diversity; double mutation strategy; ranking

Cite this article

LI Rongyu, CHEN Qingqian, CHEN Feier . Differential evolution algorithm with double  mutation strategies for improving population diversity[J]. Operations Research Transactions, 2017 , 21(1) : 44 -54 . DOI: 10.15960/j.cnki.issn.1007-6093.2017.01.005

References

[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.
[2] 刘波, 王凌, 金以慧, 等. 差分进化算法研究进展 [J]. 控制与决策, 2007, 22(7): 721-729．
[3] Das S, Suganthan P N. Differential evolution: a survey of the state-of-the-art [J]. IEEE Transactions on Evolutionary Computation, 2011, 15(1): 4-31.
[4] Qin A K, Huang V L, Suganthan P N. Differential evolution algorithm with strategy adaptation for global numerical optimization [J]. IEEE Transactions on Evolutionary Computation, 2009, 13(2): 398-417.
[5] Kordestani J K, Ahmadi A, Meybodi M R. An improved differential evolution algorithm using learning automata and population topologies [J]. Applied Intelligence, 2014, 41(4): 1150-1169.
[6] Zhang C, Gao L. An effective improvement of JADE for real-parameter optimization [C]//Advanced Computational Intelligence (ICACI), 2013 Sixth International Conference on IEEE, 2013, 58-63.
[7] Gong W, Cai Z. Differential evolution with ranking-based mutation operators [J]. IEEE Transactions on Cybernetics, 2013, 43(6): 2066-2081.
[8] Lu X, Tang K, Sendhoff B, et al. A new self-adaptation scheme for differential evolution [J]. Neurocomputing, 2014, 146: 2-16.
[9] Zhang X, Yuen S. A directional mutation operator for differential algorithms [J]. Applied Soft Computing, 2015, 30(5): 529-548.
[10] Yang M, Li C, Cai Z, et al. Differential evolution with auto-enhanced population diversity [J]. IEEE Transactions on Cybernetics, 2015, 45(2): 302-315.
[11] Xu Y, Fang J, Zhu W, et al. Differential evolution using a superior-inferior crossover scheme [J]. Computational Optimization and Applications, 2015, 61(1): 243-274.
[12] 吴亮红, 王耀南, 袁小芳, 等. 自适应二次变异差分进化算法 [J]. 控制与决策, 2006, 21(8): 898-902.
Options
Outlines

/

〈 〉