【综述文章】【中英双语】【2023年发表】搜索和优化的元启发式算法的详尽回顾：分类，应用和开放的挑战

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

搜索和优化的元启发式算法的详尽回顾：分类，应用和开放的挑战

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.
        随着世界走向工业化，优化问题在合理的时间内解决变得更具挑战性。到目前为止，已经开发了500多个新的元启发式算法（MA），其中350多个是在过去十年中出现的。近年来，这方面的文献大量增加，应予以彻底综述。在这项研究中，跟踪了大约540个MA，并提供了统计信息。

        由于近年来MA的激增，具有不同名称的算法之间的实质相似性的问题已经变得普遍。这就提出了一个重要的问题：如果一种优化技术的搜索特性被修改或几乎等于现有的方法，那么这种优化技术可以被称为“新颖的”吗？

        许多最近的硕士学位据说是基于'新颖的想法'，所以他们进行了讨论。此外，本研究根据控制参数的数量对MA进行了分类，这是该领域的一种新分类法。 MA已被广泛应用于各个领域的强大的优化工具，并展示了他们的一些实际应用。

        已经确定了一些限制和开放的挑战，这可能会导致一个新的方向，并购在未来。

        尽管在过去的十年里，研究人员在一些研究论文、评论文章和专著中报告了许多优秀的结果，但许多未探索的地方仍然等待被发现。

        这项研究将帮助新来者了解元分析的一些主要领域及其在现实世界中的应用。我们预计，这些资源也将对我们的研究社区有用。

1 Introduction 

1 引言

        The term ‘meta’ is becoming more prevalent nowadays; it generally translates to ‘beyond’ or ‘higher level’. Although there is no agreed mathematical definition, the continued development of heuristic algorithms is usually referred to as MAs (Yang 2020). A heuristic algorithm is a method for producing acceptable solutions to optimization problems through trial and error. Intelligence is found not only in humans but also in animals, microorganisms, and other minute aspects of nature, such as ants, bees, and other creatures. Nature serves as a source of inspiration for many MAs, which are referred to as nature-inspired algorithms (NIAs) (Yang 2010a). Nature performs all tasks optimally, whether it’s moving light through space in the shortest path, carrying out the work function of any living organ with the least amount of energy expansion, or forming bubbles with the least amount of surface area that is a sphere. Natural selection favors optimization. That is the most efficient method of completing any task successfully and hassle-free. This simple concept can be applied to any type of work that we perform in our everyday lives. However, when it comes to large-scale operations, such as those in businesses, national security, distribution in large areas, and the design of some structures, we require a concrete method or tool to ensure that resources are utilized properly and that are maximized, which leads to operations research (OR). During the last decade, metaheuristics have emerged as a powerful optimization tool in OR. Also, MAs are becoming more critical in computational intelligence because they are flexible, adaptive, and have an extensive search capacity. MAs are used in NP-Hard problems, fixture and manufacturing cell design, soft computing, foreign exchange trading, robotics, medical science, behavioral science, photo-voltaic models, and so on, which is evidence of the importance of MAs. As MAs are stochastic by nature, they cannot guarantee the achievement of the optimal solution. As a result, the question naturally arises: Is it a worthy choice? It is roughly akin to ‘something is better than nothing.’ When others fail, MAs provide us with a satisfactory ‘something’. In practice, we achieve a satisfactory or workable solution in a reasonable amount of time. Most of the algorithms have been tested for lower dimensions. It is necessary to test them for a higher dimensional problem and improve them if necessary to tackle the ‘curse of dimensionality’. A significant research gap between theory and implementation has been shown, which should be taken care of. As exploration and exploitation are the fundamental strategies of most MAs, balancing them is another challenge. The main contributions of this study can be summarized as:
        “Meta”这个词现在变得越来越流行;它通常翻译为“超越”或“更高的水平”。虽然没有公认的数学定义，但启发式算法的持续发展通常被称为MA（Yang 2020）。启发式算法是一种通过尝试和错误来产生优化问题的可接受解决方案的方法。智力不仅存在于人类，也存在于动物、微生物和自然界的其他微小方面，如蚂蚁、蜜蜂和其他生物。自然是许多MA的灵感来源，这些MA被称为自然启发算法（NIA）（Yang 2010 a）。大自然以最佳方式执行所有任务，无论是以最短的路径在空间中移动光线，以最小的能量膨胀执行任何生命器官的功函数，还是形成具有最小表面积的气泡，即球体。自然选择有利于优化。 这是成功和轻松完成任何任务的最有效方法。这个简单的概念可以应用于我们日常生活中执行的任何类型的工作。然而，当涉及到大规模运营时，例如企业，国家安全，大面积分布以及一些结构的设计，我们需要一种具体的方法或工具来确保资源得到适当利用并最大化，这导致了运筹学（OR）。在过去的十年中，元分析已经成为一个强大的优化工具或。此外，MA在计算智能中变得越来越重要，因为它们是灵活的，自适应的，并且具有广泛的搜索能力。MA被用于NP难问题，夹具和制造单元设计，软计算，外汇交易，机器人，医学科学，行为科学，光伏模型等，这证明了MA的重要性。 由于MA本质上是随机的，它们不能保证实现最优解。因此，问题自然出现了：这是一个值得选择的选择吗？它大致类似于“有总比没有好”。当别人失败时，MA为我们提供了一个令人满意的“东西”。在实践中，我们在合理的时间内实现了令人满意或可行的解决方案。大多数的算法已经过测试，为较低的维度。有必要针对更高维的问题对它们进行测试，并在必要时对其进行改进，以解决“维数灾难”。理论和实施之间的一个显着的研究差距已经显示，这应该得到照顾。由于勘探和开发是大多数并购的基本战略，平衡它们是另一个挑战。 本研究的主要贡献可概括为：

• The article presents a recent metaheuristics survey. The data set for this study contains about 540 MAs.
  本文介绍了一个最近的元认知学调查。本研究的数据集包含约540个MA。

