Slime mould algorithm: a comprehensive review of recent variants and applications

150Citations
Citations of this article
67Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Slime Mould Algorithm (SMA) has recently received much attention from researchers because of its simple structure, excellent optimisation capabilities, and acceptable convergence in dealing with various types of complex real-world problems. this study aims to retrieve, identify, summarise and analyse critical studies related to SMA development. Based on this, 98 SMA-related studies in the Web of Science were retrieved, selected, and identified. The two main review vectors were advanced versions of SMAs and application domains. First, we counted and analysed various advanced versions of SMAs, summarised, classified, and discussed their improvement methods and directions. Secondly, we sort out the application domains of SMA and analyse the role, development status, and shortcomings of SMA in each domain. A survey based on the existing literature shows that SMAs clearly outperform some established metaheuristics in terms of speed and accuracy in handling various benchmark problems and solving multiple realistic optimization problems. This review not only suggests possible future directions in the field but, due to the inclusion of graphical and tabular comparisons of various properties, also provides future researchers with a comprehensive source of information about SMA and advanced versions of SAMs and the scope of adaptation for multiple application domains.

Cite

CITATION STYLE

APA

Chen, H., Li, C., Mafarja, M., Heidari, A. A., Chen, Y., & Cai, Z. (2023). Slime mould algorithm: a comprehensive review of recent variants and applications. International Journal of Systems Science. Taylor and Francis Ltd. https://doi.org/10.1080/00207721.2022.2153635

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