An efficient weighted slime mould algorithm for engineering optimization

Abstract In engineering applications, optimal parameter design is crucial. While Slime Mould Algorithm (SMA) excels in parameter discovery under constrained conditions, it faces challenges in achieving global convergence and avoiding local opsecttimal traps in complex tasks. This paper introduces an enhanced variant of SMA, termed CCHSMA, which integrates a Chaotic Local Search (CLS) mechanism to improve initial population diversity and combines Covariance Matrix Adaptation (CMA) and Harris Hawks Optimization (HHO) strategies to enhance global search efficiency. CCHSMA aims to improve search quality and reduce the likelihood of getting trapped in local optima. We evaluated CCHSMA's effectiveness by benchmarking it against the standard SMA and its variants using 30 CEC2017 test functions, and compared its performance with seven notable meta-heuristic algorithms and ten advanced swarm intelligence variants. The experimental results demonstrate that CCHSMA outperforms the other algorithms tested on the benchmark functions. To further validate its practical utility, CCHSMA's performance was also benchmarked against leading algorithms in real-world engineering applications. This paper uses detailed statistical methods, including the Wilcoxon signed-rank test and the Friedman test, to validate the comparative results. Our findings show that CCHSMA outperforms other algorithms in solving complex engineering optimization problems such as tension/compression spring design, pressure vessel design, and three-bar truss design, proving to be a robust tool for complex engineering optimization. Its enhanced initial population diversity and improved global search efficiency are essential for effectively addressing diverse engineering challenges.