IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v54y2023i1p204-235.html
   My bibliography  Save this article

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

Author

Listed:
  • Huiling Chen
  • Chenyang Li
  • Majdi Mafarja
  • Ali Asghar Heidari
  • Yi Chen
  • Zhennao Cai

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.

Suggested Citation

  • Huiling Chen & Chenyang Li & Majdi Mafarja & Ali Asghar Heidari & Yi Chen & Zhennao Cai, 2023. "Slime mould algorithm: a comprehensive review of recent variants and applications," International Journal of Systems Science, Taylor & Francis Journals, vol. 54(1), pages 204-235, January.
  • Handle: RePEc:taf:tsysxx:v:54:y:2023:i:1:p:204-235
    DOI: 10.1080/00207721.2022.2153635
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2022.2153635
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2022.2153635?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:54:y:2023:i:1:p:204-235. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.