运筹学

改进种群多样性的双变异差分进化算法

展开
  • 1. 南京工业大学计算机科学与技术学院, 南京 211816 

收稿日期: 2016-02-01

  网络出版日期: 2017-03-15

基金资助

江苏省高校自然科学基金(No. 12KJB510007)

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

摘要

差分进化算法(DE) 是一种基于种群的启发式随机搜索技术, 对于解决连续性优化问题具有较强的鲁棒性. 然而传统差分进化算法存在种群多样性和收敛速度之间的矛盾, 一种改进种群多样性的双变异差分进化算法(DADE), 通过引入BFS-best 机制(基于排序的可行解选取递减策略)改进变异算子 ``DE/current-to-best'', 将其与 DE/rand/1 构成双变异策略来改善DE算法中种群多样性减少的问题. 同时, 每个个体的控制参数基于排序自适应更新. 最后, 利用多个 CEC 2013 标准测试函数对改进算法进行测试, 实验结果表明, 改进后的算法能有效改善种群多样性, 较好地提高了算法的全局收敛能力和收敛速度.

本文引用格式

李荣雨, 陈庆倩, 陈菲尔 . 改进种群多样性的双变异差分进化算法[J]. 运筹学学报, 2017 , 21(1) : 44 -54 . DOI: 10.15960/j.cnki.issn.1007-6093.2017.01.005

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.

参考文献

[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.
文章导航

/