基于最优高斯随机游走和个体筛选策略的差分进化算法  

Differential evolution based on optimal Gaussian random walk and individual selection strategies

作　　者：李牧东[1] 赵辉[1] 翁兴伟[1] 韩统[1] 

机构地区：[1]空军工程大学航空航天工程学院,西安710038

出　　处：《控制与决策》2016年第8期1379-1386,共8页Control and Decision

基　　金：航空科学基金项目(20105196016);中国博士后科学基金项目(2012M521807)

摘　　要：针对差分进化算法开发能力较差的问题,提出一种具有快速收敛的新型差分进化算法.首先,利用最优高斯随机游走策略提高算法的开发能力;然后,采用基于个体优化性能的简化交叉变异策略实现种群的进化操作以加强其局部搜索能力;最后,通过个体筛选策略进一步提高算法的探索能力以避免陷入局部最优.12个标准测试函数和两种带约束的工程优化问题的实验结果表明,所提出的算法在收敛速度、算法可靠性及收敛精度方面均优于EPSDE、Sa DE、JADE、BSA、Co Bi DE、GSA和ABC等算法,在加强算法探索能力的同时能够有效地提高算法的开发能力.To solve the problems of poor performance in exploitation of the differential evolution（DE） algorithm, a new DE algorithm with fast convergence rate is proposed. Firstly, the optimal Gaussian random walk strategy is used to improve the exploitation ability of the algorithm. Then, the simplified crossover and mutation strategy based on the individuals＇ optimization performance is employed to realize the evolution operation so as to improve the performance of local search. Finally, the individual selection strategy is proposed to avoid local optimum and enhance the exploration performance. Experimental results of 12 unconstrained benchmark functions and two constrained engineering design optimization problems show that the proposed algorithm is superior to the algorithm of EPSDE, Sa DE, JADE, BSA, Co Bi DE,GSA and ABC in terms of convergence rate, stability and convergence accuracy. The proposed algorithm can effectively enhance the exploration performance and improve the exploitation ability.

关 键 词：差分进化 无约束优化 约束优化 高斯随机游走 个体筛选 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]