返回
A multi-strategy improved slime mould algorithm for global optimization and engineering design problems
DOI:10.1016/j.cma.2022.115764.png)
摘要
En 中文
In the application of metaheuristic algorithms (MAs) to complicated optimization problem solving, it is significant to balance the exploitation and exploration to obtain a good near-optimum solution to the problem. Therefore, in this study, to balance the exploitative and explorative features of conventional MAs, a multi-strategy improved slime mould algorithm called MSMA is introduced. In MSMA, a new search equation is developed to achieve a tradeoff between exploitation and exploration. Then the dynamic random search technique is utilized as a local search engine to enhance the search efficiency of the algorithm. Finally, the adaptive mutation probability is designed to avoid premature convergence. MSMA is evaluated using 28 benchmark functions and several practical engineering issues such as welded beam design, pressure vessel design, tension/compression spring design, and UAV path planning. The simulation results based on 30 independent runs demonstrate that it is more efficient and robust than other state-of-the-art techniques from the literature according to the selected performance metrics such as mean values and standard deviations. The source code of MSMA is publicly available at https://github.com/denglingyun123/Multi-s trategy-improved-slime-mould-algorithm.(c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Improved slime mould algorithm
Dynamic random search technique
Adaptive mutation probability
Benchmark
Engineering optimization
期刊
IF:
7.3
论文数:
1.3W
被引数:
5.6W
机构
引用论文
A PSO and pattern search based memetic algorithm for SVMs parameters optimization
NEUROCOMPUTING
IF6.5
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization求解全局数值优化问题的策略自适应差分进化算法
Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection基于反向学习的改进Salp群算法和新的局部搜索特征选择算法

