Evidence map›Paper›PMID 36685136›Full record

ArticleArchives of computational methods in engineering : state of the art reviews2023

Slime Mould Algorithm: A Comprehensive Survey of Its Variants and Applications.

Farhad Soleimanian Gharehchopogh, Alaettin Ucan, Turgay Ibrikci, Bahman Arasteh, Gultekin Isik

Abstract read
In one paragraph

Article in Archives of computational methods in engineering : state of the art reviews, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 21 papers.

0numbers the graph read from it
0cells of the map it votes in
21citing 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

21 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Heliyon · 2023
    Article
  19. Article
  20. 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.

Farhad Soleimanian GharehchopoghDepartment of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia, Iran.ORCID 0000-0003-1588-1659
Alaettin UcanDepartment of Computer Engineering, Osmaniye Korkut Ata University, Osmaniye, Turkey.
Turgay IbrikciDepartment of Software Engineering, Adana Alparslan Turkes Science and Technology University, Adana, Turkey.
Bahman ArastehDepartment of Software Engineering, Faculty of Engineering and Natural Science, Istinye University, Istanbul, Turkey.
Gultekin IsikDepartment of Computer Engineering, Igdir University, Igdir, Turkey.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

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.

Identifiers

PMID36685136
PMCPMC9838547

What OpenQuestion holds

Textmetadata
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.