A multi-strategy enhanced dung beetle algorithm for solving real-world engineering problems

IF 10.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Zhengxing Mao, Zhen Yang, Dan Luo, Dong Lin, Qinghong Jiang, Guoxian Huang, Zhixian Liao
{"title":"A multi-strategy enhanced dung beetle algorithm for solving real-world engineering problems","authors":"Zhengxing Mao,&nbsp;Zhen Yang,&nbsp;Dan Luo,&nbsp;Dong Lin,&nbsp;Qinghong Jiang,&nbsp;Guoxian Huang,&nbsp;Zhixian Liao","doi":"10.1007/s10462-025-11235-5","DOIUrl":null,"url":null,"abstract":"<div><p>The Dung Beetle optimization (DBO) algorithm is an innovative and effective metaheuristic algorithm widely recognised for its excellent numerical optimization performance. However, DBO converges slowly and tends to fall into local optima due to the imbalance between exploration and exploitation, the lack of collaborative search capability and population diversity. To overcome these challenges, this paper proposes a dung beetle optimization algorithm based on multi-strategy collaborative enhancement (MDBO). The algorithm constructs a “search-enhance-escape” collaborative optimization framework through adaptive regulation and elite information sharing, and contains three major innovations: (1) a dual adaptive search strategy, which combines the adaptive contraction mechanism of the leader’s centre of mass and the brownian bidirectional crossover perturbation strength regulation, to enhance the population diversity and collaborative search ability of the dung beetle, achieving a dynamic balance between exploration and exploitation; (2) Elite Enhanced Solution Quality (EESQ) mechanism, which improves the quality of both the current local and global optimal positions and accelerates convergence through structured elite information and dual-phase adaptive perturbation; and (3) Dynamic Oppositional Learning (DOL), which introduces an asymmetric adaptive perturbation in the dung beetle’s foraging and Breeding phases and enhances the ability to escape from local optima. The three act synergistically to achieve a more efficient optimised search. The performance of MDBO is evaluated using the IEEE CEC 2017, CEC 2019 and CEC 2020 benchmarking functions. Compared to the DBO algorithm, the MDBO algorithm improves the convergence accuracy and stability on the CEC2017 benchmark functions by 60.91 % and 63.98 %, respectively. For the CEC2019 benchmark functions, the corresponding improvements are 54.47 % and 41.36 %, while for the CEC2020 benchmark functions, they are 50.71 % and 55.16 %, respectively. In addition, its overall performance is evaluated against two complex real-world engineering problems: UAV path planning and wireless sensor network coverage optimization. The experimental results show that MDBO provides very competitive optimization results compared to DBO, two highly referenced algorithms and five advanced algorithms.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"58 8","pages":""},"PeriodicalIF":10.7000,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-025-11235-5.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-025-11235-5","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 Dung Beetle optimization (DBO) algorithm is an innovative and effective metaheuristic algorithm widely recognised for its excellent numerical optimization performance. However, DBO converges slowly and tends to fall into local optima due to the imbalance between exploration and exploitation, the lack of collaborative search capability and population diversity. To overcome these challenges, this paper proposes a dung beetle optimization algorithm based on multi-strategy collaborative enhancement (MDBO). The algorithm constructs a “search-enhance-escape” collaborative optimization framework through adaptive regulation and elite information sharing, and contains three major innovations: (1) a dual adaptive search strategy, which combines the adaptive contraction mechanism of the leader’s centre of mass and the brownian bidirectional crossover perturbation strength regulation, to enhance the population diversity and collaborative search ability of the dung beetle, achieving a dynamic balance between exploration and exploitation; (2) Elite Enhanced Solution Quality (EESQ) mechanism, which improves the quality of both the current local and global optimal positions and accelerates convergence through structured elite information and dual-phase adaptive perturbation; and (3) Dynamic Oppositional Learning (DOL), which introduces an asymmetric adaptive perturbation in the dung beetle’s foraging and Breeding phases and enhances the ability to escape from local optima. The three act synergistically to achieve a more efficient optimised search. The performance of MDBO is evaluated using the IEEE CEC 2017, CEC 2019 and CEC 2020 benchmarking functions. Compared to the DBO algorithm, the MDBO algorithm improves the convergence accuracy and stability on the CEC2017 benchmark functions by 60.91 % and 63.98 %, respectively. For the CEC2019 benchmark functions, the corresponding improvements are 54.47 % and 41.36 %, while for the CEC2020 benchmark functions, they are 50.71 % and 55.16 %, respectively. In addition, its overall performance is evaluated against two complex real-world engineering problems: UAV path planning and wireless sensor network coverage optimization. The experimental results show that MDBO provides very competitive optimization results compared to DBO, two highly referenced algorithms and five advanced algorithms.

一种求解实际工程问题的多策略增强屎壳郎算法
屎壳郎优化算法(DBO)是一种创新有效的元启发式算法,因其出色的数值优化性能而得到广泛认可。然而,由于勘探与开发的不平衡、缺乏协同搜索能力和种群多样性等原因,DBO算法收敛缓慢,容易陷入局部最优。为了克服这些挑战,本文提出了一种基于多策略协同增强(MDBO)的屎壳虫优化算法。该算法通过自适应调控和精英信息共享,构建了“搜索-增强-逃离”协同优化框架,主要创新点有三点:(1)采用双自适应搜索策略,结合蚁群质心自适应收缩机制和布朗双向交叉摄动强度调节,增强屎壳郎种群多样性和协同搜索能力,实现探索与开发的动态平衡;(2)精英增强解质量(EESQ)机制,通过结构化精英信息和双相自适应摄动,提高当前局部和全局最优位置的质量,加速收敛;(3)动态对立学习(DOL),在屎壳虫觅食和繁殖阶段引入不对称自适应扰动,增强了屎壳虫逃离局部最优的能力。这三者协同作用,以实现更有效的优化搜索。MDBO的性能使用IEEE CEC 2017、CEC 2019和CEC 2020基准功能进行评估。与DBO算法相比,MDBO算法在CEC2017基准函数上的收敛精度和稳定性分别提高了60.91%和63.98%。CEC2019基准函数的相应改进率分别为54.47%和41.36%,而CEC2020基准函数的相应改进率分别为50.71%和55.16%。此外,针对两个复杂的现实工程问题:无人机路径规划和无线传感器网络覆盖优化,对其整体性能进行了评估。实验结果表明,与DBO、两种高度参考算法和五种高级算法相比,MDBO的优化结果具有很强的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信