• This study provides critical yet constructive analysis, addressing improper methodological practices to accomplish helpful research.
  这项研究提供了批判性但建设性的分析，解决不适当的方法实践，以完成有益的研究。

• A new classification of MAs is proposed based on the number of parameters.
  提出了一种基于参数个数的MA分类方法。

• The limitations of metaheuristics, as well as open challenges, are highlighted.
  元分析的局限性，以及开放的挑战，突出显示。

• Several potential future research directions for metaheuristics have been identified.
  已经确定了几个潜在的未来的研究方向metabolistics。

        The rest of this paper is organized as follows. A brief history is discussed in Sect. 2. A compilation of existing MAs and other literary works are provided in Sect. 3. In Sect. 4, few statistical data are provided, while constructive criticism has been done in Sect. 5. MAs are classified into subgroups based on four different points of view in Sect. 6. In addition, Sect. 7 contains some real-world metaheuristics applications. A few limitations, including some open challenges, are addressed in Sect. 8. A brief overview of the potential future directions of metaheuristics is provided in Sect. 9. Finally, conclusions are drawn in Sect. 10.
        本文的其余部分组织如下。第二节讨论了简要的历史。第3节提供了现有文学硕士和其他文学作品的汇编。第4节提供的统计数据很少，而第5节则提出了建设性的批评。在第6节中，根据四种不同的观点，将管理和行政协定分为若干小类。此外，第7节包含一些现实世界的元分析应用。第8节讨论了一些局限性，包括一些公开的挑战。第9节简要概述了元分析学未来的潜在发展方向。最后，在第10节中得出结论。

2 Brief history 

2 简史

        What was the first use of (meta) heuristic? Because the heuristic process automatically dominates the human mind, humans may have employed it from the beginning, whether they realized it or not: the use of fire, the acquisition of number systems, and the usage of the wheel are all examples of heuristic process applications. Any practical problem can be modeled mathematically for optimization—this is a challenging task; even the more challenging task is to optimize it. To address this situation, scientists proposed several approaches that are now referred to as ‘conventional methods’. They are mainly as follows:
        什么是第一次使用（Meta）启发式？因为启发式过程自动支配着人类的思维，所以人类可能从一开始就使用了它，不管他们是否意识到这一点：火的使用，数字系统的获得，以及轮子的使用都是启发式过程应用的例子。任何实际问题都可以通过数学建模进行优化，这是一项具有挑战性的任务;甚至更具有挑战性的任务是优化它。为了解决这种情况，科学家提出了几种方法，现在被称为“传统方法”。主要有：

• Direct search: random search method, uni-variant method, pattern search method, convex optimization, linear programming, interior-point method, quadratic         programming, trust-region method, etc.
  直接搜索：随机搜索法、单变量法、模式搜索法、凸优化、线性规划、邻域点法、二次规划、信赖域法等。

• Gradient-based method: steepest descent method, conjugate gradient method, Newton–Raphson method, quasi-Newton method, etc.
  基于梯度的方法：最速下降法、共轭梯度法、牛顿-拉夫逊法、拟牛顿法等。

        Since the most realistic optimization problems are discontinuous and highly non-linear, conventional methods fail to prove their efficiency, robustness, and accuracy. Researchers devised alternative approaches to tackle such problems. It is worth noting that nature has inspired us since the beginning–whether making fire from a jungle blaze or making ships from floating wood. In general, all are gifted by nature, directly or indirectly.
        由于最现实的优化问题是不连续和高度非线性的，传统的方法无法证明其效率，鲁棒性和准确性。研究人员设计了替代方法来解决这些问题。值得一提的是，大自然自创世以来就一直激励着我们无论是从丛林大火中生火，还是用漂浮的木头造船。总的来说，所有人都是天生的，直接或间接的。

However, Hungarian mathematician George Pólya wrote the book ‘How to Solve It’ about the subject in 1945, where he gave an idea about heuristic searches and mentioned four steps to grasping a problem as follows: (a) understand the problem, (b) devising a plan, (c) looking back, and (d) carrying the plan (Polya 2004). The book gained immense attraction and was translated into several languages, selling over a million copies. Still, the book is used in mathematical education, Pólya work inspired Douglas Lenat’s Automated Mathematician and Eurisko artificial intelligence programs.
然而，匈牙利数学家乔治波利亚在1945年写了一本关于这个问题的书《如何解决它》，在书中他给出了一个关于启发式搜索的想法，并提到了抓住一个问题的四个步骤：（a）理解问题，（b）设计一个计划，（c）回顾，（d）执行计划（Polya 2004）。这本书获得了巨大的吸引力，并被翻译成几种语言，销售超过一百万册。尽管如此，这本书是用于数学教育，波利亚工作启发了道格拉斯Lenat的自动数学家和Eurisko人工智能程序。

