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

被引:237
作者
Rajwar, Kanchan [1 ]
Deep, Kusum [1 ]
Das, Swagatam [2 ]
机构
[1] Indian Inst Technol Roorkee, Dept Math, Roorkee 247667, Uttarakhand, India
[2] Indian Stat Inst, Elect & Commun Sci Unit, Kolkata 700108, W Bengal, India
关键词
Optimization; Metaheuristic algorithm; Nature inspired algorithm; Parameter; META-HEURISTIC OPTIMIZATION; PARTICLE SWARM OPTIMIZATION; NATURE-INSPIRED ALGORITHM; NUMERICAL FUNCTION OPTIMIZATION; POPULATION-BASED ALGORITHM; GLOBAL OPTIMIZATION; ENGINEERING OPTIMIZATION; GENETIC ALGORITHM; EVOLUTIONARY COMPUTATION; CUCKOO SEARCH;
D O I
10.1007/s10462-023-10470-y
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:13187 / 13257
页数:71
相关论文
共 642 条
[81]  
Bodaghi M., 2019, IRAN J COMPUTER SCI, V2, P23, DOI [10.1007/s42044-018-0025-2, DOI 10.1007/S42044-018-0025-2]
[82]  
Boettcher S, 1999, ARXIV
[83]  
Borji A, 2009, INT J INNOV COMPUT I, V5, P1643
[84]   Honey-bees mating optimization (HBMO) algorithm:: A new heuristic approach for water resources optimization [J].
Bozorg-Haddad, Omid ;
Afshar, Abbas ;
Marino, Miguel A. .
WATER RESOURCES MANAGEMENT, 2006, 20 (05) :661-680
[85]   The raven roosting optimisation algorithm [J].
Brabazon, Anthony ;
Cui, Wei ;
O'Neill, Michael .
SOFT COMPUTING, 2016, 20 (02) :525-545
[86]   White Shark Optimizer: A novel bio-inspired meta-heuristic algorithm for global optimization problems [J].
Braik, Malik ;
Hammouri, Abdelaziz ;
Atwan, Jaffar ;
Al-Betar, Mohammed Azmi A. ;
Awadallah, Mohammed A. .
KNOWLEDGE-BASED SYSTEMS, 2022, 243
[87]   A novel meta-heuristic algorithm for solving numerical optimization problems: Ali Baba and the forty thieves [J].
Braik, Malik ;
Ryalat, Mohammad Hashem ;
Al-Zoubi, Hussein .
NEURAL COMPUTING & APPLICATIONS, 2022, 34 (01) :409-455
[88]   A novel meta-heuristic search algorithm for solving optimization problems: capuchin search algorithm [J].
Braik, Malik ;
Sheta, Alaa ;
Al-Hiary, Heba .
NEURAL COMPUTING & APPLICATIONS, 2021, 33 (07) :2515-2547
[89]  
Brammya G., 2019, COMPUT J, DOI [10.1093/COMJNL/BXY133, DOI 10.1093/COMJNL/BXY133]
[90]  
Burgin GH, 1972, J CYBERNETICS