An Overview of Metaheuristic and Hyper-Heuristic Algorithms

Authors

  • Loghman Rashidi * Department of Computer Engineering, Imam Reza International University, Mashhad, Iran.

https://doi.org/10.48313/maa.v2i2.45

Abstract

A group of algorithms used to solve NP-hard problems is called metaheuristic and hyper-heuristic algorithms. Problems that have a large number of answers and it takes a long time to find the best one is called NP-hard. The use of metaheuristic & hyper-heuristic algorithms in solving difficult problems results in acceptable answers in a short time. These methods fall into the category of optimization algorithms. In optimization algorithms, problems that do not have a definite solution reach an optimal answer in a very short time. Various algorithms have been introduced so far that stem from the intelligence of the events around us. Each of these methods has been used to solve complex problems that have not received an acceptable response by heuristic algorithms. According to National Football League  (NFL) theory, none of the algorithms can solve all the problems. Each of these algorithms achieves more optimal answers to specific problems than the other algorithms. For this reason, efforts to design new methods continue to address a broader range of issues. This article examines new metaheuristic algorithms and their classification. Many metaheuristic algorithms have been introduced today, each of which has the potential to achieve an optimal solution to specific problems. This potential, along with new techniques and Machine Learning (ML), has led to the production of a new generation of these algorithms, known as hyper-heuristic algorithms. These types of algorithms try to produce hybrid algorithms to solve more problems with one algorithm.

Keywords:

NP-hard, Metaheuristic algorithms, Hyper-heuristic algorithms, Machine learning, Optimization

