An Enhanced Slime Mould Algorithm Combines Multiple Strategies

  • Xiong W
  • Li D
  • Zhu D
  • et al.
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In recent years, due to the growing complexity of real-world problems, researchers have been favoring stochastic search algorithms as their preferred method for problem solving. The slime mould algorithm is a high-performance, stochastic search algorithm inspired by the foraging behavior of slime moulds. However, it faces challenges such as low population diversity, high randomness, and susceptibility to falling into local optima. Therefore, this paper presents an enhanced slime mould algorithm that combines multiple strategies, called the ESMA. The incorporation of selective average position and Lévy flights with jumps in the global exploration phase improves the flexibility of the search approach. A dynamic lens learning approach is employed to adjust the position of the optimal slime mould individual, guiding the entire population to move towards the correct position within the given search space. In the updating method, an improved crisscross strategy is adopted to reorganize the slime mould individuals, which makes the search method of the slime mould population more refined. Finally, the performance of the ESMA is evaluated using 40 well-known benchmark functions, including those from CEC2017 and CEC2013 test suites. It is also recognized by Friedman’s test as statistically significant. The analysis of the results on two real-world engineering problems demonstrates that the ESMA presents a substantial advantage in terms of search capability.

Cite

CITATION STYLE

APA

Xiong, W., Li, D., Zhu, D., Li, R., & Lin, Z. (2023). An Enhanced Slime Mould Algorithm Combines Multiple Strategies. Axioms, 12(10), 907. https://doi.org/10.3390/axioms12100907

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free