基于动态分组的多策略引力搜索算法  

Multi-strategy gravitational search algorithm based on dynamic grouping

作　　者：张强[1] 王梅[1] ZHANG Qiang;WANG Mei(School of Computer and Information Technology,Northeast Petroleum University,Daqing Heilongjiang 163318,China)

机构地区：[1]东北石油大学计算机与信息技术学院,黑龙江大庆163318

出　　处：《华东师范大学学报（自然科学版）》2019年第1期66-75,共10页Journal of East China Normal University(Natural Science)

基　　金：国家自然科学基金(61702093);黑龙江省自然科学基金(F2015020)

摘　　要：给出了一种基于动态分组的多策略引力搜索算法.算法迭代初期利用自适应分组策略对种群进行分组寻优,每个分组内只更新最差个体,采用云模型理论来改进最优个体的进化行为;迭代后期将种群分为优势子群和拓展子群,采用差分变异算子更新优势子群提高寻优精度和速度,利用Tent混沌理论进化拓展子群完成个体变异.典型复杂函数测试表明,该算法具有很好的收敛精度和计算速度.A multi-strategy gravitational search algorithm based on dynamic grouping is proposed in this paper.At the initial stage of the algorithm iteration,adaptive grouping strategies are used to optimize populations.Only the least-optimal individuals are updated in each group.The cloud model theory is used to improve the evolutionary behavior of the optimal individuals.In the later part of the algorithm iteration,the populations are divided into dominant and extension subgroups.The differential mutation operator is subsequently used to update the dominant subgroups to improve the precision and speed of the optimization.Tent chaos theory is used to update the extension subgroups to complete the individual variation.Typical complex function tests show that the algorithm has good convergence accuracy and computational speed.

关 键 词：引力搜索算法 云模型 佳点集 混沌 连续空间优化 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]