The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Slime mould algorithm: a comprehensive review of recent variants and applications
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.
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
Cites
A Comparative Study of Class Rebalancing Methods for Security Bug Report Classification
Zheng, W., Xun, Y., Wu, X., Deng, Z., Chen, X., & Sui, Y. (2021) · IEEE Transactions on Reliability · doi:10.1109/tr.2021.3118026 · Cited by 85 · cited 1×
“…in general, is large, and the number of feasible solutions is enormous, so there is still a need to devise more efficient ways of using existing knowledge to search the problem space efficiently and thus achieve the optimum (Liang et al., 2022; Xie et al., 2022; Zheng, Xun, Wu, et al.,2021 ).”
Background
Cited by
RIME: A physics-based optimization
Su, H., Zhao, D., Heidari, A. A., Liu, L., Zhang, X., Mafarja, M., & Chen, H. (2023) · Neurocomputing · doi:10.1016/j.neucom.2023.02.010 · Cited by 1,074
Self-citationParrot optimizer: Algorithm and applications to medical problems
Lian, J., Hui, G., Ma, L., Zhu, T., Wu, X., Heidari, A. A., Chen, Y., & Chen, H. (2024) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2024.108064 · Cited by 479
Self-citation
Metadata
- Authors
- Chen, H., Li, C., Mafarja, M., Heidari, A. A., Chen, Y., & Cai, Z.
- Venue
- International Journal of Systems Science
- Publisher
- Informa UK Limited
- Published
- 2022-12-16
- Volume
- 54
- Issue
- 1
- Pages
- 204-235
- ISSN
- 0020-7721 (ISSN-L)
- 1464-5319
- OpenAlex
- W4311632513
- Cited by
- 188
- References
- 1
- FWCI
- 13.41
- Type
- journal article
- Language
- en
- Open access
- closed
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 review of recent variants and applications. https://app.cochat.ai/papers/10.1080/00207721.2022.2153635
- The paper
- 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. https://doi.org/10.1080/00207721.2022.2153635
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.