Evidence map›Paper›PMID 38248605›Full record

ReviewBiomimetics (Basel, Switzerland)2024

Advances in Slime Mould Algorithm: A Comprehensive Survey.

Yuanfei Wei, Zalinda Othman, Kauthar Mohd Daud, Qifang Luo, Yongquan Zhou

Abstract readReview
In one paragraph

Review in Biomimetics (Basel, Switzerland), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Yuanfei WeiFaculty of Information Science and Technology, Universiti Kebangsaan Malaysia, Bangi 43600, Selangor, Malaysia.
Zalinda OthmanFaculty of Information Science and Technology, Universiti Kebangsaan Malaysia, Bangi 43600, Selangor, Malaysia.ORCID 0000-0001-9142-3612
Kauthar Mohd DaudFaculty of Information Science and Technology, Universiti Kebangsaan Malaysia, Bangi 43600, Selangor, Malaysia.ORCID 0000-0002-4460-9462
Qifang LuoCollege of Artificial Intelligence, Guangxi Minzu University, Nanning 530006, China.
Yongquan ZhouFaculty of Information Science and Technology, Universiti Kebangsaan Malaysia, Bangi 43600, Selangor, Malaysia.ORCID 0000-0003-4404-952X

Funding

Scientific Research project of Xiangsihu College of Guangxi Minzu University 2021XJKY21the National Science Foundation of China 62066005
6 · The paper itself

Abstract

The slime mould algorithm (SMA) is a new swarm intelligence algorithm inspired by the oscillatory behavior of slime moulds during foraging. Numerous researchers have widely applied the SMA and its variants in various domains in the field and proved its value by conducting various literatures. In this paper, a comprehensive review of the SMA is introduced, which is based on 130 articles obtained from Google Scholar between 2022 and 2023. In this study, firstly, the SMA theory is described. Secondly, the improved SMA variants are provided and categorized according to the approach used to apply them. Finally, we also discuss the main applications domains of the SMA, such as engineering optimization, energy optimization, machine learning, network, scheduling optimization, and image segmentation. This review presents some research suggestions for researchers interested in this algorithm, such as conducting additional research on multi-objective and discrete SMAs and extending this to neural networks and extreme learning machining.

Indexed as

metaheuristic algorithmoptimizationslime mould algorithm (SMA)swarm intelligence

Identifiers

PMID38248605
PMCPMC10813181

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.