Slime mould algorithm with horizontal crossover and adaptive evolutionary strategy: performance design for engineering problems

In optimization, metaheuristic algorithms have received extensive attention and research due to their excellent performance. The slime mould algorithm (SMA) is a newly proposed metaheuristic algorithm. It has the characteristics of fewer parameters and strong optimization ability. However, with the increasing difficulty of optimization problems, SMA has some shortcomings in complex problems. For example, the main concerns are low convergence accuracy and prematurely falling into local optimal solutions. To overcome these problems, this paper has developed a variant of SMA called CCSMA. It is an improved SMA based on horizontal crossover (HC) and covariance matrix adaptive evolutionary strategy (CMAES). First, HC can enhance the exploitation of the algorithm by crossing the information between different individuals to promote communication within the population. Finally, CMAES facilitates algorithm exploration and exploitation to reach a balanced state by dynamically adjusting the size of the search range. This benefits the algorithm by allowing it to go beyond the local space to explore other solutions with better quality. To verify the superiority of the proposed algorithm, we select some new original and improved algorithms as competitors. CCSMA is compared with these competitors in 40 benchmark functions of IEEE CEC2017 and CEC2020. The results demonstrate that our work outperforms the competitors in terms of optimization accuracy and jumping out of the local space. In addition, CCSMA is applied to tackle three typical engineering optimization problems. These three problems include multiple disk clutch brake design, pressure vessel design, and speed reducer design. The results showed that CCSMA achieved the lowest optimization cost. This also proves that it is an effective tool for solving realistic optimization problems. Graphical Abstract