基于反向学习的自适应差分进化算法  

Self-adaptive differential evolution algorithm based on opposition-based learning

作　　者：李龙澍[1] 翁晴晴 

机构地区：[1]安徽大学计算机科学与技术学院,合肥230601

出　　处：《计算机应用》2018年第2期399-404,共6页journal of Computer Applications

基　　金：国家自然科学基金资助项目(61402005)~~

摘　　要：为解决差分进化(DE)算法过早收敛与搜索能力低的问题,讨论对控制参数的动态调整,提出一种基于反向学习的自适应差分进化算法。该算法通过反向精英学习机制来增强种群的局部搜索能力,获取精确度更高的最优个体;同时,采用高斯分布随机性提高单个个体的开发能力,通过扩充种群的多样性,避免算法过早收敛,整体上平衡全局搜索与局部寻优的能力。采用CEC 2014中的6个测试函数进行仿真实验,并与其他差分进化算法进行对比,实验结果表明所提算法在收敛速度、收敛精度及可靠性上表现更优。Concerning premature convergence and low searching capability of Differential Evolutionary( DE) algorithm,the dynamic adjustment of control parameters was dicussed, and a self-adaptive differential evolution algorithm based on opposition-based learning was proposed. In the proposed algorithm, opposition-based elite learning was used to enhance the local search ability of the population and obtain more accurate optimal individuals; meanwhile, Gaussian distribution was used to improve the exploitation ability of each individual and increase the diversity of the population, which avoids premature convergence of the algorithm and achieves the balance of the global exploitation and local exploitation. Comparison experiments with some other differential evolution algorithms were conducted on six test functions in CEC 2014. The experimental results show that the proposed algorithm outperforms the compared differential evolution algorithms in terms of convergence speed,solution accuracy and reliability.

关 键 词：差分进化 自适应 高斯分布 反向学习 

分 类 号：TP183[自动化与计算机技术—控制理论与控制工程]