Also, scientists all over the world tried to solve many practical problems. In this case, in 1945, the first success came by breaking the Enigma ciphers’ code at Bletchley Park by using heuristic algorithms; British scientist Turing called his method ‘heuristic search’ (Hodges 2012). He was one of the designers of the bombe, used in World War II. After then, he proposed a ‘learning machine’ in 1950, which would parallel the principle of evolution. Barricelli started work with computer simulation as early as 1954 at the Institute for Advanced Study, New Jersey. Although his work was not noticed widely, his work in evolution is considered pioneering in artificial life research. Artificial evolution became a well-recognized optimization approach in the 1960s and early 1970s due to the work of Rechenberg and Schwefel (sulfur 1977). Rechenberg solved many complex engineering problems through evolution strategies. Next, Fogel proposed generating artificial intelligence. Decision Science Inc. was probably the first company to use evolutionary computation to solve real-world problems in 1966. Owens and Burgin further expanded the methodology, and the Adaptive Maneuvering Logic flight simulator was initially deployed at Langley Research Center for air-to-air combat training (Burgin and Fogel 1972). Fogel and Burgin also experimented with simulations of co-evolutionary games in Decision Science. They also worked on the real-world applications of evolutionary computation in many ways, including modeling human operators and thinking about biological communication (Fogel et al. 1970). In the early 1970s, Holland formalized a breakthrough programming technique, the genetic algorithm (GA), which he summarised in his book ‘Adaptation in Natural and Artificial Systems’ (Holland 1991). He worked to extend the algorithm’s scope during the next decade by creating a genetic code representing any computer program structure. Also, he developed a framework for predicting the next generation’s quality, known as Holland’s schema theorem. Kirkpatrick et al. (1983) proposed simulated annealing (SA), which is a single point-based algorithm inspired by the mechanism of metallurgy’s annealing process. Glover (1989) formalized the tabu search computer-based optimization methodology. This is based on local search, which has a high probability of getting stuck in local optima. Another interesting artificial life program, called boid, was developed by Reynolds (1987), which simulates birds’ flocking behavior. It was used for visualizing information and optimization tasks. Moscato et al. (1989) introduced a memetic algorithm in his technical report inspired by Darwinian principles of natural evolution and Dawkins’ notion of a meme. The memetic algorithm was an extension of the traditional genetic algorithm. It was used as a local search technique to reduce the likelihood of premature convergence. Another nature-inspired algorithm from the early years was developed in 1989 by Bishop and Torr (1992), later referred to as stochastic diffusion search (SDS). Kennedy and Eberhart (1995) developed particle swarm optimization (PSO), which was first intended for simulating social behaviour. This is one of the simplest and most widely used algorithm. In the next two years, an appreciable and controversial work, the no free lunch theorem (NFL) for optimization, was introduced and proved explicitly by Wolpert and Macready (1997). While some researchers argue that NFL has some significant insight, others argue that NFL has little relevance to machine learning research. But the main thing is that NFL unlocks a golden opportunity to further research for developing new domain-specific algorithms. The validity of the NFL for higher dimensions is still under investigation. Later on, several efficient algorithms have been developed, such as differential evolution (DE) by Storn and Price (1997), ant colony optimization (ACO) by Dorigo et al. (2006), artificial bee colony (ABC) by Karaboga and Basturk (2007), and others, as shown in the following section.
此外，世界各地的科学家试图解决许多实际问题。在这种情况下，在1945年，第一次成功是通过使用启发式算法在Bletchley Park破解Enigma密码;英国科学家图灵称他的方法为“启发式搜索”（Hodges 2012）。他是第二次世界大战中使用的炸弹的设计者之一。在那之后，他在1950年提出了一种“学习机器”，这将与进化原理相平行。早在1954年，Barricelli就在新泽西的高级研究所开始了计算机模拟的工作。虽然他的工作没有被广泛注意，但他在进化方面的工作被认为是人工生命研究的先驱。人工进化在20世纪60年代和70年代初成为一种公认的优化方法，这要归功于Rechenberg和Schwefel的工作（sulfur 1977）。Rechenberg通过进化策略解决了许多复杂的工程问题。接下来，福格尔提出了生成人工智能。决策科学公司 1966年，IBM可能是第一家使用进化计算解决现实问题的公司。Owens和Burgin进一步扩展了该方法，自适应机动逻辑飞行模拟器最初部署在兰利研究中心用于空对空战斗训练（Burgin和Fogel 1972）。福格尔和伯金还在《决策科学》中对共同进化博弈进行了模拟实验。他们还以多种方式研究进化计算的现实应用，包括模拟人类操作员和思考生物通信（Fogel et al. 1970）。在20世纪70年代早期，Holland正式提出了一种突破性的编程技术，即遗传算法（GA），他在他的书“Adaptation in Natural and Artificial Systems”（Holland 1991）中对此进行了总结。在接下来的十年里，他通过创建代表任何计算机程序结构的遗传密码来扩展算法的范围。 此外，他还开发了一个预测下一代质量的框架，称为霍兰德模式定理。柯克帕特里克等人（1983）提出了模拟退火算法（SA），它是一种基于单点的冶金退火过程的算法。格洛弗（1989）正式的禁忌搜索计算机为基础的优化方法。这是基于局部搜索，它有很高的概率陷入局部最优。Reynolds（1987）开发了另一个有趣的人工生命程序，称为boid，它模拟鸟类的群集行为。它用于可视化信息和优化任务。Moscato等人（1989）在他的技术报告中引入了一种模因算法，其灵感来自达尔文的自然进化原理和道金斯的模因概念。模因算法是传统遗传算法的一种扩展。它被用作局部搜索技术，以减少过早收敛的可能性。 另一种早期的自然启发算法是由Bishop和Torr（1992）在1989年开发的，后来被称为随机扩散搜索（SDS）。Kennedy和Eberhart（1995）开发了粒子群优化（PSO），最初用于模拟社会行为。这是最简单和最广泛使用的算法之一。在接下来的两年里，一个值得注意的和有争议的工作，没有免费的午餐定理（NFL）的优化，介绍和证明明确的Wolpert和Macready（1997）。虽然一些研究人员认为NFL有一些重要的见解，但其他人认为NFL与机器学习研究几乎没有关联。但最重要的是，NFL为进一步研究开发新的特定领域算法提供了一个黄金机会。NFL对于更高维度的有效性仍在调查中。 后来，几种有效的算法已经被开发出来，例如Storn和Price（1997）的差分进化（DE），Dorigo等人（2006）的蚁群优化（ACO），Karaboga和Basturk（2007）的人工蜂群（ABC），以及其他算法，如下节所示。

