基于融合策略的改进型北苍鹰优化算法及应用研究

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Xu Yong, Sang Bicong, Zhang Yi
{"title":"基于融合策略的改进型北苍鹰优化算法及应用研究","authors":"Xu Yong,&nbsp;Sang Bicong,&nbsp;Zhang Yi","doi":"10.1002/cpe.70136","DOIUrl":null,"url":null,"abstract":"<p>Northern Goshawk Optimization Algorithm (NGO), as a new swarm intelligence optimization algorithm, shows certain potential in solving complex optimization problems because of its unique search mechanism. However, the algorithm still faces some challenges in practical application, such as slow convergence speed, insufficient optimization precision, and easy to fall into local optimality. These problems limit its application range and efficiency in complex multimodal optimization problems. To overcome the above shortcomings, this paper proposes an improved Northern Goshawk optimization algorithm (WNGO) based on a fusion strategy. The fusion strategy is a novel approach that combines the strengths of different optimization algorithms to address the problems of slow convergence speed, accuracy of optimization, and easy falling into local optimal. First, the Piecewise chaotic mapping is used to initialize the Northern Goshawk population, which enhances the global search capability of the algorithm by providing a wider search space in the initial stage. Second, in order to achieve the adequacy of the solution space search and the performance of the optimization problem in the prey recognition stage of the Northern Goshawk, the location update formula of the prey recognition stage of the Northern Goshawk is replaced by the location update formula of the Walrus optimization algorithm in the exploration stage. Then, through the mirror reverse learning strategy, the reverse solution generated by the lens imaging principle can provide a new search direction when the Northern Goshawk optimization algorithm falls into the local optimal, increase the probability of finding the global optimal solution, and improve the global optimization ability, so that it can jump out of the local optimal in the later iteration. Finally, the adaptive T-distribution variation strategy is used to enhance the local exploration ability in the late iteration, thus improving the convergence speed of the Northern Goshawk optimization algorithm. This paper evaluates the performance of the improved WNGO algorithm. By comparing the CEC2021 test function and other advanced improved swarm intelligence methods, it is proved that the improved algorithm has better accuracy, robustness, and convergence speed. It is tested in two engineering design problems. The results show that the WNGO algorithm can break through the local optimal solution, obtain higher precision, and have a stronger global searching ability than other algorithms.</p>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 21-22","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.70136","citationCount":"0","resultStr":"{\"title\":\"Research on Optimization Algorithm and Application of Improved Northern Goshawk Based on Fusion Strategy\",\"authors\":\"Xu Yong,&nbsp;Sang Bicong,&nbsp;Zhang Yi\",\"doi\":\"10.1002/cpe.70136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Northern Goshawk Optimization Algorithm (NGO), as a new swarm intelligence optimization algorithm, shows certain potential in solving complex optimization problems because of its unique search mechanism. However, the algorithm still faces some challenges in practical application, such as slow convergence speed, insufficient optimization precision, and easy to fall into local optimality. These problems limit its application range and efficiency in complex multimodal optimization problems. To overcome the above shortcomings, this paper proposes an improved Northern Goshawk optimization algorithm (WNGO) based on a fusion strategy. The fusion strategy is a novel approach that combines the strengths of different optimization algorithms to address the problems of slow convergence speed, accuracy of optimization, and easy falling into local optimal. First, the Piecewise chaotic mapping is used to initialize the Northern Goshawk population, which enhances the global search capability of the algorithm by providing a wider search space in the initial stage. Second, in order to achieve the adequacy of the solution space search and the performance of the optimization problem in the prey recognition stage of the Northern Goshawk, the location update formula of the prey recognition stage of the Northern Goshawk is replaced by the location update formula of the Walrus optimization algorithm in the exploration stage. Then, through the mirror reverse learning strategy, the reverse solution generated by the lens imaging principle can provide a new search direction when the Northern Goshawk optimization algorithm falls into the local optimal, increase the probability of finding the global optimal solution, and improve the global optimization ability, so that it can jump out of the local optimal in the later iteration. Finally, the adaptive T-distribution variation strategy is used to enhance the local exploration ability in the late iteration, thus improving the convergence speed of the Northern Goshawk optimization algorithm. This paper evaluates the performance of the improved WNGO algorithm. By comparing the CEC2021 test function and other advanced improved swarm intelligence methods, it is proved that the improved algorithm has better accuracy, robustness, and convergence speed. It is tested in two engineering design problems. The results show that the WNGO algorithm can break through the local optimal solution, obtain higher precision, and have a stronger global searching ability than other algorithms.</p>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"37 21-22\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2025-08-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.70136\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70136\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70136","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

北方苍鹰优化算法(NGO)作为一种新型的群体智能优化算法,由于其独特的搜索机制,在解决复杂优化问题方面显示出一定的潜力。然而,该算法在实际应用中仍存在收敛速度慢、优化精度不够、容易陷入局部最优等问题。这些问题限制了其在复杂多模态优化问题中的应用范围和效率。为了克服上述缺点,本文提出了一种基于融合策略的改进北苍鹰优化算法。融合策略是一种新颖的方法,它结合了不同优化算法的优点,解决了收敛速度慢、优化精度高、易陷入局部最优等问题。首先,采用分段混沌映射对北苍鹰种群进行初始化,在初始阶段提供了更大的搜索空间,增强了算法的全局搜索能力;其次,为了实现北苍鹰猎物识别阶段解空间搜索的充分性和优化问题的性能,将北苍鹰猎物识别阶段的位置更新公式替换为海象优化算法在探索阶段的位置更新公式。然后,通过镜像逆向学习策略,利用透镜成像原理生成的逆向解可以在北苍鹰优化算法陷入局部最优时提供新的搜索方向,增加找到全局最优解的概率,提高全局优化能力,使其在后续迭代中跳出局部最优。最后,采用自适应t分布变化策略增强后期迭代的局部探索能力,从而提高了北苍鹰优化算法的收敛速度。本文对改进后的WNGO算法的性能进行了评价。通过将CEC2021测试函数与其他先进的改进群体智能方法进行比较,证明改进算法具有更好的准确性、鲁棒性和收敛速度。在两个工程设计问题中进行了验证。结果表明,WNGO算法可以突破局部最优解,获得更高的精度,并且比其他算法具有更强的全局搜索能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Research on Optimization Algorithm and Application of Improved Northern Goshawk Based on Fusion Strategy

Research on Optimization Algorithm and Application of Improved Northern Goshawk Based on Fusion Strategy

Northern Goshawk Optimization Algorithm (NGO), as a new swarm intelligence optimization algorithm, shows certain potential in solving complex optimization problems because of its unique search mechanism. However, the algorithm still faces some challenges in practical application, such as slow convergence speed, insufficient optimization precision, and easy to fall into local optimality. These problems limit its application range and efficiency in complex multimodal optimization problems. To overcome the above shortcomings, this paper proposes an improved Northern Goshawk optimization algorithm (WNGO) based on a fusion strategy. The fusion strategy is a novel approach that combines the strengths of different optimization algorithms to address the problems of slow convergence speed, accuracy of optimization, and easy falling into local optimal. First, the Piecewise chaotic mapping is used to initialize the Northern Goshawk population, which enhances the global search capability of the algorithm by providing a wider search space in the initial stage. Second, in order to achieve the adequacy of the solution space search and the performance of the optimization problem in the prey recognition stage of the Northern Goshawk, the location update formula of the prey recognition stage of the Northern Goshawk is replaced by the location update formula of the Walrus optimization algorithm in the exploration stage. Then, through the mirror reverse learning strategy, the reverse solution generated by the lens imaging principle can provide a new search direction when the Northern Goshawk optimization algorithm falls into the local optimal, increase the probability of finding the global optimal solution, and improve the global optimization ability, so that it can jump out of the local optimal in the later iteration. Finally, the adaptive T-distribution variation strategy is used to enhance the local exploration ability in the late iteration, thus improving the convergence speed of the Northern Goshawk optimization algorithm. This paper evaluates the performance of the improved WNGO algorithm. By comparing the CEC2021 test function and other advanced improved swarm intelligence methods, it is proved that the improved algorithm has better accuracy, robustness, and convergence speed. It is tested in two engineering design problems. The results show that the WNGO algorithm can break through the local optimal solution, obtain higher precision, and have a stronger global searching ability than other algorithms.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信