Search

The dung beetle optimization (DBO) algorithm is acknowledged for its robust optimization capabilities and rapid convergence as an efficient swarm intelligence optimization technique. Nevertheless, DBO, similar to other swarm intelligence algorithms, often gets trapped in local optima during the later stages of optimization. To mitigate this challenge, we propose the Move-to-Escape dung beetle optimization (MEDBO) algorithm in this paper. MEDBO utilizes a good point set strategy for initializing the swarm's initial population, ensuring a more uniform distribution and diminishing the risk of local optima entrapment. Moreover, it incorporates convergence factors and dynamically balances the number of offspring and foraging individuals, prioritizing global exploration initially and local exploration subsequently. This dynamic adjustment not only enhances the search speed but also prevents local optima stagnation. The algorithm's performance was assessed using the CEC2017 benchmark suite, which confirmed MEDBO's significant improvements. Additionally, we applied MEDBO to three engineering problems: pressure vessel design, three-bar truss design, and spring design. MEDBO exhibited an excellent performance in these applications, demonstrating its practicality and efficacy in real-world problem-solving contexts. [ABSTRACT FROM AUTHOR]

The Dung Beetle Optimization (DBO) algorithm, a well-established swarm intelligence technique, has shown considerable promise in solving complex engineering design challenges. However, it is hampered by limitations such as suboptimal population initialization, sluggish search speeds, and restricted global exploration capabilities. To overcome these shortcomings, we propose an enhanced version termed Adaptive Spiral Strategy Dung Beetle Optimization (ADBO). Key enhancements include the application of the Gaussian Chaos strategy for a more effective population initialization, the integration of the Whale Spiral Search Strategy inspired by the Whale Optimization Algorithm, and the introduction of an adaptive weight factor to improve search efficiency and enhance global exploration capabilities. These improvements collectively elevate the performance of the DBO algorithm, significantly enhancing its ability to address intricate real-world problems. We evaluate the ADBO algorithm against a suite of benchmark algorithms using the CEC2017 test functions, demonstrating its superiority. Furthermore, we validate its effectiveness through applications in diverse engineering domains such as robot manipulator design, triangular linkage problems, and unmanned aerial vehicle (UAV) path planning, highlighting its impact on improving UAV safety and energy efficiency. [ABSTRACT FROM AUTHOR]