Improved multi-strategy adaptive Grey Wolf Optimization for practical engineering applications and high-dimensional problem solving

IF 10.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Mingyang Yu, Jing Xu, Weiyun Liang, Yu Qiu, Sixu Bao, Lin Tang
{"title":"Improved multi-strategy adaptive Grey Wolf Optimization for practical engineering applications and high-dimensional problem solving","authors":"Mingyang Yu,&nbsp;Jing Xu,&nbsp;Weiyun Liang,&nbsp;Yu Qiu,&nbsp;Sixu Bao,&nbsp;Lin Tang","doi":"10.1007/s10462-024-10821-3","DOIUrl":null,"url":null,"abstract":"<div><p>The Grey Wolf Optimization (GWO) is a highly effective meta-heuristic algorithm leveraging swarm intelligence to tackle real-world optimization problems. However, when confronted with large-scale problems, GWO encounters hurdles in convergence speed and problem-solving capabilities. To address this, we propose an Improved Adaptive Grey Wolf Optimization (IAGWO), which significantly enhances exploration of the search space through refined search mechanisms and adaptive strategy. Primarily, we introduce the incorporation of velocity and the Inverse Multiquadratic Function (IMF) into the search mechanism. This integration not only accelerates convergence speed but also maintains accuracy. Secondly, we implement an adaptive strategy for population updates, enhancing the algorithm's search and optimization capabilities dynamically. The efficacy of our proposed IAGWO is demonstrated through comparative experiments conducted on benchmark test sets, including CEC 2017, CEC 2020, CEC 2022, and CEC 2013 large-scale global optimization suites. At CEC2017, CEC 2020 (10/20 dimensions), CEC 2022 (10/20 dimensions), and CEC 2013, respectively, it outperformed other comparative algorithms by 88.2%, 91.5%, 85.4%, 96.2%, 97.4%, and 97.2%. Results affirm that our algorithm surpasses state-of-the-art approaches in addressing large-scale problems. Moreover, we showcase the broad application potential of the algorithm by successfully solving 19 real-world engineering challenges.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"57 10","pages":""},"PeriodicalIF":10.7000,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-024-10821-3.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-024-10821-3","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The Grey Wolf Optimization (GWO) is a highly effective meta-heuristic algorithm leveraging swarm intelligence to tackle real-world optimization problems. However, when confronted with large-scale problems, GWO encounters hurdles in convergence speed and problem-solving capabilities. To address this, we propose an Improved Adaptive Grey Wolf Optimization (IAGWO), which significantly enhances exploration of the search space through refined search mechanisms and adaptive strategy. Primarily, we introduce the incorporation of velocity and the Inverse Multiquadratic Function (IMF) into the search mechanism. This integration not only accelerates convergence speed but also maintains accuracy. Secondly, we implement an adaptive strategy for population updates, enhancing the algorithm's search and optimization capabilities dynamically. The efficacy of our proposed IAGWO is demonstrated through comparative experiments conducted on benchmark test sets, including CEC 2017, CEC 2020, CEC 2022, and CEC 2013 large-scale global optimization suites. At CEC2017, CEC 2020 (10/20 dimensions), CEC 2022 (10/20 dimensions), and CEC 2013, respectively, it outperformed other comparative algorithms by 88.2%, 91.5%, 85.4%, 96.2%, 97.4%, and 97.2%. Results affirm that our algorithm surpasses state-of-the-art approaches in addressing large-scale problems. Moreover, we showcase the broad application potential of the algorithm by successfully solving 19 real-world engineering challenges.

Abstract Image

用于实际工程应用和高维问题解决的改进型多策略自适应灰狼优化法
灰狼优化(GWO)是一种高效的元启发式算法,它利用蜂群智能来解决现实世界中的优化问题。然而,在面对大规模问题时,GWO 在收敛速度和解决问题的能力方面遇到了障碍。为了解决这个问题,我们提出了改进的自适应灰狼优化(IAGWO),它通过完善的搜索机制和自适应策略大大提高了对搜索空间的探索能力。首先,我们在搜索机制中引入了速度和反二次函数(IMF)。这种整合不仅加快了收敛速度,而且保持了精度。其次,我们实施了种群更新的自适应策略,动态增强了算法的搜索和优化能力。通过在 CEC 2017、CEC 2020、CEC 2022 和 CEC 2013 大型全局优化套件等基准测试集上进行对比实验,证明了我们提出的 IAGWO 的功效。在 CEC2017、CEC 2020(10/20 维)、CEC 2022(10/20 维)和 CEC 2013 中,该算法分别以 88.2%、91.5%、85.4%、96.2%、97.4% 和 97.2% 的成绩优于其他比较算法。结果证明,我们的算法在解决大规模问题方面超越了最先进的方法。此外,我们还通过成功解决 19 个现实世界的工程挑战,展示了该算法的广泛应用潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Artificial Intelligence Review
Artificial Intelligence Review 工程技术-计算机:人工智能
CiteScore
22.00
自引率
3.30%
发文量
194
审稿时长
5.3 months
期刊介绍: Artificial Intelligence Review, a fully open access journal, publishes cutting-edge research in artificial intelligence and cognitive science. It features critical evaluations of applications, techniques, and algorithms, providing a platform for both researchers and application developers. The journal includes refereed survey and tutorial articles, along with reviews and commentary on significant developments in the field.
×
引用
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学术官方微信