{"title":"A multi-strategy enhanced dung beetle algorithm for solving real-world engineering problems","authors":"Zhengxing Mao, Zhen Yang, Dan Luo, Dong Lin, Qinghong Jiang, Guoxian Huang, 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.
期刊介绍:
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.