References

  1. [1] Martí, R., & Reinelt, G. (2022). Exact and heuristic methods in combinatorial optimization. Springer Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-64877-3
  2. [2] Neumann, F., & Witt, C. (2010). Combinatorial optimization and computational complexity. In Bioinspired computation in combinatorial optimization: Algorithms and their computational complexity (pp. 9-19). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-16544-3_2
  3. [3] Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019). A survey on new generation metaheuristic algorithms. Computers & industrial engineering, 137, 106040. https://doi.org/10.1016/j.cie.2019.106040
  4. [4] Boussaïd, I., Lepagnot, J., & Siarry, P. (2013). A survey on optimization metaheuristics. Information sciences, 237, 82-117. https://doi.org/10.1016/j.ins.2013.02.041
  5. [5] Wu, G., Mallipeddi, R., & Suganthan, P. N. (2019). Ensemble strategies for population-based optimization algorithms–A survey. Swarm and evolutionary computation, 44, 695-711. https://doi.org/10.1016/j.swevo.2018.08.015
  6. [6] Chugh, T., Sindhya, K., Hakanen, J., & Miettinen, K. (2019). A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms. Soft computing, 23(9), 3137-3166. https://doi.org/10.1007/s00500-017-2965-0
  7. [7] Mahdavi, S., Shiri, M. E., & Rahnamayan, S. (2015). Metaheuristics in large-scale global continues optimization: A survey. Information sciences, 295, 407-428. https://doi.org/10.1016/j.ins.2014.10.042
  8. [8] Askarzadeh, A. (2016). A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm. Computers & structures, 169, 1-12. https://doi.org/10.1016/j.compstruc.2016.03.001
  9. [9] Birattari, M., Paquete, L., Stützle, T., & Varrentrapp, K. (2001). Classification of metaheuristics and design of experiments for the analysis of components. https://eden.dei.uc.pt/~paquete/papers/AIDA-01-05.pdf
  10. [10] Shukla, A. K., Tripathi, D., Reddy, B. R., & Chandramohan, D. (2020). A study on metaheuristics approaches for gene selection in microarray data: Algorithms, applications and open challenges. Evolutionary intelligence, 13(3), 309–329. https://doi.org/10.1007/s12065-019-00306-6
  11. [11] Gomes, W. J., Beck, A. T., Lopez, R. H., & Miguel, L. F. (2018). A probabilistic metric for comparing metaheuristic optimization algorithms. Structural safety, 70, 59-70. https://doi.org/10.1016/j.strusafe.2017.10.006
  12. [12] Kazemzadeh Azad, S. (2018). Seeding the initial population with feasible solutions in metaheuristic optimization of steel trusses. Engineering optimization, 50(1), 89-105. https://doi.org/10.1080/0305215X.2017.1284833
  13. [13] Mousavirad, S. J., & Ebrahimpour-Komleh, H. (2017). Multilevel image thresholding using entropy of histogram and recently developed population-based metaheuristic algorithms. Evolutionary intelligence, 10(1), 45-75. https://doi.org/10.1007/s12065-017-0152-y
  14. [14] Talbi, E. G. (2009). Metaheuristics: From design to implementation. John Wiley & Sons. https://zeus.inf.ucv.cl/~bcrawford/DiplomadoIA_2021/Cap1_Metaheuristics_Talbi.pdf
  15. [15] Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014). Grey Wolf optimizer. Advances in engineering software, 69, 46–61. https://doi.org/10.1016/j.advengsoft.2013.12.007
  16. [16] Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM computing surveys (CSUR), 35(3), 268–308. https://doi.org/10.1145/937503.937505
  17. [17] Osman, I. H., & Laporte, G. (1996). Metaheuristics: A bibliography. Annals of operations research, 63(5), 511–623. https://doi.org/10.1007/BF02125421
  18. [18] Premaratne, U., Samarabandu, J., & Sidhu, T. (2009). A new biologically inspired optimization algorithm. 2009 international conference on industrial and information systems (ICIIS) (pp. 279-284). IEEE. https://doi.org/10.1109/ICIINFS.2009.5429852
  19. [19] Kaveh, A., & Khayatazad, M. (2012). A new meta-heuristic method: Ray optimization. Computers & structures, 112, 283–294. https://doi.org/10.1016/j.compstruc.2012.09.003
  20. [20] Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A new heuristic optimization algorithm: Harmony search. Simulation, 76(2), 60–68. https://doi.org/10.1177/003754970107600201
  21. [21] Gandomi, A. H., & Alavi, A. H. (2012). Krill herd: A new bio-inspired optimization algorithm. Communications in nonlinear science and numerical simulation, 17(12), 4831–4845. https://doi.org/10.1016/j.cnsns.2012.05.010
  22. [22] Qais, M. H., Hasanien, H. M., & Alghuwainem, S. (2020). Whale optimization algorithm-based Sugeno fuzzy logic controller for fault ride-through improvement of grid-connected variable speed wind generators. Engineering applications of artificial intelligence, 87, 103328. https://doi.org/10.1016/j.engappai.2019.103328
  23. [23] Prabhakar, S. K., Rajaguru, H., & Lee, S. W. (2019). Metaheuristic-based dimensionality reduction and classification analysis of PPG signals for interpreting cardiovascular disease. IEEE access, 7, 165181-165206. https://scispace.com/pdf/metaheuristic-based-dimensionality-reduction-and-2ey5x77lb6.pdf
  24. [24] Pilla, R., Azar, A. T., & Gorripotu, T. S. (2019). Impact of flexible AC transmission system devices on automatic generation control with a metaheuristic based fuzzy PID controller. Energies, 12(21), 4193. https://doi.org/10.3390/en12214193
  25. [25] Bissoli, D. C., Zufferey, N., & Amaral, A. R. S. (2021). Lexicographic optimization-based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem. International transactions in operational research, 28(5), 2733–2758. https://doi.org/10.1111/itor.12745
  26. [26] Reda, H. T., Mahmood, A., Diro, A., Chilamkurti, N., & Kallam, S. (2020). Firefly-inspired stochastic resonance for spectrum sensing in CR-based IoT communications. Neural computing and applications, 32(20), 16011–16023. https://doi.org/10.1007/s00521-019-04584-0
  27. [27] Yang, X. S. (2010). Engineering optimization: An introduction with metaheuristic applications. John Wiley & Sons. https://doi.org/10.1080/00107514.2012.661773
  28. [28] Essaid, M., Idoumghar, L., Lepagnot, J., & Brévilliers, M. (2019). GPU parallelization strategies for metaheuristics: A survey. International journal of parallel, emergent and distributed systems, 34(5), 497-522. https://doi.org/10.1080/17445760.2018.1428969
  29. [29] Zhang, J., Xiao, M., Gao, L., & Pan, Q. (2018). Queuing search algorithm: A novel metaheuristic algorithm for solving engineering optimization problems. Applied mathematical modelling, 63, 464–490. https://doi.org/10.1016/j.apm.2018.06.036
  30. [30] Fathollahi-Fard, A. M., Hajiaghaei-Keshteli, M., & Tavakkoli-Moghaddam, R. (2018). The social engineering optimizer (SEO). Engineering applications of artificial intelligence, 72, 267-293. https://doi.org/10.1016/j.engappai.2018.04.009
  31. [31] Wolpert, D. H., & Macready, W. G. (2002). No free lunch theorems for optimization. IEEE transactions on evolutionary computation, 1(1), 67–82. https://doi.org/10.1109/4235.585893
  32. [32] Alimoradi, M., Azgomi, H., & Asghari, A. (2022). Trees social relations optimization algorithm: A new Swarm-based metaheuristic technique to solve continuous and discrete optimization problems. Mathematics and computers in simulation, 194, 629–664. https://doi.org/10.1016/j.matcom.2021.12.010
  33. [33] Gomes, W. J., Beck, A. T., & Haukaas, T. (2013). Optimal inspection planning for onshore pipelines subject to external corrosion. Reliability engineering & system safety, 118, 18-27. https://doi.org/10.1016/j.ress.2013.04.011
  34. [34] Pellerin, R., Perrier, N., & Berthaut, F. (2020). A survey of hybrid metaheuristics for the resource-constrained project scheduling problem. European journal of operational research, 280(2), 395-416. https://doi.org/10.1016/j.ejor.2019.01.063
  35. [35] Peres, W., Júnior, I. C. S., & Passos Filho, J. A. (2018). Gradient based hybrid metaheuristics for robust tuning of power system stabilizers. International journal of electrical power & energy systems, 95, 47–72. https://doi.org/10.1016/j.ijepes.2017.08.014
  36. [36] Silva, M. A. L., de Souza, S. R., Souza, M. J. F., & de Franca Filho, M. F. (2018). Hybrid metaheuristics and multi-agent systems for solving optimization problems: A review of frameworks and a comparative analysis. Applied soft computing, 71, 433–459. https://doi.org/10.1016/j.asoc.2018.06.050
  37. [37] Holland, J. H. (1992). Genetic algorithms. Scientific american, 267(1), 66-73. https://www.jstor.org/stable/24939139
  38. [38] Koza, J. (1992). On the programming of computers by means of natural selection. In Genetic programming (pp. 1-35). MIT Press. https://cir.nii.ac.jp/crid/1573105975012577408
  39. [39] Simon, D. (2009). Biogeography-based optimization. Evolutionary computation, ieee transactions on, 12, 702–713. https://doi.org/10.1109/TEVC.2008.919004
  40. [40] Mezura-Montes, E., & Coello, C. A. C. (2005). Useful infeasible solutions in engineering optimization with evolutionary algorithms. Mexican international conference on artificial intelligence (pp. 652-662). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11579427_66
  41. [41] De Castro, L. N., & Timmis, J. (2002). Artificial immune systems: A new computational intelligence approach. Springer Science & Business Media. https://kar.kent.ac.uk/13726/
  42. [42] Mehrabian, A. R., & Lucas, C. (2006). A novel numerical optimization algorithm inspired from weed colonization. Ecological informatics, 1(4), 355–366. https://doi.org/10.1016/j.ecoinf.2006.07.003
  43. [43] Murase, H. (2000). Finite element inverse analysis using a photosynthetic algorithm. Computers and electronics in agriculture, 29(1–2), 115–123. https://doi.org/10.1016/S0168-1699(00)00139-3
  44. [44] Karci, A., & Alatas, B. (2006). Thinking capability of saplings growing up algorithm. International conference on intelligent data engineering and automated learning (pp. 386-393). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11875581_47
  45. [45] Zhou, Y., Wang, Y., Chen, X., Zhang, L., & Wu, K. (2017). A novel path planning algorithm based on plant growth mechanism. Soft computing, 21(2), 435–445. https://doi.org/10.1007/s00500-016-2045-x
  46. [46] Labbi, Y., Attous, D. B., Gabbar, H. A., Mahdad, B., & Zidan, A. (2016). A new rooted tree optimization algorithm for economic dispatch with valve-point effect. International journal of electrical power & energy systems, 79, 298-311. https://doi.org/10.1016/j.ijepes.2016.01.028
  47. [47] Merrikh-Bayat, F. (2015). The runner-root algorithm: A metaheuristic for solving unimodal and multimodal optimization problems inspired by runners and roots of plants in nature. Applied soft computing, 33, 292-303. https://doi.org/10.1016/j.asoc.2015.04.048
  48. [48] Kirkpatrick, S. (1983). Improvement of reliabilities of regulations using a hierarchical structure in a genetic network. Science, 220, 671-680. https://www.science.org/doi/abs/10.1126/science.220.4598.671
  49. [49] Černý, V. (1985). Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of optimization theory and applications, 45(1), 41-51. https://doi.org/10.1007/BF00940812
  50. [50] Erol, O. K., & Eksin, I. (2006). A new optimization method: Big bang–big crunch. Advances in engineering software, 37(2), 106-111. https://doi.org/10.1016/j.advengsoft.2005.04.005
  51. [51] Hatamlou, A. (2013). Black hole: A new heuristic optimization approach for data clustering. Information sciences, 222, 175–184. https://doi.org/10.1016/j.ins.2012.08.023
  52. [52] Alatas, B. (2011). ACROA: Artificial chemical reaction optimization algorithm for global optimization. Expert systems with applications, 38(10), 13170–13180. https://doi.org/10.1016/j.eswa.2011.04.126
  53. [53] Kaveh, A., & Talatahari, S. (2010). A novel heuristic optimization method: Charged system search. Acta mechanica, 213(3), 267–289. https://doi.org/10.1007/s00707-009-0270-4
  54. [54] Rashedi, E., Rashedi, E., & Nezamabadi-pour, H. (2018). A comprehensive survey on gravitational search algorithm. Swarm and evolutionary computation, 41, 141–158. https://doi.org/10.1016/j.swevo.2018.02.018
  55. [55] Shah-Hosseini, H. (2011). Principal components analysis by the galaxy-based search algorithm: A novel metaheuristic for continuous optimisation. International journal of computational science and engineering, 6(1–2), 132–140. https://doi.org/10.1504/IJCSE.2011.041221
  56. [56] Formato, R. (2007). Central force optimization: A new metaheuristic with applications in applied electromagnetics. Progress in electromagnetics research-pier - prog electromagn res, 77, 425–491. https://doi.org/10.2528/PIER07082403
  57. [57] Du, H., Wu, X., & Zhuang, J. (2006). Small-world optimization algorithm for function optimization. International conference on natural computation (pp. 264-273). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11881223_33
  58. [58] Webster, B., & Bernhard, P. J. (2003). A local search optimization algorithm based on natural principles of gravitation. https://repository.fit.edu/ces_faculty/192
  59. [59] Moghaddam, F. F., Moghaddam, R. F., & Cheriet, M. (2012). Curved space optimization: A random search based on general relativity theory. arXiv preprint arXiv:1208.2214. https://doi.org/10.48550/arXiv.1208.2214
  60. [60] Filipović, V., Kartelj, A., & Matić, D. (2013). An electromagnetism metaheuristic for solving the maximum betweenness problem. Applied soft computing, 13(2), 1303–1313. https://doi.org/10.1016/j.asoc.2012.10.015
  61. [61] Atashpaz-Gargari, E., & Lucas, C. (2007). Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. 2007 IEEE congress on evolutionary computation (pp. 4661-4667). IEEE. https://doi.org/10.1109/CEC.2007.4425083
  62. [62] Tan, Y., & Zhu, Y. (2010). Fireworks algorithm for optimization. International conference in swarm intelligence (pp. 355-364). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-13495-1_44
  63. [63] Kashan, A. H. (2011). An efficient algorithm for constrained global optimization and application to mechanical engineering design: League championship algorithm (LCA). Computer-aided design, 43(12), 1769–1792. https://doi.org/10.1016/j.cad.2011.07.003
  64. [64] Glover, F. (1989). Tabu search—part I. ORSA journal on computing, 1(3), 190-206. https://doi.org/10.1287/ijoc.1.3.190
  65. [65] Glover, F. (1990). Tabu search—part II. ORSA journal on computing, 2(1), 4–32. https://doi.org/10.1287/ijoc.2.1.4
  66. [66] Moosavian, N., & Roodsari, B. K. (2014). Soccer league competition algorithm: A novel meta-heuristic algorithm for optimal design of water distribution networks. Swarm and evolutionary computation, 17, 14–24. https://doi.org/10.1016/j.swevo.2014.02.002
  67. [67] Dai, C., Chen, W., Zhu, Y., & Zhang, X. (2009). Seeker optimization algorithm for optimal reactive power dispatch. IEEE transactions on power systems, 24(3), 1218–1231. https://doi.org/10.1109/TPWRS.2009.2021226
  68. [68] Kiziloz, H. E., Deniz, A., Dokeroglu, T., & Cosar, A. (2018). Novel multiobjective TLBO algorithms for the feature subset selection problem. Neurocomputing, 306, 94–107. https://doi.org/10.1016/j.neucom.2018.04.020
  69. [69] Kaveh, A., & Mahdavi, V. R. (2014). Colliding bodies optimization: A novel meta-heuristic method. Computers & structures, 139, 18–27. https://doi.org/10.1016/j.compstruc.2014.04.005
  70. [70] Gandomi, A. H. (2014). Interior search algorithm (ISA): A novel approach for global optimization. ISA transactions, 53(4), 1168–1183. https://doi.org/10.1016/j.isatra.2014.03.018
  71. [71] He, S., Wu, Q. H., & Saunders, J. R. (2009). Group search optimizer: An optimization algorithm inspired by animal searching behavior. IEEE transactions on evolutionary computation, 13(5), 973–990. https://doi.org/10.1109/TEVC.2009.2011992
  72. [72] Ghorbani, N., & Babaei, E. (2014). Exchange market algorithm. Applied soft computing, 19, 177–187. https://doi.org/10.1016/j.asoc.2014.02.006
  73. [73] Sadollah, A., Bahreininejad, A., Eskandar, H., & Hamdi, M. (2013). Mine blast algorithm: A new population based algorithm for solving constrained engineering optimization problems. Applied soft computing, 13(5), 2592–2612. https://doi.org/10.1016/j.asoc.2012.11.026
  74. [74] Ramezani, F., & Lotfi, S. (2013). Social-based algorithm (SBA). Applied soft computing, 13(5), 2837–2856. https://doi.org/10.1016/j.asoc.2012.05.018
  75. [75] Dorigo, M., Birattari, M., & Stutzle, T. (2007). Ant colony optimization. IEEE computational intelligence magazine, 1(4), 28–39. https://doi.org/10.1109/MCI.2006.329691
  76. [76] Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. Proceedings of ICNN'95-international conference on neural networks (Vol. 4, pp. 1942-1948). IEEE. https://doi.org/10.1109/ICNN.1995.488968
  77. [77] Mirjalili, S., & Lewis, A. (2016). The whale optimization algorithm. Advances in engineering software, 95, 51–67. https://doi.org/10.1016/j.advengsoft.2016.01.008
  78. [78] Yang, X. S. (2010). Firefly algorithm, stochastic test functions and design optimisation. International journal of bio-inspired computation, 2(2), 78-84. https://doi.org/10.1504/IJBIC.2010.032124
  79. [79] Zhou, Y., Zhou, Y., Luo, Q., & Abdel-Basset, M. (2017). A simplex method-based social spider optimization algorithm for clustering analysis. Engineering applications of artificial intelligence, 64, 67–82. https://doi.org/10.1016/j.engappai.2017.06.004
  80. [80] Kaveh, A., & Farhoudi, N. (2013). A new optimization method: Dolphin echolocation. Advances in engineering software, 59, 53–70. https://doi.org/10.1016/j.advengsoft.2013.03.004
  81. [81] Abbass, H. A. (2001). MBO: Marriage in honey bees optimization-A haplometrosis polygynous swarming approach. Proceedings of the 2001 congress on evolutionary computation (IEEE Cat. No. 01TH8546) (Vol. 1, pp. 207-214). IEEE. https://doi.org/10.1109/CEC.2001.934391
  82. [82] Pan, W. T. (2012). A new fruit fly optimization algorithm: Taking the financial distress model as an example. Knowledge-based systems, 26, 69-74. https://doi.org/10.1016/j.knosys.2011.07.001
  83. [83] Oftadeh, R., Mahjoob, M. J., & Shariatpanahi, M. (2010). A novel meta-heuristic optimization algorithm inspired by group hunting of animals: Hunting search. Computers & mathematics with applications, 60(7), 2087–2098. https://doi.org/10.1016/j.camwa.2010.07.049
  84. [84] Askarzadeh, A., & Rezazadeh, A. (2013). A new heuristic optimization algorithm for modeling of proton exchange membrane fuel cell: Bird mating optimizer. International journal of energy research, 37(10), 1196–1204. https://doi.org/10.1002/er.2915
  85. [85] Mucherino, A., & Seref, O. (2007). Monkey search: A novel metaheuristic search for global optimization. AIP conference proceedings (Vol. 953, No. 1, pp. 162-173). American Institute of Physics. https://doi.org/10.1063/1.2817338
  86. [86] Yang, X. S. (2010). A new metaheuristic bat-inspired algorithm. In Nature inspired cooperative strategies for optimization (NICSO 2010) (pp. 65-74). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-12538-6_6
  87. [87] Lu, X., & Zhou, Y. (2008). A novel global convergence algorithm: Bee collecting pollen algorithm. International conference on intelligent computing (pp. 518-525). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-85984-0_62
  88. [88] Yang, C., Tu, X., & Chen, J. (2007). Algorithm of marriage in honey bees optimization based on the wolf pack search. The 2007 international conference on intelligent pervasive computing (IPC 2007) (pp. 462-467). IEEE. https://doi.org/10.1109/IPC.2007.104
  89. [89] Shiqin, Y., Jianjun, J., & Guangxing, Y. (2009). A dolphin partner optimization. 2009 WRI global congress on intelligent systems (Vol. 1, pp. 124-128). IEEE. https://doi.org/10.1109/GCIS.2009.464
  90. [90] Yang, X. S., & Deb, S. (2009). Cuckoo search via Lévy flights. 2009 world congress on nature & biologically inspired computing (NaBIC) (pp. 210-214). IEEE. https://doi.org/10.1109/NABIC.2009.5393690
  91. [91] Karaboga, D., & Basturk, B. (2007). Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. International fuzzy systems association world congress (pp. 789-798). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-72950-1_77
  92. [92] Martin, R., & Stephen, W. (2006). Termite: A swarm intelligent routing algorithm for mobilewireless Ad-Hoc networks. In Stigmergic optimization (pp. 155-184). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-34690-6_7
  93. [93] Pinto, P. C., Runkler, T. A., & Sousa, J. M. (2007). Wasp swarm algorithm for dynamic MAX-SAT problems. International conference on adaptive and natural computing algorithms (pp. 350-357). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-71618-1_39
  94. [94] Farzi, S. (2009). Efficient job scheduling in grid computing with modified artificial fish swarm algorithm. International journal of computer theory and engineering, 1(1), 13. https://doi.org/10.7763/IJCTE.2009.V1.3
  95. [95] Cheng, M. Y., & Prayogo, D. (2014). Symbiotic organisms search: A new metaheuristic optimization algorithm. Computers & structures, 139, 98-112. https://doi.org/10.1016/j.compstruc.2014.03.007
  96. [96] Burke, E. K., Hyde, M. R., Kendall, G., Ochoa, G., Özcan, E., & Woodward, J. R. (2018). A classification of hyper-heuristic approaches: Revisited. In Handbook of metaheuristics (pp. 453–477). Springer. https://doi.org/10.1007/978-3-319-91086-4_14
  97. [97] Burke, E. K., Petrovic, S., & Qu, R. (2006). Case-based heuristic selection for timetabling problems. Journal of scheduling, 9(2), 115–132. https://doi.org/10.1007/s10951-006-6775-y
  98. [98] Yusoff, Y., Ngadiman, M. S., & Zain, A. M. (2011). Overview of NSGA-II for optimizing machining process parameters. Procedia engineering, 15, 3978–3983. https://doi.org/10.1016/j.proeng.2011.08.745
  99. [99] Coello, C. C., & Lechuga, M. S. (2002). MOPSO: A proposal for multiple objective particle swarm optimization. Proceedings of the 2002 congress on evolutionary computation. CEC'02 (Cat. No. 02TH8600) (Vol. 2, pp. 1051-1056). IEEE. https://doi.org/10.1109/CEC.2002.1004388
  100. [100] Gratch, J., Chien, S., & DeJong, G. (1993). Learning search control knowledge for deep space network scheduling. Proceedings of the tenth international conference on machine learning (pp. 135-142). Morgan Kaufmann Publishers. https://doi.org/10.1016/b978-1-55860-307-3.50024-1
  101. [101] Bäck, T., Fogel, D. B., & Michalewicz, Z. (1997). Handbook of evolutionary computation. Release, 97(1), B1. https://doi.org/10.1201/9780367802486
  102. [102] Jaton, J. C., Huser, H., Blatt, Y., & Pecht, I. (1975). Circular dichroism and fluorescence studies of homogeneous antibodies to type III pneumococcal polysaccharide. Biochemistry, 14(24), 5308-5311. https://doi.org/10.1021/bi00695a013
  103. [103] Melo, F. S. (2001). Convergence of Q-learning: A simple proof. https://www.academia.edu/36081666/Convergence_of_Q_learning_a_simple_proof
  104. [104] Choong, S. S., Wong, L. P., & Lim, C. P. (2018). Automatic design of hyper-heuristic based on reinforcement learning. Information sciences, 436, 89-107. https://doi.org/10.1016/j.ins.2018.01.005
  105. [105] Jiang, K., Yao, J., & Tan, X. (2023). Contextual conservative q-learning for offline reinforcement learning. arXiv preprint arXiv:2301.01298. https://doi.org/10.48550/arXiv.2301.01298
  106. [106] Xavier-Junior, J. C., Freitas, A. A., Ludermir, T. B., Feitosa-Neto, A., & Barreto, C. A. (2020). An evolutionary algorithm for automated machine learning focusing on classifier ensembles: An improved algorithm and extended results. Theoretical computer science, 805, 1-18. https://doi.org/10.1016/j.tcs.2019.12.002
  107. [107] Thornton, C. (2014). Auto-WEKA: Combined selection and hyperparameter optimization of supervised machine learning algorithms [Thesis]. https://www.cs.ubc.ca/~hoos/Publ/ThoEtAl13.pdf
  108. [108] Thornton, C., Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2013). Auto-WEKA: Combined selection and hyperparameter optimization of classification algorithms. Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 847-855). Association for Computing Machinery (ACM). https://doi.org/10.1145/2487575.2487629
  109. [109] Goodfellow, I., Bengio, Y., Courville, A., & Bengio, Y. (2016). Deep learning (Vol. 1). MIT Press. https://doi.org/10.1007/s10710-017-9314-z
  110. [110] Kim, Y. (2014). Convolutional neural networks for sentence classification. Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP) (pp. 1746-1751). Association for Computational Linguistics. https://doi.org/10.3115/v1/D14-1181
  111. [111] Zaremba, W., Sutskever, I., & Vinyals, O. (2014). Recurrent neural network regularization. https://doi.org/10.48550/arXiv.1409.2329

Downloads

Published

2025-06-26

Issue

Vol. 2 No. 2 (2025): Metaheuristic Algorithms with Applications (MAA)

Section

Articles

How to Cite

Rashidi, L. (2025). An Overview of Metaheuristic and Hyper-Heuristic Algorithms. Metaheuristic Algorithms With Applications, 2(2), 191-208. https://doi.org/10.48313/maa.v2i2.45

Similar Articles

1-10 of 13

You may also start an advanced similarity search for this article.