Evidence map›Paper›PMID 36059575›Full record

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

Moth Flame Optimization: Theory, Modifications, Hybridizations, and Applications.

Saroj Kumar Sahoo, Apu Kumar Saha, Absalom E Ezugwu, Jeffrey O Agushaka, Belal Abuhaija, Anas Ratib Alsoud, Laith Abualigah

Open access · bronzeAbstract 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 6 papers.

0numbers the graph read from it
0cells of the map it votes in
6citing papers in PubMed
6.7field-weighted citation impact, top 2% of its field
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

6 citing papers in PubMed, 78 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. 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

7 authors at 4 institutions in 4 countries.

Saroj Kumar SahooDepartment of Mathematics, National Institute of Technology Agartala, Agartala, Tripura 799046 India.
Apu Kumar SahaDepartment of Mathematics, National Institute of Technology Agartala, Agartala, Tripura 799046 India.
Absalom E EzugwuSchool of Computer Science, University of KwaZulu-Natal, King Edward Road, Pietermaritzburg Campus, Pietermaritzburg, 3201 KwaZulu-Natal South Africa.
Jeffrey O AgushakaSchool of Computer Science, University of KwaZulu-Natal, King Edward Road, Pietermaritzburg Campus, Pietermaritzburg, 3201 KwaZulu-Natal South Africa.
Belal AbuhaijaDepartment of Computer Science, Wenzhou - Kean University, Wenzhou, China.
Anas Ratib AlsoudHourani Center for Applied Scientific Research, Al-Ahliyya Amman University, Amman, 19328 Jordan.
Laith AbualigahHourani Center for Applied Scientific Research, Al-Ahliyya Amman University, Amman, 19328 Jordan.ORCID 0000-0002-2203-4549
Al-Ahliyya Amman University · JONational Institute of Technology Agartala · INUmkhuseli Innovation and Research Management · ZAWenzhou-Kean University · CN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The Moth flame optimization (MFO) algorithm belongs to the swarm intelligence family and is applied to solve complex real-world optimization problems in numerous domains. MFO and its variants are easy to understand and simple to operate. However, these algorithms have successfully solved optimization problems in different areas such as power and energy systems, engineering design, economic dispatch, image processing, and medical applications. A comprehensive review of MFO variants is presented in this context, including the classic version, binary types, modified versions, hybrid versions, multi-objective versions, and application part of the MFO algorithm in various sectors. Finally, the evaluation of the MFO algorithm is presented to measure its performance compared to other algorithms. The main focus of this literature is to present a survey and review the MFO and its applications. Also, the concluding remark section discusses some possible future research directions of the MFO algorithm and its variants.

Identifiers

PMID36059575
PMCPMC9422949
OpenAlexW4293445899

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.