1 May 2010 in Science China Technological Sciences
3 June 2024 in IEEE Access
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.
27 June 2023 in IEEE Access
Aiming at the drawbacks of Hunger Games Search (HGS) algorithm, such as slow convergence speed and the tendency to fall into local optimum, a Multi-strategy fusion Improved Adaptive Hunger Games Search (MIA-HGS) algorithm is proposed. Firstly, a good point set is employed to generate a more diverse initial population. Secondly, the control strategy selection parameter is fixed in the original HGS algorithm; an adaptive adjustment parameter is proposed to replace the fixed parameters, whose dynamically tuned update strategy strengthens the global searching ability. Finally, to further jump out of the local optimum, a mutation operation based on Logarithmic spiral opposition-based learning is performed on a population for a certain condition. Simulation experiments are carried out for 23 benchmark functions and the UAV aerial planning problem. The results show that MIA-HGS solves more accurately and converges more rapidly than the original HGS algorithm on 23 benchmark functions, with MIA-HGS leading on 69.5% of the tested functions and tying with HGS on 21.7% of the tested functions. It also showed better performance than the other algorithms on the UAV flight planning problem.