• 首页
  • 期刊简介
  • 编委会
  • 投稿指南
  • 收录情况
  • 杂志订阅
  • 联系我们
引用本文:余贤星.一种改进的多领导鲸鱼优化算法[J].软件工程,2022,25(11):28-33.【点击复制】
【打印本页】   【下载PDF全文】   【查看/发表评论】  【下载PDF阅读器】  
←前一篇|后一篇→ 过刊浏览
分享到: 微信 更多
一种改进的多领导鲸鱼优化算法
余贤星
(上海理工大学机械工程学院,上海 200093)
yvxianxing@163.com
摘 要: 针对鲸鱼优化算法(WOA)收敛速度慢、收敛精度低、搜索能力不足的缺点,提出了一种改进的多领导鲸鱼优化算法(IWOA)。该算法引入了多领导机制,有利于提高种群的多样性,防止陷入局部最优。引入莱维飞行机制,将最优个体进行随机扰动,加快收敛速度,防止陷入局部最优。通过CEC2014中的六个标准函数进行测试,给出了运行30次的平均值和标准方差,并与当前最先进的其他算法进行比较。收敛图表明了该算法收敛速度快、收敛精度高;箱线图表明了该算法的稳定性。最后用该算法解决三个经典的工程优化问题,该算法相较于其他算法均取得了最小值,表明了该算法具有优秀的搜索能力与开发能力。
关键词: 鲸鱼优化算法;多领导;莱维飞行;标准函数;工程优化问题
中图分类号: TP312    文献标识码: A
An Improved Multi-leader Whale Optimization Algorithm
YU Xianxing
(School of Mechanical Engineering, University of Shanghai for Science and Technology, Shanghai 200093, China )
yvxianxing@163.com
Abstract: Aiming at the shortcomings of whale optimization algorithm (WOA), such as slow convergence speed, low convergence accuracy and insufficient search ability, this paper proposes an improved multi-leader whale optimization algorithm (IWOA). The algorithm introduces a multi-leader mechanism, which is conducive to improving the diversity of the population and preventing it from falling into the local optimum. The Levy flight mechanism is introduced to randomly perturb the optimal individual to accelerate the convergence speed and prevent it from falling into the local optimum. The algorithm is tested by six benchmark functions of CEC2014, and the average value and standard deviation of 30 runs are given. Compared with other state-of-the-art algorithms, the convergence graphs show the fast convergence speed and high convergence accuracy of the proposed algorithm, and the boxplots show its stability. Finally, the algorithm is used to solve three classical engineering optimization problems. Compared with other algorithms, the proposed algorithm achieves the minimum value, which shows its excellent search and development ability.
Keywords: whale optimization algorithm; multi-leader; Levy flight; standard function; engineering optimization problem


版权所有:软件工程杂志社
地址:辽宁省沈阳市浑南区新秀街2号 邮政编码:110179
电话:0411-84767887 传真:0411-84835089 Email:semagazine@neusoft.edu.cn
备案号:辽ICP备17007376号-1
技术支持:北京勤云科技发展有限公司

用微信扫一扫

用微信扫一扫