返回
IBMSMA: An Indicator-based Multi-swarm Slime Mould Algorithm for Multi-objective Truss Optimization Problems
DOI:10.1007/s42235-022-00307-9.png)
摘要
En 中文
This work proposes an improved multi-objective slime mould algorithm, called IBMSMA, for solving the multi-objective truss optimization problem. In IBMSMA, the chaotic grouping mechanism and dynamic regrouping strategy are employed to improve population diversity; the shift density estimation is used to assess the superiority of search agents and to provide selection pressure for population evolution; and the Pareto external archive is utilized to maintain the convergence and distribution of the non-dominated solution set. To evaluate the performance of IBMSMA, it is applied to eight multi-objective truss optimization problems. The results obtained by IBMSMA are compared with other 14 well-known optimization algorithms on hypervolume, inverted generational distance and spacing-to-extent indicators. The Wilcoxon statistical test and Friedman ranking are used for statistical analysis. The results of this study reveal that IBMSMA can find the Pareto front with better convergence and diversity in less time than state-of-the-art algorithms, demonstrating its capability in tackling large-scale engineering design problems.
Keyword:
Slime mould algorithm
Shift-based density estimation
Multi-swarm strategy
Multi-objective optimization
Truss optimization
期刊
IF:
5.8
论文数:
1.9K
被引数:
4.8K
机构
引用论文
Boosting slime mould algorithm for parameter identification of photovoltaic models用于光伏模型参数辨识的Boosting煤泥模算法
ENERGY
IF9.4
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
An effective multi-objective artificial hummingbird algorithm with dynamic elimination-based crowding distance for solving engineering design problems一种求解工程设计问题的动态消去拥挤距离多目标人工蜂鸟算法

