In this paper, a Multi-Strategy fusion Improved Dung Beetle Optimization (MSIDBO) algorithm is proposed to address the problems that the dung beetle optimization algorithm is prone to fall into local optimum, suffers from weak global exploration, and shows slow convergence to a solution. In MSIDBO, a good point set strategy is adopted to generate a more diverse initial population; Golden sine and t-distribution perturbation strategies are used to improve the global search capability of the algorithm; By introducing the adaptive Gaussian-Cauchy mutation strategy, the probability of the algorithm falling into local optimal is reduced. To verify the effectiveness of the MSIDBO algorithm, it was tested against 23 benchmark functions and 29 CEC-2017 test functions, comparing its performance with that of other well-known metaheuristic algorithms. The results show that the MSIDBO algorithm excelled in 17 out of 23 benchmark test functions, achieving higher solution accuracy and faster convergence compared to the original DBO algorithm, while the remaining 6 functions yielded comparable results. Similarly, among the 29 CEC-2017 test functions, the MSIDBO algorithm surpassed the original DBO algorithm in 25, and the remaining 4 functions yielded similar results. Additionally, to verify the practical application potential of the MSIDBO algorithm, this paper applies it to optimize three engineering design problems, and the experimental results show that the MSIDBO algorithm has a higher application potential compared with other algorithms.
To tackle the shortcomings of the Dung Beetle Optimization (DBO) Algorithm, which include slow convergence speed, an imbalance between exploration and exploitation, and susceptibility to local optima, a Somersault Foraging and Elite Opposition-Based Learning Dung Beetle Optimization (SFEDBO) Algorithm is proposed. This algorithm utilizes an elite opposition-based learning strategy as the method for generating the initial population, resulting in a more diverse initial population. To address the imbalance between exploration and exploitation in the algorithm, an adaptive strategy is employed to dynamically adjust the number of dung beetles and eggs with each iteration of the population. Inspired by the Manta Ray Foraging Optimization (MRFO) algorithm, we utilize its somersault foraging strategy to perturb the position of the optimal individual, thereby enhancing the algorithm’s ability to escape from local optima. To verify the effectiveness of the proposed improvements, the SFEDBO algorithm is utilized to optimize 23 benchmark test functions. The results show that the SFEDBO algorithm achieves better solution accuracy and stability, outperforming the DBO algorithm in terms of optimization results on the test functions. Finally, the SFEDBO algorithm was applied to the practical application problems of pressure vessel design, tension/extension spring design, and 3D unmanned aerial vehicle (UAV) path planning, and better optimization results were obtained. The research shows that the SFEDBO algorithm proposed in this paper is applicable to actual optimization problems and has better performance.