Evidence map›Paper›PMID 37362893›Full record

ArticleArtificial intelligence review2023

An exhaustive review of the metaheuristic algorithms for search and optimization: taxonomy, applications, and open challenges.

Kanchan Rajwar, Kusum Deep, Swagatam Das

Abstract read
In one paragraph

Article in Artificial intelligence review, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 58 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
58citing papers in PubMed, 1 pooled it
–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

58 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Review
  11. Review
  12. Article
  13. Article
  14. Review
  15. Article
  16. Article
  17. Article
  18. 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

3 authors.

Kanchan RajwarDepartment of Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand 247667 India.
Kusum DeepDepartment of Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand 247667 India.
Swagatam DasElectronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata, West Bengal 700108 India.ORCID 0000-0001-6843-4508

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

As the world moves towards industrialization, optimization problems become more challenging to solve in a reasonable time. More than 500 new metaheuristic algorithms (MAs) have been developed to date, with over 350 of them appearing in the last decade. The literature has grown significantly in recent years and should be thoroughly reviewed. In this study, approximately 540 MAs are tracked, and statistical information is also provided. Due to the proliferation of MAs in recent years, the issue of substantial similarities between algorithms with different names has become widespread. This raises an essential question: can an optimization technique be called 'novel' if its search properties are modified or almost equal to existing methods? Many recent MAs are said to be based on 'novel ideas', so they are discussed. Furthermore, this study categorizes MAs based on the number of control parameters, which is a new taxonomy in the field. MAs have been extensively employed in various fields as powerful optimization tools, and some of their real-world applications are demonstrated. A few limitations and open challenges have been identified, which may lead to a new direction for MAs in the future. Although researchers have reported many excellent results in several research papers, review articles, and monographs during the last decade, many unexplored places are still waiting to be discovered. This study will assist newcomers in understanding some of the major domains of metaheuristics and their real-world applications. We anticipate this resource will also be useful to our research community.

Indexed as

Metaheuristic algorithmNature inspired algorithmOptimizationParameter

Identifiers

PMID37362893
PMCPMC10103682

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.