3 Metaheuristics 

        It is difficult to summarize all existing MAs and other valuable data in a single article. In this section, we collect as many existing MAs as possible. Here about 540 existing MAs are complied. It enables us to comprehend the broader context in order to offer constructive criticism in this area, and this can be used as a toolbox (Table 1).
        很难在一篇文章中总结所有现有的MA和其他有价值的数据。在本节中，我们收集尽可能多的现有MA。在这里，大约有540个现有的管理协定得到遵守。它使我们能够理解更广泛的背景，以便在这一领域提供建设性的批评，这可以作为一个工具箱（表1）。

Table 1 Metaheuristic algorithms (up to 2022)
表1元启发式算法（到2022年）

SN	Algorithm	References
1	Across Neighbourhood Search (ANS)	Wu (2016)
2	Adaptive Social Behavior Optimization (ASBO)	Singh (2013)
3	African Buffalo Optimization (ABO)	Odili et al. (2015)
4	African Vultures Optimization Algorithm (AVOA)	Abdollahzadeh et al. (2021a)
5	African Wild Dog Algorithm (AWDA)	Subramanian et al. (2013)
6	Algorithm of the Innovative Gunner (AIG)	Pijarski and Kacejko (2019)
7	Ali Baba and the Forty Thieves Optimization (AFT)	Braik et al. (2022b)
8	Anarchic Socity Optimization (ASO)	Ahmadi-Javid (2011)
9	Andean Condor Algorithm (ACA)	Almonacid and Soto (2019)
10	Animal Behavior Hunting (ABH)	Naderi et al. (2014)
11	Animal Migration Optimization Algorithm (AMO)	Li et al. (2014)
12	Ant Colony Optimization (ACO)	Dorigo et al. (2006)
13	Ant Lion Optimizer (ALO)	Mirjalili (2015a)
14	Aphid-Ant Mutualism (AAM)	Eslami et al. (2022)
15	Aphids Optimization Algorithm (AOA)	Liu et al. (2022)
16	Archerfish Hunting Optimizer (AHO)	Zitouni et al. (2021)
17	Archery Algorithm (AA)	Zeidabadi et al. (2022)
18	Archimedes Optimization Algorithm (AOA)	Hashim et al. (2021)
19	Arithmetic Optimization Algorithm (AOA)	Abualigah et al. (2021b)
20	Aritificial Algae Algorithm (AAA)	Uymaz et al. (2015)
21	Artificial Atom Algorithm (A3)	Karci (2018)
22	Artificial Bee Colony (ABC)	Karaboga and Basturk (2007)
23	Artificial Beehive Algorithm (ABA)	Munoz et al. (2009)
24	Artificial Butterfly Optimization (ABO)	Qi et al. (2017)
25	Artificial Chemical Process (ACP)	Irizarry (2004)
26	Artificial Chemical Reaction Optimization Algorithm (ACROA)	Alatas (2011)
27	Artificial Cooperative Search (ACS)	Civicioglu (2013a)
28	Artificial Coronary Circulation System (ACCS)	Kaveh and Kooshkebaghi (2019)
29	Artificial Ecosystem Algorithm (AEA)	Adham and Bentley (2014)
30	Artificial Ecosystem-based Optimization (AEO)	Zhao et al. (2020b)
31	Artificial Electric Field Algorithm (AEFA)	Yadav et al. (2019)
32	Artificial Feeding Birds Algorithm (AFB)	Lamy (2019)
33	Artificial Fish Swarm Algorithm (AFSA)	Li (2003)
34	Artificial Flora Optimization Algorithm (AF)	Cheng et al. (2018)
35	Artificial Gorilla Troops Optimizer (GTO)	Abdollahzadeh et al. (2021b)
36	Artificial Hummingbird Algorithm (AHA)	Zhao et al. (2022b)
37	Artificial Infection Disease Optimization (AIO)	Huang (2016)
38	Artificial Jellyfish Search Optimizer (AJSO)	Chou and Truong (2021)
39	Artificial Lizard Search Optimization (ALSO)	Kumar et al. (2021)
40	Artificial Photosynthesis and Phototropism Mechanism (APPM)	Cui and Cai (2011)
41	Artificial Physics Optimization (APO)	Xie et al. (2009)
42	Artificial Plants Optimization Algorithm (APO)	Zhao et al. (2011)
43	Artificial Raindrop Algorithm (ARA)	Jiang et al. (2014)
44	Artificial Reaction Algorithm (ARA)	Melin et al. (2013)
45	Artificial Searching Swarm Algorithm (ASSA)	Chen et al. (2009)
46	Artificial Showering Algorithm (ASA)	Ali et al. (2015)
47	Artificial Swarm Intelligence (ASI)	Rosenberg and Willcox (2018)
48	Artificial Tribe Algorithm (ATA)	Chen et al. (2012)
49	Asexual Reproduction Optimization (ARO)	Farasat et al. (2010)
50	Atmosphere Clouds Model Optimization (ACMO)	Gao-Wei and Zhanju (2012)
51	Atomic Orbital Search (AOS)	Azizi (2021)
52	Backtracking Search Optimization (BSO)	Civicioglu (2013b)
53	Bacterial Chemotaxis Optimization (BCO)	Muller et al. (2002)
54	Bacterial Colony Optimization (BCO)	Niu and Wang (2012)
55	Bacterial Evolutionary Algorithm (BEA)	Numaoka (1996)
56	Bacterial Foraging Optimization Algorithm (BFOA)	Das et al. (2009)
57	Bacterial Swarming Algorithm (BSA)	Tang et al. (2007)
58	Bacterial-GA Foraging (BF)	Chen et al. (2007)
59	Bald Eagle Search (BES)	Alsattar et al. (2020)
60	Bar Systems (BS)	Del Acebo and de-la Rosa (2008)
61	Bat Algorithm (BA)	Yang and He (2013)
62	Bat Inspired Algorithm (BIA)	Yang (2010b)
63	Bat Intelligence (BI)	Malakooti et al. (2012)
64	Battle Royale Optimization (BRO)	Rahkar Farshi (2021)
65	Bean Optimization Algorithm (BOA)	Zhang et al. (2010)
66	Bear Smell Search Algorithm (BSSA)	Ghasemi-Marzbali (2020)
67	Bee Colony Optimization (BCO)	Teodorovic and Dell’Orco (2005)
68	Bee Conoly-Inspired Algorithm (BCIA)	Häckel and Dippold (2009)
69	Bee Swarm Optimization (BSO)	Akbari et al. (2010)
70	Bee System (BS)	Sato and Hagiwara (1998)
71	Bee System.1 (BS.1)	Lucic and Teodorovic (2002)
72	BeeHive (BH)	Wedde et al. (2004)
73	Bees Algorithm (BA)	Pham et al. (2006)
74	Bees Life Algorithm (BLA)	Bitam et al. (2018)
75	Beetle Swarm Optimization Algorithm (BSOA)	Wang and Yang (2018)
76	Beluga Whale Optimization (BWO)	Zhong et al. (2022)
77	Big Bang-Big Crunch (BBBC)	Erol and Eksin (2006)
78	Billiards-Inspired Optimization Algorithm (BOA)	Kaveh et al. (2020b)
79	Binary Slime Mould Algorithm (BSMA)	Abdel-Basset et al. (2021)
80	Binary Whale Optimization Algorithm (bWOA)	Reddy K et al. (2019)
81	Biogeography-Based Optimization(BBO)	Simon (2008)
82	Biology Migration Algorithm (BMA)	Zhang et al. (2019)
83	Bioluminiscent Swarm Optimization (BSO)	de Oliveira et al. (2011)
84	Biomimicry of Social Foraging Bactera for Distributed (BSFBD)	Passino (2002)
85	Bird Mating Optimization (BMO)	Askarzadeh (2014)
86	Bird Swarm Algorithm (BSA)	Meng et al. (2016)
87	Bison Behavior Algorithm (BBA)	Kazikova et al. (2017)
88	Black Hole Algorithm (BH.1)	Hatamlou (2013)
89	Black Hole Mechanics Optimization (BHMO)	Kaveh et al. (2020c)
90	Blind, Naked Mol-Rats Algorithm (BNMR)	Taherdangkoo et al. (2013)
91	Blue Monkey Algorithm (BM)	Mahmood and Al-Khateeb (2019)
92	Boids	Reynolds (1987)
93	Bonobo Optimizer (BO)	Das and Pratihar (2019)
94	Brain Storm Optimization (BSO)	Shi (2011)
95	Bull Optimization Algorithm (BOA)	FINDIK (2015)
96	Bumble Bees Mating Optimization (BBMO)	Marinakis et al. (2010)
97	Bus Transport Algorithm (BTA)	Bodaghi and Samieefar (2019)
98	Butterfly Optimization Algorithm (BOA)	Arora and Singh (2019)
99	Butterfly Optimizer(BO)	Kumar et al. (2015)
100	Buzzards Optimization Algorithm (BOA)	Arshaghi et al. (2019)
101	Camel Algorithm (CA)	Ibrahim and Ali (2016)
102	Camel Herd Algorithm (CHA)	Al-Obaidi et al. (2017)
103	Capuchin Search Algorithm (CapSA)	Braik et al. (2021)
104	Car Tracking Optimization Algorithm (CTOA)	Chen et al. (2018)
105	Cat Swarm Optimization (CSO)	Chu et al. (2006)
106	Catfish Particle Swarm Optimization (CatfishPSO)	Chuang et al. (2008)
107	Central Force Optimizartion (CFO)	Formato (2008)
108	Chaos Game Optimization (CGO)	Talatahari and Azizi (2021)
109	Chaos Optimization Alfgorithm (COA)	JIANG (1998)
110	Chaotic Dragonfly Algorithm (CDA)	Sayed et al. (2019b)
111	Charged System Search (CSS)	Kaveh and Talatahari (2010)
112	Cheetah Based Algorithm (CBA)	Klein et al. (2018)
113	Cheetah Chase Algorithm (CCA)	Goudhaman (2018)
114	Cheetah Optimizer (CO)	Akbari et al. (2022)
115	Chef-Based Optimization Algorithm (CBOA)	Trojovská and Dehghani (2022)
116	Chemical Reaction Optimization (CRO)	Alatas (2011)
117	Chicken Swarm Optimization (CSO)	Meng et al. (2014)
118	Child Drawing Development Optimization (CDDO)	Abdulhameed and Rashid (2022)
119	Chimp Optimization Algorithm (ChOA)	Khishe and Mosavi (2020)
120	Circle Search Algorithm (CSA)	Qais et al. (2022)
121	Circular Structures of Puffer Fish Algorithm (CSPF)	Catalbas and Gulten (2018)
122	Circulatory System-based Optimization (CSBO)	Ghasemi et al. (2022)
123	City Councils Evolution (CCE)	Pira (2022)
124	Clonal Selection Algorithm (CSA)	De Castro and Von Zuben (2000)
125	Cloud Model-Based Differential Evolution Algorithm (CMDE)	Zhu and Ni (2012)
126	Cockroach Swarm Optimization (CSO)	ZhaoHui and HaiYan (2010)
127	Cognitive Behavior Optimization Algorithm (COA)	Li et al. (2016b)
128	Collective Animal Behavior (CAB)	Cuevas et al. (2012a)
129	Collective Decision Optimization Algorithm (CDOA)	Zhang et al. (2017b)
130	Colliding Bodies Optimization (CBO)	Kaveh and Mahdavi (2014)
131	Color Harmony Algorithm (CHA)	Zaeimi and Ghoddosian (2020)
132	Community of Scientist Optimization (CoSO)	Milani and Santucci (2012)
133	Competitive Learning Algorithm (CLA)	Afroughinia and Kardehi M (2018)
134	Competitive Optimization Algorithm (COOA)	Sharafi et al. (2016)
135	Consultant Guide Search (CGS)	Wu and Banzhaf (2010)
136	Co-Operation of Biology Related Algorithm (COBRA)	Akhmedova and Semenkin (2013)
137	Coral Reefs Optimization (CRO)	Salcedo-Sanz et al. (2014)
138	Corona Virus Optimization (CVO)	Salehan and Deldari (2022)
139	Coronavirus Herd Immunity Optimizer (CHIO)	Al-Betar et al. (2021)
140	Coronavirus Optimization Algorithm (COVIDOA)	Khalid et al. (2022)
141	Covariance Matrix Adaptation-Evolution Strategy (CMAES)	Hansen et al. (2003)
142	Coyote Optimization Algorithm (COA)	Pierezan and Coelho (2018)
143	Cricket Algorithm (CA)	Canayaz and Karcı (2015)
144	Cricket Behaviour-Based Algorithm (CBA)	Canayaz and Karci (2016)
145	Cricket Chirping Algorithm (CCA)	Deuri and Sathya (2018)
146	Crow Search Algorithm (CSA)	Askarzadeh (2016)
147	Crystal Energy Optimization Algorithm (CEO)	Feng et al. (2016)
148	Crystal Structure Algorithm (CryStAl)	Talatahari et al. (2021b)
149	Cuckoo Optimization Algorithm (COA)	Rajabioun (2011)
150	Cuckoo Search (CS)	Yang and Deb (2009)
151	Cultural Algorithm (CA)	Jin and Reynolds (1999)
152	Cultural Coyote Optimization Algorithm (CCOA)	Pierezan et al. (2019)
153	Cuttlefish Algorithm (CA)	Eesa et al. (2013)
154	Cyclical Parthenogenesis Algorithm (CPA)	Kaveh and Zolghadr (2017)
155	Dandelion Optimizer (DO)	Zhao et al. (2022a)
156	Deer Hunting Optimization Algorithm (DHOA)	Brammya et al. (2019)
157	Dendritic Cells Algorithm (DCA)	Greensmith et al. (2005)
158	Deterministic Oscillatory Search (DOS)	Archana et al. (2017)
159	Dialectic Search (DS)	Kadioglu and Sellmann (2009)
160	Differential Evolution (DE)	Storn and Price (1997)
161	Differential Search Algorithm (DSA)	Civicioglu (2012)
162	Dolphin Echolocation (DE)	Kaveh and Farhoudi (2013)
163	Dolphin Partner Optimization (DPO)	Shiqin et al. (2009)
164	Dragonfly Algorithm (DA)	Mirjalili (2016a)
165	Driving Training-Based Optimization (DTBO)	Dehghani et al. (2022b)
166	Duelist Algorithm (DA)	Biyanto et al. (2016)
167	Dynamic Differential Annealed Optimization (DDAO)	Ghafil and Jármai (2020)
168	Dynastic Optimization Algorithm (DOA)	Wagan et al. (2020)
169	Eagle Strategy (ES)	Yang and Deb (2010)
170	Earthwarm Optimization Algorithm (EOA)	Wang et al. (2018a)
171	Ebola Optimization Search Algorithm (EOSA)	Oyelade and Ezugwu (2021)
172	Ecogeography-Based Optimization (EBO)	Zheng et al. (2014)
173	Eco-inspired Evolutionary Algorithm (EEA)	Parpinelli and Lopes (2011)
174	Egyptian Vulture Optimization (EV)	Sur et al. (2013)
175	Election-Based Optimization Algorithm (EBOA)	Trojovskỳ and Dehghani (2022a)
176	Electromagnetic Field Optimization (EFO)	Abedinpourshotorban et al. (2016)
177	Electro-Magnetism Optimization (EMO)	Cuevas et al. (2012b)
178	Electromagnetism-Like Mechanism Optimization (EMO)	Birbil and Fang (2003)
179	Electron Radar Search Algorithm (ERSA)	Rahmanzadeh and Pishvaee (2020)
180	Elephant Clan Optimization (ECO)	Jafari et al. (2021)
181	Elephant Herding Optimization (EHO)	Wang et al. (2015)
182	Elephant Search Algorithm (ESA)	Deb et al. (2015)
183	Elephant Swarm Water Search Algorithm (ESWSA)	Mandal (2018)
184	Emperor Penguin Optimizer (EPO)	Dhiman and Kumar (2018)
185	Emperor Penguins Colony (EPC)	Harifi et al. (2019)
186	Escaping Bird Search (EBS)	Shahrouzi and Kaveh (2022)
187	Eurasian Oystercatcher Optimiser (EOO)	Salim et al. (2022)
188	Evolution Strategies (ES)	Beyer and Schwefel (2002)
189	Exchange Market Algorithm (EMA)	Ghorbani et al. (2017)
190	Extremal Optimization (EO)	Boettcher and Percus (1999)
191	Farmland Fertility Algorithm (FFA)	Shayanfar and Gharehchopogh (2018)
192	Fast Bacterial Swarming Algorithm (FBSA)	Chu et al. (2008)
193	Fertilization Optimization Algorithm (FOA)	Ghafil et al. (2022)
194	Fibonacci Indicator Algorithm (FIA)	Etminaniesfahani et al. (2018)
195	FIFA Word Cup Competitions (FIFA)	Razmjooy et al. (2016)
196	Find-Fix-Finish-Exploit-Analyze Algorithm (F3EA)	Kashan et al. (2019)
197	Fire Hawk Optimizer (FHO)	Azizi et al. (2022)
198	Firefly Algorithm (FA)	Yang (2009)
199	Fireworks Algorithm (FA)	Tan and Zhu (2010)
200	Fireworks Optimization Algorithm (FOA)	Ehsaeyan and Zolghadrasli (2022)
201	Fish School Search (FSS)	Bastos Filho et al. (2008)
202	Fish Swarm Algorithm (FSA)	Tsai and Lin (2011)
203	Fitness Dependent Optimizer (FDO)	Abdullah and Ahmed (2019)
204	Flock by Leader (FL)	Bellaachia and Bari (2012)
205	Flocking Based Algorithm (FA)	Cui et al. (2006)
206	Flow Direction Algorithm (FDA)	Karami et al. (2021)
207	Flow Regime Algorithm (FRA)	Tahani and Babayan (2019)
208	Flower Pollination Algorithm (FPA)	Yang (2012)
209	Flying Elephant Algorithm (FEA)	Xavier and Xavier (2016)
210	Football Game Algorithm (FGA)	Fadakar and Ebrahimi (2016)
211	Forensic Based Investigation (FBI)	Chou and Nguyen (2020)
212	Forest Optimization Algorithm (FOA)	Ghaemi and Feizi-Derakhshi (2014)
213	Fox Optimizer (FOX)	Mohammed and Rashid (2022)
214	Fractal-Based Algorithm (FA)	Kaedi (2017)
215	Frog Call Inspired Algorithm (FCA)	Mutazono et al. (2009)
216	Fruit Fly Optimization Algorithm (FOA)	Pan (2012)
217	Gaining Sharing Knowledge Based Algorithm (GSK)	Mohamed et al. (2020)
218	Galactic Swarm Optimization (GSO)	Muthiah-Nakarajan and Noel (2016)
219	Galaxy Based Search Algorithm (GBS)	Shah-Hosseini (2011)
220	Gannet Optimization Algorithm (GOA)	Pan et al. (2022)
221	Gases Brownian Motion Optimization (GBMO)	Abdechiri et al. (2013)
222	Gene Expression (GE)	Ferreira (2002)
223	Genetic Algorithm (GA)	Holland (1991)
224	Genetic Programming (GP)	Koza et al. (1994)
225	Geometric Octal Zones Distance Estimation Algorithm (GOZDE)	Kuyu and Vatansever (2022)
226	Giza Pyramids Construction Algorithm (GPC)	Harifi et al. (2020)
227	Global Neighborhood Algorithm (GNA)	Alazzam and Lewis (2013)
228	Glowworm Swarm Optimization (GSO)	Zhou et al. (2014)
229	Golden Ball Algorithm (GB)	Osaba et al. (2014)
230	Golden Eagle Optimizer (GEO)	Mohammadi-Balani et al. (2021)
231	Golden Jackal Optimization (GJO)	Chopra and Ansari (2022)
232	Golden Search Optimization Algorithm (GSO)	Noroozi et al. (2022)
233	Golden Sine Algorithm (Gold-SA)	Tanyildizi and Demir (2017)
234	Good Lattice Swarm Optimization (GLSO)	Su et al. (2007)
235	Goose Team Optimizer (GTO)	Wang and Wang (2008)
236	Gradient Evolution Algorithm (GE)	Kuo and Zulvia (2015)
237	Gradient-Based Optimizer (GBO)	Ahmadianfar et al. (2020)
238	Grasshoper Optimization Algorithm (GOA)	Saremi et al. (2017)
239	Gravitational Clustering Algorithm (GCA)	Kundu (1999)
240	Gravitational Emulation Local Search (GELS)	Barzegar et al. (2009)
241	Gravitational Field Algorithm (GFA)	Zheng et al. (2010)
242	Gravitational Interactions Optimization (GIO)	Flores et al. (2011)
243	Gravitational Search Algorithm (GSA)	Rashedi et al. (2009)
244	Great Deluge Algorithm (GDA)	Dueck (1993)
245	Greedy Politics Optimization (GPO)	Melvix (2014)
246	Grenade Explosion Method (GEM)	Ahrari and Atai (2010)
247	Grey Wolf Optimizer (GWO)	Mirjalili et al. (2014)
248	Group Counseling Optimization (GCO)	Eita and Fahmy (2014)
249	Group Escape Behavior (GEB)	Min and Wang (2011)
250	Group Leaders Optimization Algorithm (GIOA)	Daskin and Kais (2011)
251	Group Mean-Based Optimizer (GMBO)	Dehghani et al. (2021)
252	Group Search Optimizer (GSO)	He et al. (2009)
253	Group Teaching Optimization Algorithm (GTOA)	Zhang and Jin (2020)
254	Harmony Element Algorithm (HEA)	Cui et al. (2008)
255	Harmony Search (HS)	Lee and Geem (2005)
256	Harris Hawks Optimizer (HHO)	Heidari et al. (2019)
257	Heart Optimization (HO)	Hatamlou (2014)
258	Heat Transfer Optimization Aalgorithm (HTOA)	Asef et al. (2021)
259	Heat Transfer Search Agorithm (HTS)	Patel and Savsani (2015)
260	Henry Gas Solubility Optimization (HGSO)	Hashim et al. (2019)
261	Hirerarchical Swarm Model (HSM)	Chen et al. (2010)
262	Honey Badger Algorithm (HBA)	Hashim et al. (2022)
263	Honeybee Social Foraging (HSF)	Quijano and Passino (2007)
264	Honeybees Mating Optimization Algorithm (HMOA)	Haddad et al. (2006)
265	Hoopoe Heuristic (HH)	El-Dosuky et al. (2012)
266	Human Evolutionary Model (HEM)	Montiel et al. (2007)
267	Human Felicity Algorithm (HFA)	Veysari et al. (2022)
268	Human Group Formation (HGF)	Thammano and Moolwong (2010)
269	Human Mental Search (HMS)	Mousavirad and Ebrahimpour (2017)
270	Human-Inspired algorithm (HIA)	Zhang et al. (2009)
271	Hunting Search (HuS)	Oftadeh et al. (2010)
272	Hurricane Based Optimization Algorithm (HOA)	Rbouh and El Imrani (2014)
273	Hydrological Cycle Algorithm (HCA)	Wedyan et al. (2017)
274	Hysteresis for Optimization (HO)	Zarand et al. (2002)
275	Ideology Algorithm (IA)	Huan et al. (2017)
276	Imperialist Competitive Algorithm (ICA)	Atashpaz-Gargari and Lucas (2007)
277	Improve Genetic Immune Algorithm (IGIA)	Tayeb et al. (2017)
278	Integrated Radiation Optimization (IRO)	Chuang and Jiang (2007)
279	Intelligent Ice Fishing Algorithm (IIFA)	Karpenko and Kuzmina (2021)
280	Intelligent Water Drop Algorithm (IWD)	Shah-Hosseini (2009)
281	Interactive Autodidactic School Algorithm (IAS)	Jahangiri et al. (2020)
282	Interior Search Algorithm (ISA)	Gandomi (2014)
283	Invasive Tumor Growth Optimization (ITGO)	Tang et al. (2015)
284	Invasive Weed Optimization Algorithm (IWO)	Karimkashi and Kishk (2010)
285	Ions Motion Optimization (IMO)	Javidy et al. (2015)
286	Jaguar Algorithm (JA)	Chen et al. (2015)
287	Japanese Tree Frogs Calling Algorithm (JTFCA)	Hernández and Blum (2012)
288	Jaya Algorithm (JA)	Rao (2016)
289	Kaizen Programming (KP)	De Melo (2014)
290	Kernel Search Optimization (KSO)	Dong and Wang (2020)
291	Keshtel Algorithm (KA)	Hajiaghaei and Aminnayeri (2014)
292	Killer Whale Algorithm (KWA)	Biyanto et al. (2017)
293	Kinetic Gas Molecules Optimization (KGMO)	Moein and Logeswaran (2014)
294	Komodo Mlipir Algorithm (KMA)	Suyanto et al. (2021)
295	Kril Herd (KH)	Gandomi and Alavi (2012)
296	Lambda Algorithm (LA)	Cui et al. (2010)
297	Laying Chicken Algorithm (LCA)	Hosseini (2017)
298	Leaders and Followers Algorithm (LFA)	Gonzalez-Fernandez and Chen (2015)
299	League Championship Algorithm (LCA)	Kashan (2014)
300	Lévy Flight Distribution (LFD)	Houssein et al. (2020)
301	Light Ray Optimization (LRO)	Shen and Li (2010)
302	Lightning Attachment Procedure Optimization (LAPO)	Nematollahi et al. (2017)
303	Lightning Search Algorithm (LSA)	Shareef et al. (2015)
304	Linear Prediction Evolution Algorithm (LPE)	Gao et al. (2021a)
305	Lion Algorithm (LA)	Rajakumar (2012)
306	Lion Optimization Algorithm (LOA)	Yazdani and Jolai (2016)
307	Locust Search (LS)	Cuevas et al. (2015)
308	Locust Swarm Optimization (LSO)	Chen (2009)
309	Ludo Game-Based Swarm Intelligence Algorithm (LGSI)	Singh et al. (2019)
310	Magnetic Charged System Search (MCSS)	Kaveh et al. (2013)
311	Magnetic Optimization Algorithm (MFO)	Tayarani-N and Akbarzadeh-T (2008)
312	Magnetotactic Bacteria Optimization Algorithm (MBOA)	Mo and Xu (2013)
313	Marine Predator Algorithm (MPA)	Faramarzi et al. (2020)
314	Marriage in Honey Bees Optimization (MHBO)	Abbass (2001)
315	Material Generation Algorithm (MGA)	Talatahari et al. (2021a)
316	Mean Euclidian Distance Threshold (MEDT)	Kaveh et al. (2022)
317	Meerkats Inspired Algorithm (MIA)	Klein and dos Santos Coelho (2018)
318	Melody Search (MS)	Ashrafi and Dariane (2011)
319	Membrane Algorithm (MA)	Nishida (2006)
320	Memetic Algorithm (MA)	Moscato et al. (1989)
321	Method of Musical Composition (MMC)	Mora-Gutiérrez et al. (2014)
322	Migrating Birds Optimization (MBO)	Duman et al. (2012)
323	Mine Blast Algorithm (MBA)	Sadollah et al. (2013)
324	MOEA/D	Zhang and Li (2007)
325	Momentum Search Algorithm (MSA)	Dehghani and Samet (2020)
326	Monarch Butterfly Optimization (MBO)	Feng et al. (2017)
327	Monkey Search (MS)	Mucherino and Seref (2007)
328	Mosquito Flying Optimization (MFO)	Alauddin (2016)
329	Moth Flame Optimization Algorithm (MFO)	Mirjalili (2015b)
330	Moth Search Algorithm (MSA)	Wang (2018)
331	Mouth Breeding Fish Algorithm (MBF)	Jahani and Chizari (2018)
332	Mox Optimization Algorithm (MOX)	Arif et al. (2011)
333	Multi-Objective Beetle Antennae Search (MOBAS)	Zhang et al. (2021)
334	Multi-Objective Trader algorithm (MOTR)	Masoudi-Sobhanzadeh et al. (2021)
335	Multi-Particle Collision Algorithm (M-PCA)	da Luz et al. (2008)
336	Multivariable Grey Prediction Model Algorithm (MGPEA)	Xu et al. (2020)
337	Multi-Verse Optimizer (MVO)	Mirjalili et al. (2016)
338	Naked Moled Rat (NMR)	Salgotra and Singh (2019)
339	Namib Beetle Optimization (NBO)	Chahardoli et al. (2022)
340	Natural Aggregation Algorithm (NAA)	Luo et al. (2016)
341	Natural Forest Regeneration Algorithm (NFR)	Moez et al. (2016)
342	Neuronal Communication Algorithm (NCA)	A Gharebaghi and Ardalan A (2017)
343	New Caledonian Crow Learning Algorithm (NCCLA)	Al-Sorori and Mohsen (2020)
344	Newton Metaheuristic Algorithm (NMA)	Gholizadeh et al. (