Slime Mould Algorithm: A Comprehensive Survey of Its Variants and Applications
Open accessThe DOI matches its Crossref record.
Abstract
Meta-heuristic algorithms have a high position among academic researchers in various fields, such as science and engineering, in solving optimization problems. These algorithms can provide the most optimal solutions for optimization problems. This paper investigates a new meta-heuristic algorithm called Slime Mould algorithm (SMA) from different optimization aspects. The SMA algorithm was invented due to the fluctuating behavior of slime mold in nature. It has several new features with a unique mathematical model that uses adaptive weights to simulate the biological wave. It provides an optimal pathway for connecting food with high exploration and exploitation ability. As of 2020, many types of research based on SMA have been published in various scientific databases, including IEEE, Elsevier, Springer, Wiley, Tandfonline, MDPI, etc. In this paper, based on SMA, four areas of hybridization, progress, changes, and optimization are covered. The rate of using SMA in the mentioned areas is 15, 36, 7, and 42%, respectively. According to the findings, it can be claimed that SMA has been repeatedly used in solving optimization problems. As a result, it is anticipated that this paper will be beneficial for engineers, professionals, and academic scientists.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Trojovský, P., & Dehghani, M. (2023) · Scientific Reports · doi:10.1038/s41598-023-35863-5 · Cited by 302
Scientometric Analysis of Quantum Algorithms for VANET Optimization
Pooja, & Kumar Sood, S. (2024) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2024.3428707 · Cited by 9
Metadata
- Authors
- Gharehchopogh, F. S., Ucan, A., Ibrikci, T., Arasteh, B., & Isik, G.
- Venue
- Archives of Computational Methods in Engineering
- Published
- 2023-01-12
- Volume
- 30
- Issue
- 4
- Pages
- 2683-2723
- ISSN
- 1134-3060 (ISSN-L)
- 1886-1784
- OpenAlex
- W4315651978
- Cited by
- 170
- References
- 0
- FWCI
- 14.93
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Slime Mould Algorithm: A Comprehensive Survey of Its Variants and Applications. https://app.cochat.ai/papers/10.1007/s11831-023-09883-3
- The paper
- Gharehchopogh, F. S., Ucan, A., Ibrikci, T., Arasteh, B., & Isik, G. (2023). Slime Mould Algorithm: A Comprehensive Survey of Its Variants and Applications. Archives of Computational Methods in Engineering. https://doi.org/10.1007/s11831-023-09883-3
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.