期刊文献+

融合黄金正弦混合变异的自适应樽海鞘群算法 被引量:19

Adaptive Salp Swarm Algorithm with Golden Sine Algorithm and Hybrid Mutation
在线阅读 下载PDF
导出
摘要 针对基本樽海鞘群算法收敛速度慢、收敛精度低、易陷入局部最优的缺点,提出了一种融合黄金正弦混合变异的自适应樽海鞘群算法AGHSSA(Adaptive Salp Swarm Algorithm with Golden Sine Algorithm and Hybrid Mutation)。该算法引入了自适应变化的权重因子以加强精英个体的引导作用,提升收敛速度与精度。通过黄金正弦算法优化领导者位置更新方式,增强算法的全局搜索和局部开发能力。融合邻域重心反向学习与柯西变异对最优个体位置进行扰动,提升算法跳出局部最优的能力。通过对12个基准测试函数进行仿真实验来评估改进算法的寻优能力,实验结果表明,改进算法能显著提升寻优速度和精度,并且具备较强的跳出局部最优的能力。 In order to solve the problems of slow convergence speed,low accuracy and easy to fall into local optimum solu-tion of the standard salp swarm algorithm,an adaptive salp swarm algorithm based on golden sine algorithm and hybrid mutation is proposed.The adaptive weight factor is introduced to strengthen the leading role of elite individuals and improve the convergence speed and accuracy of the basic salp swarm algorithm.The golden sine algorithm is used to optimize the position update mode of the leader and improve the global exploration and local exploitation capacity of the algorithm.The hybrid neighborhood centroid opposition-based learning with cauchy mutation strategy is introduced to disturb the best individual’s position and improve the ability of the algorithm to jump out of local optimum.The optimization perfor-mance of the proposed algorithm is evaluated by a sets of simulation experiments on 12 benchmark functions,the experi-mental results show that the proposed algorithm can significantly improve the optimum speed and accuracy,besides,it has a strong ability to jump out of local optimum.
作者 周新 邹海 ZHOU Xin;ZOU Hai(School of Computer Science and Technology,Anhui University,Hefei 230601,China)
出处 《计算机工程与应用》 CSCD 北大核心 2021年第12期75-85,共11页 Computer Engineering and Applications
基金 国家自然科学基金(61374128)。
关键词 樽海鞘群算法 自适应权重 黄金正弦算法 混合变异 salp swarm algorithm adaptive weight golden sine algorithm hybrid mutation
  • 相关文献

参考文献11

二级参考文献95

  • 1单梁,强浩,李军,王执铨.基于Tent映射的混沌优化算法[J].控制与决策,2005,20(2):179-182. 被引量:226
  • 2陈贵敏,贾建援,韩琪.粒子群优化算法的惯性权值递减策略研究[J].西安交通大学学报,2006,40(1):53-56. 被引量:317
  • 3张建科,刘三阳,张晓清.改进的粒子群算法[J].计算机工程与设计,2007,28(17):4215-4216. 被引量:34
  • 4KENNEDY J, EBERHART R C. Particle swarmoptimization[C]//Proceedings of IEEE InternationalConference on Neural Networks. [S.l.]. IEEE, 1995:1942-1948.
  • 5SHI Y H, EBERHART R C. A modified particle swarmoptimizer[C]//Proceedings of IEEE Congress onEvolutionary Computation(CEC 1998). Piscataway: IEEE,1998: 69-73.
  • 6SHI Y H, EBERHART R C. Parameter selection in particleswarm optimization[C]//7th International Conference,Evolutionary Programming VII. Berlin Heidelberg: Springer,1998,1447: 591-600.
  • 7LIU Y,ZHENG Q, ZHEWEN S, et al. Center particle swarmoptimization [J]. Neurocomputing, 2007, 70(4): 672-679.
  • 8TSAI Hsing-chih, TYAN Yaw-yauan, WU Yun-wu, et al.Gravitational particle swarm[J], Applied Mathematics andComputation, 2013,219(17): 9106-9117.
  • 9WORASUCHEEP C. A particle swarm optimization withstagnation detection and dispersion[C]//IEEE Congress onEvolutionary Computation. [S.l.]. IEEE, 2008: 424-429.
  • 10ZHOU L, SHI Y, LI Y, et al. Parameter selection, analysisand evaluation of an improved particle swarm optimizerwith leadership[J]. Artificial Intelligence Review, 2010,34(4): 343-367.

共引文献332

同被引文献173

引证文献19

二级引证文献110

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部