局部最优
数学优化
计算机科学
人口
粒子群优化
水准点(测量)
元启发式
算法
局部搜索(优化)
进化算法
早熟收敛
趋同(经济学)
数学
经济增长
社会学
人口学
经济
地理
大地测量学
作者
Longhai Li,Huan Liu,Yang Shao,Zhen Xu,Yue Chen,Can Guo,Heng Nian
出处
期刊:Electronics
[Multidisciplinary Digital Publishing Institute]
日期:2023-10-30
卷期号:12 (21): 4462-4462
标识
DOI:10.3390/electronics12214462
摘要
The Dung Beetle Optimization (DBO) algorithm is a powerful metaheuristic algorithm that is widely used for optimization problems. However, the DBO algorithm has limitations in balancing global exploration and local exploitation capabilities, often leading to getting stuck in local optima. To overcome these limitations and address global optimization problems, this study introduces the Multi-Strategy and Improved DBO (MSIDBO) Algorithm. The MSIDBO algorithm incorporates several advanced computational techniques to enhance its performance. Firstly, it introduces a random reverse learning strategy to improve population diversity and mitigate early convergence or local stagnation issues present in the DBO algorithm. Additionally, a fitness-distance balancing strategy is employed to better manage the trade-off between diversity and convergence within the population. Furthermore, the algorithm utilizes a spiral foraging strategy to enhance precision, promote strong exploratory capabilities, and prevent being trapped in local optima. To further enhance the global search ability and particle utilization of the MSIDBO algorithm, it combines the Optimal Dimension-Wise Gaussian Mutation strategy. By minimizing premature convergence, population diversity is increased, and the convergence of the algorithm is accelerated. This expansion of the search space reduces the likelihood of being trapped in local optima during the evolutionary process. To demonstrate the effectiveness of the MSIDBO algorithm, extensive experiments are conducted using benchmark test functions, comparing its performance against other well-known metaheuristic algorithms. The results highlight the feasibility and superiority of MSIDBO in solving optimization problems. Moreover, the MSIDBO algorithm is applied to path planning simulation experiments to showcase its practical application potential. A comparison with the DBO algorithm shows that MSIDBO generates shorter and faster paths, effectively addressing real-world application problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI