A hybrid northern goshawk optimization algorithm based on cluster collaboration

Changjun Wu, Qingzhen Li, Qiaohua Wang, Huanlong Zhang, Xiaohui Song
{"title":"A hybrid northern goshawk optimization algorithm based on cluster collaboration","authors":"Changjun Wu, Qingzhen Li, Qiaohua Wang, Huanlong Zhang, Xiaohui Song","doi":"10.1007/s10586-024-04571-8","DOIUrl":null,"url":null,"abstract":"<p>To address the problems that the northern goshawk optimization algorithm (NGO) has a slow convergence speed and is highly susceptible to fall into local optimal solutions, this paper proposes a hybrid northern goshawk optimization algorithm based on cluster collaboration (HHNGO), which effectively improves the convergence speed and alleviates the problem of falling into the local optimum. Firstly, piecewise chaotic mapping is used to initialize the population, which makes the initial population more evenly distributed in the search space and improves the quality of the initial solution. Secondly, the prey recognition position update formula in the harris hawk optimization algorithm is introduced to improve the exploration phase. Meanwhile, a nonlinear factor can be added to accelerate the process which reaches the minimum difference between the prey best position and the average position of the eagle group. Thus the iteration number is reduced during the search process, and the convergence speed of the algorithm is improved. Finally, the Cauchy variation strategy is used to perturb the optimal solution of the algorithm. Then, its probability jumping out of the local optimal solution is increased, and the global search capability is enhanced. The experimental comparison is carried out to analyze the 12 standard functions, CEC-2019 and CEC-2021 test functions in HHNGO and PSO, GWO, POA, HHO, NGO, INGO, DFPSO, MGLMRFO, GMPBSA algorithms, and HHNGO is applied in PID parameter rectification. The results prove the feasibility and superiority of the proposed method.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":"26 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s10586-024-04571-8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To address the problems that the northern goshawk optimization algorithm (NGO) has a slow convergence speed and is highly susceptible to fall into local optimal solutions, this paper proposes a hybrid northern goshawk optimization algorithm based on cluster collaboration (HHNGO), which effectively improves the convergence speed and alleviates the problem of falling into the local optimum. Firstly, piecewise chaotic mapping is used to initialize the population, which makes the initial population more evenly distributed in the search space and improves the quality of the initial solution. Secondly, the prey recognition position update formula in the harris hawk optimization algorithm is introduced to improve the exploration phase. Meanwhile, a nonlinear factor can be added to accelerate the process which reaches the minimum difference between the prey best position and the average position of the eagle group. Thus the iteration number is reduced during the search process, and the convergence speed of the algorithm is improved. Finally, the Cauchy variation strategy is used to perturb the optimal solution of the algorithm. Then, its probability jumping out of the local optimal solution is increased, and the global search capability is enhanced. The experimental comparison is carried out to analyze the 12 standard functions, CEC-2019 and CEC-2021 test functions in HHNGO and PSO, GWO, POA, HHO, NGO, INGO, DFPSO, MGLMRFO, GMPBSA algorithms, and HHNGO is applied in PID parameter rectification. The results prove the feasibility and superiority of the proposed method.

Abstract Image

基于集群协作的混合北方大鹰优化算法
针对北方大鹰优化算法(NGO)收敛速度慢、极易陷入局部最优解的问题,本文提出了一种基于集群协作的混合北方大鹰优化算法(HHNGO),有效提高了收敛速度,缓解了陷入局部最优的问题。首先,采用片状混沌映射对种群进行初始化,使初始种群在搜索空间中的分布更加均匀,提高了初始解的质量。其次,引入哈里斯鹰优化算法中的猎物识别位置更新公式,改善探索阶段。同时,可以加入非线性因子,加速达到猎物最佳位置与鹰群平均位置差值最小的过程。这样就减少了搜索过程中的迭代次数,提高了算法的收敛速度。最后,利用 Cauchy 变异策略对算法的最优解进行扰动。然后,提高其跳出局部最优解的概率,增强全局搜索能力。实验对比分析了 HHNGO 与 PSO、GWO、POA、HHO、NGO、INGO、DFPSO、MGLMRFO、GMPBSA 算法中的 12 个标准函数、CEC-2019 和 CEC-2021 测试函数,并将 HHNGO 应用于 PID 参数整定。结果证明了所提方法的可行性和优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信