Skip to main content
Top
Published in: Artificial Intelligence Review 4/2019

13-01-2018

Metaheuristic research: a comprehensive survey

Authors: Kashif Hussain, Mohd Najib Mohd Salleh, Shi Cheng, Yuhui Shi

Published in: Artificial Intelligence Review | Issue 4/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Because of successful implementations and high intensity, metaheuristic research has been extensively reported in literature, which covers algorithms, applications, comparisons, and analysis. Though, little has been evidenced on insightful analysis of metaheuristic performance issues, and it is still a “black box” that why certain metaheuristics perform better on specific optimization problems and not as good on others. The performance related analyses performed on algorithms are mostly quantitative via performance validation metrics like mean error, standard deviation, and co-relations have been used. Moreover, the performance tests are often performed on specific benchmark functions—few studies are those which involve real data from scientific or engineering optimization problems. In order to draw a comprehensive picture of metaheuristic research, this paper performs a survey of metaheuristic research in literature which consists of 1222 publications from year 1983 to 2016 (33 years). Based on the collected evidence, this paper addresses four dimensions of metaheuristic research: introduction of new algorithms, modifications and hybrids, comparisons and analysis, and research gaps and future directions. The objective is to highlight potential open questions and critical issues raised in literature. The work provides guidance for future research to be conducted more meaningfully that can serve for the good of this area of research.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Literature
go back to reference Aarts EHL, Lenstra JK (1997) Local search in combinatorial optimization. Princeton University Press, PrincetonMATH Aarts EHL, Lenstra JK (1997) Local search in combinatorial optimization. Princeton University Press, PrincetonMATH
go back to reference Abdechiri M, Meybodi MR, Bahrami H (2013) Gases brownian motion optimization: an algorithm for optimization (GBMO). Appl Soft Comput 13(5):2932–2946CrossRef Abdechiri M, Meybodi MR, Bahrami H (2013) Gases brownian motion optimization: an algorithm for optimization (GBMO). Appl Soft Comput 13(5):2932–2946CrossRef
go back to reference Abdullahi M, Ngadi A et al (2016) Symbiotic organism search optimization based task scheduling in cloud computing environment. Future Gener Comput Syst 56:640–650CrossRef Abdullahi M, Ngadi A et al (2016) Symbiotic organism search optimization based task scheduling in cloud computing environment. Future Gener Comput Syst 56:640–650CrossRef
go back to reference Abedinia O, Amjady N, Ghasemi A (2014) A new metaheuristic algorithm based on shark smell optimization. Complexity 21:97–116MathSciNetCrossRef Abedinia O, Amjady N, Ghasemi A (2014) A new metaheuristic algorithm based on shark smell optimization. Complexity 21:97–116MathSciNetCrossRef
go back to reference Abedinpourshotorban H, Shamsuddin SM, Beheshti Z, Jawawi DNA (2016) Electromagnetic field optimization: a physics-inspired metaheuristic optimization algorithm. Swarm Evolut Comput 26:8–22CrossRef Abedinpourshotorban H, Shamsuddin SM, Beheshti Z, Jawawi DNA (2016) Electromagnetic field optimization: a physics-inspired metaheuristic optimization algorithm. Swarm Evolut Comput 26:8–22CrossRef
go back to reference Al Rifaie MM, Bishop MJ, Blackwell T (2011) An investigation into the merger of stochastic diffusion search and particle swarm optimisation. In: Proceedings of the 13th annual conference on genetic and evolutionary computation, ACM pp 37–44 Al Rifaie MM, Bishop MJ, Blackwell T (2011) An investigation into the merger of stochastic diffusion search and particle swarm optimisation. In: Proceedings of the 13th annual conference on genetic and evolutionary computation, ACM pp 37–44
go back to reference Ali MZ, Awad NH, Suganthan PN, Duwairi RM, Reynolds RG (2016) A novel hybrid cultural algorithms framework with trajectory-based search for global numerical optimization. Inf Sci 334:219–249CrossRef Ali MZ, Awad NH, Suganthan PN, Duwairi RM, Reynolds RG (2016) A novel hybrid cultural algorithms framework with trajectory-based search for global numerical optimization. Inf Sci 334:219–249CrossRef
go back to reference Amudhavel J, Kumarakrishnan S, Anantharaj B, Padmashree D, Harinee S, Kumar KP (2015) A novel bio-inspired krill herd optimization in wireless ad-hoc network (WANET) for effective routing. In: Proceedings of the 2015 international conference on advanced research in computer science engineering & technology (ICARCSET 2015), ACM p 28 Amudhavel J, Kumarakrishnan S, Anantharaj B, Padmashree D, Harinee S, Kumar KP (2015) A novel bio-inspired krill herd optimization in wireless ad-hoc network (WANET) for effective routing. In: Proceedings of the 2015 international conference on advanced research in computer science engineering & technology (ICARCSET 2015), ACM p 28
go back to reference Angeline PJ, Saunders GM, Pollack JB (1994) An evolutionary algorithm that constructs recurrent neural networks. IEEE Trans Neural Networks 5(1):54–65CrossRef Angeline PJ, Saunders GM, Pollack JB (1994) An evolutionary algorithm that constructs recurrent neural networks. IEEE Trans Neural Networks 5(1):54–65CrossRef
go back to reference Arasomwan AM, Adewumi AO (2014) An investigation into the performance of particle swarm optimization with various chaotic maps. Math Prob Eng 2014:14MathSciNetMATHCrossRef Arasomwan AM, Adewumi AO (2014) An investigation into the performance of particle swarm optimization with various chaotic maps. Math Prob Eng 2014:14MathSciNetMATHCrossRef
go back to reference Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169:1–12CrossRef Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169:1–12CrossRef
go back to reference Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: 2007 IEEE congress on evolutionary computation, IEEE, pp 4661–4667 Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: 2007 IEEE congress on evolutionary computation, IEEE, pp 4661–4667
go back to reference Bae C, Yeh W-C, Wahid N, Chung YY, Liu Y (2012) A new simplified swarm optimization (SSO) using exchange local search scheme. Int J Innov Comput Inf Control 8(6):4391–4406 Bae C, Yeh W-C, Wahid N, Chung YY, Liu Y (2012) A new simplified swarm optimization (SSO) using exchange local search scheme. Int J Innov Comput Inf Control 8(6):4391–4406
go back to reference Bandieramonte M, Di Stefano A, Morana G (2010) Grid jobs scheduling: the alienated ant algorithm solution. Multiagent Grid Syst 6(3):225–243MATHCrossRef Bandieramonte M, Di Stefano A, Morana G (2010) Grid jobs scheduling: the alienated ant algorithm solution. Multiagent Grid Syst 6(3):225–243MATHCrossRef
go back to reference Barresi KM (2014) Foraging agent swarm optimization with applications in data clustering. In: International conference on swarm intelligence, Springer, pp 230–237 Barresi KM (2014) Foraging agent swarm optimization with applications in data clustering. In: International conference on swarm intelligence, Springer, pp 230–237
go back to reference Baykasoğlu A, Akpinar Ş (2015) Weighted superposition attraction (WSA): a swarm intelligence algorithm for optimization problems-part 2: constrained optimization. Appl Soft Comput 37:396–415CrossRef Baykasoğlu A, Akpinar Ş (2015) Weighted superposition attraction (WSA): a swarm intelligence algorithm for optimization problems-part 2: constrained optimization. Appl Soft Comput 37:396–415CrossRef
go back to reference Bayraktar Z, Komurcu M, Werner DH (2010) Wind driven optimization (WDO): a novel nature-inspired optimization algorithm and its application to electromagnetics. In: IEEE antennas and propagation society international symposium (APSURSI), 2010, IEEE, pp 1–4 Bayraktar Z, Komurcu M, Werner DH (2010) Wind driven optimization (WDO): a novel nature-inspired optimization algorithm and its application to electromagnetics. In: IEEE antennas and propagation society international symposium (APSURSI), 2010, IEEE, pp 1–4
go back to reference Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv (CSUR) 35(3):268–308CrossRef Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv (CSUR) 35(3):268–308CrossRef
go back to reference Brabazon A, Cui W, ONeill M (2016) The raven roosting optimisation algorithm. Soft Comput 20(2):525–545CrossRef Brabazon A, Cui W, ONeill M (2016) The raven roosting optimisation algorithm. Soft Comput 20(2):525–545CrossRef
go back to reference Brereton P, Kitchenham BA, Budgen D, Turner M, Khalil M (2007) Lessons from applying the systematic literature review process within the software engineering domain. J Syst Softw 80(4):571–583CrossRef Brereton P, Kitchenham BA, Budgen D, Turner M, Khalil M (2007) Lessons from applying the systematic literature review process within the software engineering domain. J Syst Softw 80(4):571–583CrossRef
go back to reference Canayaz M, Karcı A (2015) Investigation of cricket behaviours as evolutionary computation for system design optimization problems. Measurement 68:225–235CrossRef Canayaz M, Karcı A (2015) Investigation of cricket behaviours as evolutionary computation for system design optimization problems. Measurement 68:225–235CrossRef
go back to reference Caraveo C, Valdez F, Castillo O (2015) Bio-inspired optimization algorithm based on the self-defense mechanism in plants. In: Mexican international conference on artificial intelligence, Springer, pp 227–237 Caraveo C, Valdez F, Castillo O (2015) Bio-inspired optimization algorithm based on the self-defense mechanism in plants. In: Mexican international conference on artificial intelligence, Springer, pp 227–237
go back to reference Chen CC, Tsai YC, Liu II, Lai CC, Yeh YT, Kuo SY, Chou YH (2015) A novel metaheuristic: Jaguar algorithm with learning behavior. In: 2015 IEEE international conference on systems, man, and cybernetics (SMC), IEEE, pp 1595–1600 Chen CC, Tsai YC, Liu II, Lai CC, Yeh YT, Kuo SY, Chou YH (2015) A novel metaheuristic: Jaguar algorithm with learning behavior. In: 2015 IEEE international conference on systems, man, and cybernetics (SMC), IEEE, pp 1595–1600
go back to reference Chen MR, Lu YZ, Yang G (2006) Population-based extremal optimization with adaptive lévy mutation for constrained optimization. In: 2006 International conference on computational intelligence and security, vol 1, IEEE pp 258–261 Chen MR, Lu YZ, Yang G (2006) Population-based extremal optimization with adaptive lévy mutation for constrained optimization. In: 2006 International conference on computational intelligence and security, vol 1, IEEE pp 258–261
go back to reference Chetty S, Adewumi AO (2015) A study on the enhanced best performance algorithm for the just-in-time scheduling problem. Discret Dyn Nature Soc 2015:12MathSciNetMATH Chetty S, Adewumi AO (2015) A study on the enhanced best performance algorithm for the just-in-time scheduling problem. Discret Dyn Nature Soc 2015:12MathSciNetMATH
go back to reference Civicioglu P (2013) Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput 219(15):8121–8144MathSciNetMATH Civicioglu P (2013) Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput 219(15):8121–8144MathSciNetMATH
go back to reference Crawford B, Soto R, Berríos N, Johnson F, Paredes F, Castro C, Norero E (2015) A binary cat swarm optimization algorithm for the non-unicost set covering problem. Math Probl Eng, 2015 Crawford B, Soto R, Berríos N, Johnson F, Paredes F, Castro C, Norero E (2015) A binary cat swarm optimization algorithm for the non-unicost set covering problem. Math Probl Eng, 2015
go back to reference Črepinšek M, Liu S-H, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv (CSUR) 45(3):35MATHCrossRef Črepinšek M, Liu S-H, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv (CSUR) 45(3):35MATHCrossRef
go back to reference Cuevas E, Cienfuegos M, Zaldívar D, Pérez-Cisneros M (2013) A swarm optimization algorithm inspired in the behavior of the social-spider. Expert Syst Appl 40(16):6374–6384CrossRef Cuevas E, Cienfuegos M, Zaldívar D, Pérez-Cisneros M (2013) A swarm optimization algorithm inspired in the behavior of the social-spider. Expert Syst Appl 40(16):6374–6384CrossRef
go back to reference Cuevas E, González A, Fausto F, Zaldívar D, Pérez-Cisneros M (2015) Multithreshold segmentation by using an algorithm based on the behavior of locust swarms. Math Probl Eng 2015:25 Cuevas E, González A, Fausto F, Zaldívar D, Pérez-Cisneros M (2015) Multithreshold segmentation by using an algorithm based on the behavior of locust swarms. Math Probl Eng 2015:25
go back to reference Dash T, Sahu PK (2015) Gradient gravitational search: an efficient metaheuristic algorithm for global optimization. J Comput Chem 36(14):1060–1068CrossRef Dash T, Sahu PK (2015) Gradient gravitational search: an efficient metaheuristic algorithm for global optimization. J Comput Chem 36(14):1060–1068CrossRef
go back to reference Deb S, Fong S, Tian Z (2015) Elephant search algorithm for optimization problems. In: 2015 Tenth international conference on digital information management (ICDIM), IEEE, pp 249–255 Deb S, Fong S, Tian Z (2015) Elephant search algorithm for optimization problems. In: 2015 Tenth international conference on digital information management (ICDIM), IEEE, pp 249–255
go back to reference Djenouri Y, Drias H, Habbas Z, Mosteghanemi H (2012) Bees swarm optimization for web association rule mining. In: 2012 IEEE/WIC/ACM international conferences on web intelligence and intelligent agent technology (WI-IAT), vol 3, IEEE, pp 142–146 Djenouri Y, Drias H, Habbas Z, Mosteghanemi H (2012) Bees swarm optimization for web association rule mining. In: 2012 IEEE/WIC/ACM international conferences on web intelligence and intelligent agent technology (WI-IAT), vol 3, IEEE, pp 142–146
go back to reference Doan B, lmez T (2015) A new metaheuristic for numerical function optimization: vortex search algorithm. Inf Sci 293:125–145CrossRef Doan B, lmez T (2015) A new metaheuristic for numerical function optimization: vortex search algorithm. Inf Sci 293:125–145CrossRef
go back to reference Dorigo Marco (1992) Optimization, learning and natural algorithms. Ph. D. Thesis, Politecnico di Milano, Italy Dorigo Marco (1992) Optimization, learning and natural algorithms. Ph. D. Thesis, Politecnico di Milano, Italy
go back to reference Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53–66CrossRef Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53–66CrossRef
go back to reference Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28–39CrossRef Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28–39CrossRef
go back to reference Duan QY, Gupta VK, Sorooshian S (1993) Shuffled complex evolution approach for effective and efficient global minimization. J Optim Theory Appl 76(3):501–521MathSciNetMATHCrossRef Duan QY, Gupta VK, Sorooshian S (1993) Shuffled complex evolution approach for effective and efficient global minimization. J Optim Theory Appl 76(3):501–521MathSciNetMATHCrossRef
go back to reference Duman E, Uysal M, Alkaya AF (2012) Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf Sci 217:65–77MathSciNetCrossRef Duman E, Uysal M, Alkaya AF (2012) Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf Sci 217:65–77MathSciNetCrossRef
go back to reference Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, vol 1, pp 39–43. New York, NY Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, vol 1, pp 39–43. New York, NY
go back to reference Erol OK, Eksin I (2006) A new optimization method: big bang-big crunch. Adv Eng Softw 37(2):106–111CrossRef Erol OK, Eksin I (2006) A new optimization method: big bang-big crunch. Adv Eng Softw 37(2):106–111CrossRef
go back to reference Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129–154MathSciNetCrossRef Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129–154MathSciNetCrossRef
go back to reference Faisal M, Mathkour H, Alsulaiman M (2016) AntStar: enhancing optimization problems by integrating an Ant system and A* algorithm. Sci Prog 2016:2 Faisal M, Mathkour H, Alsulaiman M (2016) AntStar: enhancing optimization problems by integrating an Ant system and A* algorithm. Sci Prog 2016:2
go back to reference Feng X, Lau FCM, Gao D (2009) A new bio-inspired approach to the traveling salesman problem. In: International conference on complex sciences, Springer, pp 1310–1321 Feng X, Lau FCM, Gao D (2009) A new bio-inspired approach to the traveling salesman problem. In: International conference on complex sciences, Springer, pp 1310–1321
go back to reference Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8(2):67–71MathSciNetMATHCrossRef Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8(2):67–71MathSciNetMATHCrossRef
go back to reference Filipović V, Kartelj A, Matić D (2013) An electromagnetism metaheuristic for solving the maximum betweenness problem. Appl Soft Comput 13(2):1303–1313CrossRef Filipović V, Kartelj A, Matić D (2013) An electromagnetism metaheuristic for solving the maximum betweenness problem. Appl Soft Comput 13(2):1303–1313CrossRef
go back to reference Fogel GB, Corne DW (2002) Evolutionary computation in bioinformatics. Morgan Kaufmann, Burlington Fogel GB, Corne DW (2002) Evolutionary computation in bioinformatics. Morgan Kaufmann, Burlington
go back to reference Gamerman D, Lopes HF (2006) Markov chain Monte Carlo: stochastic simulation for Bayesian inference. CRC Press, Boca RatonMATH Gamerman D, Lopes HF (2006) Markov chain Monte Carlo: stochastic simulation for Bayesian inference. CRC Press, Boca RatonMATH
go back to reference Gandomi AH (2014) Interior search algorithm (ISA): a novel approach for global optimization. ISA Trans 53(4):1168–1183CrossRef Gandomi AH (2014) Interior search algorithm (ISA): a novel approach for global optimization. ISA Trans 53(4):1168–1183CrossRef
go back to reference Gao-Ji Sun (2010) A new evolutionary algorithm for global numerical optimization. In: International conference on machine learning and cybernetics (ICMLC), 2010, vol 4, IEEE, pp 1807–1810 Gao-Ji Sun (2010) A new evolutionary algorithm for global numerical optimization. In: International conference on machine learning and cybernetics (ICMLC), 2010, vol 4, IEEE, pp 1807–1810
go back to reference Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68CrossRef Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68CrossRef
go back to reference Glover F (1997) A template for scatter search and path relinking. In: European conference on artificial evolution, Springer, p 1–51 Glover F (1997) A template for scatter search and path relinking. In: European conference on artificial evolution, Springer, p 1–51
go back to reference Gonçalves R, Goldbarg MC, Goldbarg EF, Delgado MR (2008) Warping search: a new metaheuristic applied to the protein structure prediction. In: Proceedings of the 10th annual conference on genetic and evolutionary computation, ACM, pp 349–350 Gonçalves R, Goldbarg MC, Goldbarg EF, Delgado MR (2008) Warping search: a new metaheuristic applied to the protein structure prediction. In: Proceedings of the 10th annual conference on genetic and evolutionary computation, ACM, pp 349–350
go back to reference Gonçalves MS, Lopez RH, Miguel LFF (2015) Search group algorithm: a new metaheuristic method for the optimization of truss structures. Comput Struct 153:165–184CrossRef Gonçalves MS, Lopez RH, Miguel LFF (2015) Search group algorithm: a new metaheuristic method for the optimization of truss structures. Comput Struct 153:165–184CrossRef
go back to reference Gonzalez-Fernandez Y, Chen S (2015) Leaders and followers–a new metaheuristic to avoid the bias of accumulated information. In: IEEE congress on evolutionary computation (CEC), 2015, IEEE, pp 776–783 Gonzalez-Fernandez Y, Chen S (2015) Leaders and followers–a new metaheuristic to avoid the bias of accumulated information. In: IEEE congress on evolutionary computation (CEC), 2015, IEEE, pp 776–783
go back to reference Greenberg HJ (2004) Mathematical programming glossary. Greenberg, New York Greenberg HJ (2004) Mathematical programming glossary. Greenberg, New York
go back to reference Gupta K, Deep K (2016) Tournament selection based probability scheme in spider monkey optimization algorithm. In: Harmony search algorithm, Springer, pp 239–250 Gupta K, Deep K (2016) Tournament selection based probability scheme in spider monkey optimization algorithm. In: Harmony search algorithm, Springer, pp 239–250
go back to reference Hajipour H, Khormuji HB, Rostami H (2016) ODMA: a novel swarm-evolutionary metaheuristic optimizer inspired by open source development model and communities. Soft Comput 20(2):727–747CrossRef Hajipour H, Khormuji HB, Rostami H (2016) ODMA: a novel swarm-evolutionary metaheuristic optimizer inspired by open source development model and communities. Soft Comput 20(2):727–747CrossRef
go back to reference Haldar V, Chakraborty N (2017) A novel evolutionary technique based on electrolocation principle of elephant nose fish and shark: fish electrolocation optimization. Soft Comput 21(14):3827–3848CrossRef Haldar V, Chakraborty N (2017) A novel evolutionary technique based on electrolocation principle of elephant nose fish and shark: fish electrolocation optimization. Soft Comput 21(14):3827–3848CrossRef
go back to reference Hasançebi O, Azad SK (2015) Adaptive dimensional search: a new metaheuristic algorithm for discrete truss sizing optimization. Comput Struct 154:1–16CrossRef Hasançebi O, Azad SK (2015) Adaptive dimensional search: a new metaheuristic algorithm for discrete truss sizing optimization. Comput Struct 154:1–16CrossRef
go back to reference He S, Wu QH, Saunders JR (2006) A novel group search optimizer inspired by animal behavioural ecology. In: IEEE congress on evolutionary computation, 2006. CEC 2006, IEEE, pp 1272–1278 He S, Wu QH, Saunders JR (2006) A novel group search optimizer inspired by animal behavioural ecology. In: IEEE congress on evolutionary computation, 2006. CEC 2006, IEEE, pp 1272–1278
go back to reference Huang Z, Chen Y (2015) Log-linear model based behavior selection method for artificial fish swarm algorithm. Comput Intell Neurosci 2015:10 Huang Z, Chen Y (2015) Log-linear model based behavior selection method for artificial fish swarm algorithm. Comput Intell Neurosci 2015:10
go back to reference Iordache S (2010) Consultant-guided search: a new metaheuristic for combinatorial optimization problems. In: Proceedings of the 12th annual conference on genetic and evolutionary computation, ACM, pp 225–232 Iordache S (2010) Consultant-guided search: a new metaheuristic for combinatorial optimization problems. In: Proceedings of the 12th annual conference on genetic and evolutionary computation, ACM, pp 225–232
go back to reference Jahuira CAR (2002) Hybrid genetic algorithm with exact techniques applied to TSP. In: Second international workshop on intelligent systems design and application, Dynamic Publishers, Inc, pp 119–124 Jahuira CAR (2002) Hybrid genetic algorithm with exact techniques applied to TSP. In: Second international workshop on intelligent systems design and application, Dynamic Publishers, Inc, pp 119–124
go back to reference James JQ, Li VOK (2015) A social spider algorithm for global optimization. Appl Soft Comput 30:614–627CrossRef James JQ, Li VOK (2015) A social spider algorithm for global optimization. Appl Soft Comput 30:614–627CrossRef
go back to reference Jin Y (2011) Surrogate-assisted evolutionary computation: recent advances and future challenges. Swarm Evolut Comput 1(2):61–70CrossRef Jin Y (2011) Surrogate-assisted evolutionary computation: recent advances and future challenges. Swarm Evolut Comput 1(2):61–70CrossRef
go back to reference Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108–132MathSciNetMATH Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108–132MathSciNetMATH
go back to reference Karaboga D, An idea based on honey bee swarm for numerical optimization. Report, technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department, 2005 Karaboga D, An idea based on honey bee swarm for numerical optimization. Report, technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department, 2005
go back to reference Karami H, Sanjari MJ, Gharehpetian GB (2014) Hyper-spherical search (HSS) algorithm: a novel meta-heuristic algorithm to optimize nonlinear functions. Neural Comput Appl 25(6):1455–1465CrossRef Karami H, Sanjari MJ, Gharehpetian GB (2014) Hyper-spherical search (HSS) algorithm: a novel meta-heuristic algorithm to optimize nonlinear functions. Neural Comput Appl 25(6):1455–1465CrossRef
go back to reference Karimkashi S, Kishk AA (2010) Invasive weed optimization and its features in electromagnetics. IEEE Trans Antennas Propag 58(4):1269–1278CrossRef Karimkashi S, Kishk AA (2010) Invasive weed optimization and its features in electromagnetics. IEEE Trans Antennas Propag 58(4):1269–1278CrossRef
go back to reference Kashani AR, Gandomi AH, Mousavi M (2016) Imperialistic competitive algorithm: a metaheuristic algorithm for locating the critical slip surface in 2-dimensional soil slopes. Geosci Front 7(1):83–89CrossRef Kashani AR, Gandomi AH, Mousavi M (2016) Imperialistic competitive algorithm: a metaheuristic algorithm for locating the critical slip surface in 2-dimensional soil slopes. Geosci Front 7(1):83–89CrossRef
go back to reference Kaveh A, Bakhshpoori T (2016) A new metaheuristic for continuous structural optimization: water evaporation optimization. Struct Multidiscip Optim 54(1):23–43CrossRef Kaveh A, Bakhshpoori T (2016) A new metaheuristic for continuous structural optimization: water evaporation optimization. Struct Multidiscip Optim 54(1):23–43CrossRef
go back to reference Kaveh A, Farhoudi N (2016) Dolphin monitoring for enhancing metaheuristic algorithms: layout optimization of braced frames. Comput Struct 165:1–9CrossRef Kaveh A, Farhoudi N (2016) Dolphin monitoring for enhancing metaheuristic algorithms: layout optimization of braced frames. Comput Struct 165:1–9CrossRef
go back to reference Kaveh A, Khayatazad M (2012) A new meta-heuristic method: ray optimization. Comput Struct 112:283–294CrossRef Kaveh A, Khayatazad M (2012) A new meta-heuristic method: ray optimization. Comput Struct 112:283–294CrossRef
go back to reference Kaveh A, Mahdavi VR (2014) Colliding bodies optimization: a novel meta-heuristic method. Comput Struct 139:18–27CrossRef Kaveh A, Mahdavi VR (2014) Colliding bodies optimization: a novel meta-heuristic method. Comput Struct 139:18–27CrossRef
go back to reference Kaveh A, Talatahari S (2010) A novel heuristic optimization method: charged system search. Acta Mech 213(3):267–289MATHCrossRef Kaveh A, Talatahari S (2010) A novel heuristic optimization method: charged system search. Acta Mech 213(3):267–289MATHCrossRef
go back to reference Kaveh A, Motie MA, Share MM (2013) Magnetic charged system search: a new meta-heuristic algorithm for optimization. Acta Mech 224(1):85–107MATHCrossRef Kaveh A, Motie MA, Share MM (2013) Magnetic charged system search: a new meta-heuristic algorithm for optimization. Acta Mech 224(1):85–107MATHCrossRef
go back to reference Keele S (2007) Guidelines for performing systematic literature reviews in software engineering. In: Technical report, Ver. 2.3 EBSE Technical Report. EBSE. sn Keele S (2007) Guidelines for performing systematic literature reviews in software engineering. In: Technical report, Ver. 2.3 EBSE Technical Report. EBSE. sn
go back to reference Khabzaoui M, Dhaenens C, Talbi E-G (2008) Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery. RAIRO-Oper Res 42(1):69–83MathSciNetMATHCrossRef Khabzaoui M, Dhaenens C, Talbi E-G (2008) Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery. RAIRO-Oper Res 42(1):69–83MathSciNetMATHCrossRef
go back to reference Khajehzadeh M, Taha MR, Elshafie AHKAN, Eslami M (2011) A survey on meta-heuristic global optimization algorithms. Res J Appl Sci Eng Technol 3(6):569–578 Khajehzadeh M, Taha MR, Elshafie AHKAN, Eslami M (2011) A survey on meta-heuristic global optimization algorithms. Res J Appl Sci Eng Technol 3(6):569–578
go back to reference Kiruthiga G, Krishnapriya S, Karpagambigai V, Pazhaniraja N, Paul P Victer (2015) A novel bio-inspired algorithm based on the foraging behaviour of the bottlenose dolphin. In: 2015 International conference on computation of power, energy information and commuincation (ICCPEIC), IEEE, pp 0209–0224 Kiruthiga G, Krishnapriya S, Karpagambigai V, Pazhaniraja N, Paul P Victer (2015) A novel bio-inspired algorithm based on the foraging behaviour of the bottlenose dolphin. In: 2015 International conference on computation of power, energy information and commuincation (ICCPEIC), IEEE, pp 0209–0224
go back to reference Koziel S, Yang X-S (2011) Computational optimization, methods and algorithms, vol 356. Springer, New YorkMATHCrossRef Koziel S, Yang X-S (2011) Computational optimization, methods and algorithms, vol 356. Springer, New YorkMATHCrossRef
go back to reference Kuo RJ, Zulvia FE (2015) The gradient evolution algorithm: a new metaheuristic. Inf Sci 316:246–265MATHCrossRef Kuo RJ, Zulvia FE (2015) The gradient evolution algorithm: a new metaheuristic. Inf Sci 316:246–265MATHCrossRef
go back to reference Li SX, Wang JS (2015) Dynamic modeling of steam condenser and design of pi controller based on grey wolf optimizer. Math Probl Eng 2015:9MATH Li SX, Wang JS (2015) Dynamic modeling of steam condenser and design of pi controller based on grey wolf optimizer. Math Probl Eng 2015:9MATH
go back to reference Li Z-Y, Li Z, Nguyen TT, Chen SM (2015) Orthogonal chemical reaction optimization algorithm for global numerical optimization problems. Expert Syst Appl 42(6):3242–3252CrossRef Li Z-Y, Li Z, Nguyen TT, Chen SM (2015) Orthogonal chemical reaction optimization algorithm for global numerical optimization problems. Expert Syst Appl 42(6):3242–3252CrossRef
go back to reference Li MD, Zhao H, Weng XW, Han T (2016) A novel nature-inspired algorithm for optimization: virus colony search. Adv Eng Softw 92:65–88CrossRef Li MD, Zhao H, Weng XW, Han T (2016) A novel nature-inspired algorithm for optimization: virus colony search. Adv Eng Softw 92:65–88CrossRef
go back to reference Lianbo M, Kunyuan H, Yunlong Z, Hanning C, Maowei H (2014) A novel plant root foraging algorithm for image segmentation problems. Math Probl Eng 2014:16 Lianbo M, Kunyuan H, Yunlong Z, Hanning C, Maowei H (2014) A novel plant root foraging algorithm for image segmentation problems. Math Probl Eng 2014:16
go back to reference Liang X, Li W, Liu PP, Zhang Y, Agbo AA (2015) Social network-based swarm optimization algorithm. In: IEEE 12th international conference on networking, sensing and control (ICNSC), 2015, IEEE, pp 360–365 Liang X, Li W, Liu PP, Zhang Y, Agbo AA (2015) Social network-based swarm optimization algorithm. In: IEEE 12th international conference on networking, sensing and control (ICNSC), 2015, IEEE, pp 360–365
go back to reference Li K, Tian H (2015) A de-based scatter search for global optimization problems. Discret Dyn Nat Soc, 2015:303125 Li K, Tian H (2015) A de-based scatter search for global optimization problems. Discret Dyn Nat Soc, 2015:303125
go back to reference Liu Y, Tian P (2015) A multi-start central force optimization for global optimization. Appl Soft Comput 27:92–98CrossRef Liu Y, Tian P (2015) A multi-start central force optimization for global optimization. Appl Soft Comput 27:92–98CrossRef
go back to reference Li W, Wang L, Yao Q, Jiang Q, Yu L, Wang B, Hei X (2015) Cloud particles differential evolution algorithm: a novel optimization method for global numerical optimization. Math Probl Eng 2015:3242–3252 Li W, Wang L, Yao Q, Jiang Q, Yu L, Wang B, Hei X (2015) Cloud particles differential evolution algorithm: a novel optimization method for global numerical optimization. Math Probl Eng 2015:3242–3252
go back to reference Mahdavi S, Shiri ME, Rahnamayan S (2015) Metaheuristics in large-scale global continues optimization: a survey. Inf Sci 295:407–428MathSciNetCrossRef Mahdavi S, Shiri ME, Rahnamayan S (2015) Metaheuristics in large-scale global continues optimization: a survey. Inf Sci 295:407–428MathSciNetCrossRef
go back to reference Mann PS, Singh S (2017) Improved metaheuristic based energy-efficient clustering protocol for wireless sensor networks. Eng Appl Artif Intell 57:142–152CrossRef Mann PS, Singh S (2017) Improved metaheuristic based energy-efficient clustering protocol for wireless sensor networks. Eng Appl Artif Intell 57:142–152CrossRef
go back to reference Marinakis Y, Marinaki M (2014) A bumble bees mating optimization algorithm for the open vehicle routing problem. Swarm Evolut Comput 15:80–94MATHCrossRef Marinakis Y, Marinaki M (2014) A bumble bees mating optimization algorithm for the open vehicle routing problem. Swarm Evolut Comput 15:80–94MATHCrossRef
go back to reference Marinakis Y, Marinaki M (2011) A honey bees mating optimization algorithm for the open vehicle routing problem. In: Proceedings of the 13th annual conference on genetic and evolutionary computation, ACM, pp 101–108 Marinakis Y, Marinaki M (2011) A honey bees mating optimization algorithm for the open vehicle routing problem. In: Proceedings of the 13th annual conference on genetic and evolutionary computation, ACM, pp 101–108
go back to reference Marinakis Y, Marinaki M, Matsatsinis N (2009) A hybrid bumble bees mating optimization-GRASP algorithm for clustering. In: International conference on hybrid artificial intelligence systems, Springer, pp 549–556 Marinakis Y, Marinaki M, Matsatsinis N (2009) A hybrid bumble bees mating optimization-GRASP algorithm for clustering. In: International conference on hybrid artificial intelligence systems, Springer, pp 549–556
go back to reference Meignan D, Koukam A, Crput J-C (2010) Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism. J Heuristics 16(6):859–879MATHCrossRef Meignan D, Koukam A, Crput J-C (2010) Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism. J Heuristics 16(6):859–879MATHCrossRef
go back to reference Meng X, Liu Y, Gao X, Zhang H (2014) A new bio-inspired algorithm: chicken swarm optimization. In: International conference in swarm intelligence, Springer, pp 86–94 Meng X, Liu Y, Gao X, Zhang H (2014) A new bio-inspired algorithm: chicken swarm optimization. In: International conference in swarm intelligence, Springer, pp 86–94
go back to reference 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. Appl Soft Comput 33:292–303CrossRef 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. Appl Soft Comput 33:292–303CrossRef
go back to reference Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl-Based Syst 89:228–249CrossRef Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl-Based Syst 89:228–249CrossRef
go back to reference Mirjalili S (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120–133CrossRef Mirjalili S (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120–133CrossRef
go back to reference Munoz MA, López JA, Caicedo E (2009) An artificial beehive algorithm for continuous optimization. Int J Intell Syst 24(11):1080–1093MATHCrossRef Munoz MA, López JA, Caicedo E (2009) An artificial beehive algorithm for continuous optimization. Int J Intell Syst 24(11):1080–1093MATHCrossRef
go back to reference Muthiah-Nakarajan V, Noel MM (2016) Galactic swarm optimization: a new global optimization metaheuristic inspired by galactic motion. Appl Soft Comput 38:771–787CrossRef Muthiah-Nakarajan V, Noel MM (2016) Galactic swarm optimization: a new global optimization metaheuristic inspired by galactic motion. Appl Soft Comput 38:771–787CrossRef
go back to reference Narayanan A, Moore M (1996) Quantum-inspired genetic algorithms. In: Proceedings of IEEE International conference on evolutionary computation, 1996, IEEE, pp 61–66 Narayanan A, Moore M (1996) Quantum-inspired genetic algorithms. In: Proceedings of IEEE International conference on evolutionary computation, 1996, IEEE, pp 61–66
go back to reference Nasir ANK, Raja Ismail RMT, Tokhi MO (2016) Adaptive spiral dynamics metaheuristic algorithm for global optimisation with application to modelling of a flexible system. Appl Math Model 40(9):5442–5461MathSciNetCrossRef Nasir ANK, Raja Ismail RMT, Tokhi MO (2016) Adaptive spiral dynamics metaheuristic algorithm for global optimisation with application to modelling of a flexible system. Appl Math Model 40(9):5442–5461MathSciNetCrossRef
go back to reference Nourddine B (2015) A variable depth search algorithm for binary constraint satisfaction problems. Math Probl Eng, 2015 Nourddine B (2015) A variable depth search algorithm for binary constraint satisfaction problems. Math Probl Eng, 2015
go back to reference Odili JB, Kahar MNM (2016) Solving the traveling salesman’s problem using the african buffalo optimization. Comput Intell Neurosci 2016:3CrossRef Odili JB, Kahar MNM (2016) Solving the traveling salesman’s problem using the african buffalo optimization. Comput Intell Neurosci 2016:3CrossRef
go back to reference Osaba E, Diaz F, Carballedo R, Onieva E, Perallos A (2014) Focusing on the golden ball metaheuristic: an extended study on a wider set of problems. Sci World J 2014:1–17 Osaba E, Diaz F, Carballedo R, Onieva E, Perallos A (2014) Focusing on the golden ball metaheuristic: an extended study on a wider set of problems. Sci World J 2014:1–17
go back to reference Osaba E, Diaz F, Onieva E (2013) A novel meta-heuristic based on soccer concepts to solve routing problems. In: Proceedings of the 15th annual conference companion on genetic and evolutionary computation, ACM, pp 1743–1744 Osaba E, Diaz F, Onieva E (2013) A novel meta-heuristic based on soccer concepts to solve routing problems. In: Proceedings of the 15th annual conference companion on genetic and evolutionary computation, ACM, pp 1743–1744
go back to reference Pan W-T (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl-Based Syst 26:69–74CrossRef Pan W-T (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl-Based Syst 26:69–74CrossRef
go back to reference Petersen K, Feldt R, Mujtaba S, Mattsson M (2008) Systematic mapping studies in software engineering. In: 12th international conference on evaluation and assessment in software engineering, vol 17 Petersen K, Feldt R, Mujtaba S, Mattsson M (2008) Systematic mapping studies in software engineering. In: 12th international conference on evaluation and assessment in software engineering, vol 17
go back to reference Pham DT, Huynh TTB (2015) An effective combination of genetic algorithms and the variable neighborhood search for solving travelling salesman problem. In: 2015 Conference on technologies and applications of artificial intelligence (TAAI), IEEE, pp 142–149 Pham DT, Huynh TTB (2015) An effective combination of genetic algorithms and the variable neighborhood search for solving travelling salesman problem. In: 2015 Conference on technologies and applications of artificial intelligence (TAAI), IEEE, pp 142–149
go back to reference Puchinger J, Raidl GR (2005) Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. In: International work-conference on the interplay between natural and artificial computation, Springer, pp 41–53 Puchinger J, Raidl GR (2005) Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. In: International work-conference on the interplay between natural and artificial computation, Springer, pp 41–53
go back to reference Qin J (2009) A new optimization algorithm and its application key cutting algorithm. In: 2009 IEEE international conference on grey systems and intelligent services (GSIS 2009), IEEE, pp 1537–1541 Qin J (2009) A new optimization algorithm and its application key cutting algorithm. In: 2009 IEEE international conference on grey systems and intelligent services (GSIS 2009), IEEE, pp 1537–1541
go back to reference Rahmani R, Yusof R (2014) A new simple, fast and efficient algorithm for global optimization over continuous search-space problems: radial movement optimization. Appl Math Comput 248:287–300MathSciNetMATH Rahmani R, Yusof R (2014) A new simple, fast and efficient algorithm for global optimization over continuous search-space problems: radial movement optimization. Appl Math Comput 248:287–300MathSciNetMATH
go back to reference Rao RV, Savsani VJ, Vakharia DP (2011) Teaching learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303–315CrossRef Rao RV, Savsani VJ, Vakharia DP (2011) Teaching learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303–315CrossRef
go back to reference Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248MATHCrossRef Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248MATHCrossRef
go back to reference Rechenberg I (1994) Evolutionsstrategie: Optimierung technischer systeme nach prinzipien der biologischen evolution. frommann-holzbog, stuttgart, 1973. Step-size adaptation based on non-local use of selection information. In: Parallel problem solving from nature (PPSN3) Rechenberg I (1994) Evolutionsstrategie: Optimierung technischer systeme nach prinzipien der biologischen evolution. frommann-holzbog, stuttgart, 1973. Step-size adaptation based on non-local use of selection information. In: Parallel problem solving from nature (PPSN3)
go back to reference Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13(5):2592–2612CrossRef Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13(5):2592–2612CrossRef
go back to reference Sadollah A, Eskandar H, Kim JH (2015) Water cycle algorithm for solving constrained multi-objective optimization problems. Appl Soft Comput 27:279–298CrossRef Sadollah A, Eskandar H, Kim JH (2015) Water cycle algorithm for solving constrained multi-objective optimization problems. Appl Soft Comput 27:279–298CrossRef
go back to reference Sahli Z, Hamouda A, Bekrar A, Trentesaux D (2014) Hybrid PSO-tabu search for the optimal reactive power dispatch problem. In: IECON 2014-40th annual conference of the IEEE industrial electronics society, IEEE, pp 3536–3542 Sahli Z, Hamouda A, Bekrar A, Trentesaux D (2014) Hybrid PSO-tabu search for the optimal reactive power dispatch problem. In: IECON 2014-40th annual conference of the IEEE industrial electronics society, IEEE, pp 3536–3542
go back to reference Salcedo-Sanz S, Del Ser J, Landa-Torres I, Gil-Lpez S, Portilla-Figueras JA (2014) The coral reefs optimization algorithm: a novel metaheuristic for efficiently solving optimization problems. Sci World J, 2014 Salcedo-Sanz S, Del Ser J, Landa-Torres I, Gil-Lpez S, Portilla-Figueras JA (2014) The coral reefs optimization algorithm: a novel metaheuristic for efficiently solving optimization problems. Sci World J, 2014
go back to reference Salimi H (2015) Stochastic fractal search: a powerful metaheuristic algorithm. Knowl-Based Syst 75:1–18CrossRef Salimi H (2015) Stochastic fractal search: a powerful metaheuristic algorithm. Knowl-Based Syst 75:1–18CrossRef
go back to reference Savsani P, Savsani V (2016) Passing vehicle search (PVS): A novel metaheuristic algorithm. Appl Math Model 40(5):3951–3978CrossRef Savsani P, Savsani V (2016) Passing vehicle search (PVS): A novel metaheuristic algorithm. Appl Math Model 40(5):3951–3978CrossRef
go back to reference Schwefel H-P (1977) Numerische optimierung von computer-modellen mittels der evolutionsstrategie, vol 1. Birkhuser, BaselMATHCrossRef Schwefel H-P (1977) Numerische optimierung von computer-modellen mittels der evolutionsstrategie, vol 1. Birkhuser, BaselMATHCrossRef
go back to reference Shah-Hosseini H (2008) Intelligent water drops algorithm: a new optimization method for solving the multiple knapsack problem. Int J Intell Comput Cybern 1(2):193–212MathSciNetMATHCrossRef Shah-Hosseini H (2008) Intelligent water drops algorithm: a new optimization method for solving the multiple knapsack problem. Int J Intell Comput Cybern 1(2):193–212MathSciNetMATHCrossRef
go back to reference Sharma MK, Phonrattanasak P, Leeprechanon N (2015) Improved bees algorithm for dynamic economic dispatch considering prohibited operating zones. In: IEEE innovative smart grid technologies-Asia (ISGT ASIA), 2015, IEEE, pp 1–6 Sharma MK, Phonrattanasak P, Leeprechanon N (2015) Improved bees algorithm for dynamic economic dispatch considering prohibited operating zones. In: IEEE innovative smart grid technologies-Asia (ISGT ASIA), 2015, IEEE, pp 1–6
go back to reference Shen H, Zhu Y, Liang X (2014) Lifecycle-based swarm optimization method for numerical optimization. Discret Dyn Nat Soc 2014:11 Shen H, Zhu Y, Liang X (2014) Lifecycle-based swarm optimization method for numerical optimization. Discret Dyn Nat Soc 2014:11
go back to reference Shi Y (2011) Brain storm optimization algorithm. In: International conference in swarm intelligence, Springer, pp 303–309 Shi Y (2011) Brain storm optimization algorithm. In: International conference in swarm intelligence, Springer, pp 303–309
go back to reference Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702–713CrossRef Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702–713CrossRef
go back to reference Spitzer F (2013) Principles of random walk, vol 34. Springer Science & Business Media, New YorkMATH Spitzer F (2013) Principles of random walk, vol 34. Springer Science & Business Media, New YorkMATH
go back to reference Srensen K, Maya Duque P, Vanovermeire C, Castro M (2012) Metaheuristics for the multimodal optimization of hazmat transports. Secur Asp Uni Multimodal Hazmat Transp Syst, 163–181 Srensen K, Maya Duque P, Vanovermeire C, Castro M (2012) Metaheuristics for the multimodal optimization of hazmat transports. Secur Asp Uni Multimodal Hazmat Transp Syst, 163–181
go back to reference Srensen K, Sevaux M, Glover F (2017) A history of metaheuristics. In: ORBEL29-29th Belgian conference on operations research Srensen K, Sevaux M, Glover F (2017) A history of metaheuristics. In: ORBEL29-29th Belgian conference on operations research
go back to reference Storn R, Price K (1997) Differential evolutiona simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359MATHCrossRef Storn R, Price K (1997) Differential evolutiona simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359MATHCrossRef
go back to reference Stützle T (1998) Local search algorithms for combinatorial problems. Darmstadt University of Technology Ph.D. Thesis, 20 Stützle T (1998) Local search algorithms for combinatorial problems. Darmstadt University of Technology Ph.D. Thesis, 20
go back to reference Sulaiman MH, Ibrahim H, Daniyal H, Mohamed MR (2014) A new swarm intelligence approach for optimal chiller loading for energy conservation. Proced-Soc Behav Sci 129:483–488CrossRef Sulaiman MH, Ibrahim H, Daniyal H, Mohamed MR (2014) A new swarm intelligence approach for optimal chiller loading for energy conservation. Proced-Soc Behav Sci 129:483–488CrossRef
go back to reference Sun G, Zhao R, Lan Y (2016) Joint operations algorithm for large-scale global optimization. Appl Soft Comput 38:1025–1039CrossRef Sun G, Zhao R, Lan Y (2016) Joint operations algorithm for large-scale global optimization. Appl Soft Comput 38:1025–1039CrossRef
go back to reference Sur C, Shukla A (2013) New bio-inspired meta-heuristics-green herons optimization algorithm-for optimization of travelling salesman problem and road network. In: International conference on swarm, evolutionary, and memetic computing, Springer, pp 168–179 Sur C, Shukla A (2013) New bio-inspired meta-heuristics-green herons optimization algorithm-for optimization of travelling salesman problem and road network. In: International conference on swarm, evolutionary, and memetic computing, Springer, pp 168–179
go back to reference Tan TG, Teo J, Chin KO (2013) Single-versus multiobjective optimization for evolution of neural controllers in Ms. Pac-man. Int J Comput Games Technol 2013:1–7CrossRef Tan TG, Teo J, Chin KO (2013) Single-versus multiobjective optimization for evolution of neural controllers in Ms. Pac-man. Int J Comput Games Technol 2013:1–7CrossRef
go back to reference Tan Y, Zhu Y (2010) Fireworks algorithm for optimization. In: International conference in swarm intelligence, Springer, pp 355–364 Tan Y, Zhu Y (2010) Fireworks algorithm for optimization. In: International conference in swarm intelligence, Springer, pp 355–364
go back to reference Uddin J, Ghazali R, Deris MM, Naseem R, Shah H (2016) A survey on bug prioritization. Artif Intell Rev 47:145–180CrossRef Uddin J, Ghazali R, Deris MM, Naseem R, Shah H (2016) A survey on bug prioritization. Artif Intell Rev 47:145–180CrossRef
go back to reference Uymaz SA, Tezel G, Yel E (2015) Artificial algae algorithm (AAA) for nonlinear global optimization. Appl Soft Comput 31:153–171CrossRef Uymaz SA, Tezel G, Yel E (2015) Artificial algae algorithm (AAA) for nonlinear global optimization. Appl Soft Comput 31:153–171CrossRef
go back to reference Viveros Jiménez F, Mezura Montes E, Gelbukh A (2009) Adaptive evolution: an efficient heuristic for global optimization. In: Proceedings of the 11th annual conference on genetic and evolutionary computation, ACM, pp 1827–1828 Viveros Jiménez F, Mezura Montes E, Gelbukh A (2009) Adaptive evolution: an efficient heuristic for global optimization. In: Proceedings of the 11th annual conference on genetic and evolutionary computation, ACM, pp 1827–1828
go back to reference Viveros-Jiménez F, León-Borges JA, Cruz-Cortés N (2014) An adaptive single-point algorithm for global numerical optimization. Expert Syst Appl 41(3):877–885CrossRef Viveros-Jiménez F, León-Borges JA, Cruz-Cortés N (2014) An adaptive single-point algorithm for global numerical optimization. Expert Syst Appl 41(3):877–885CrossRef
go back to reference Wang Y (2010) A sociopsychological perspective on collective intelligence in metaheuristic computing. Int J Appl Metaheuristic Comput 1(1):110–128CrossRef Wang Y (2010) A sociopsychological perspective on collective intelligence in metaheuristic computing. Int J Appl Metaheuristic Comput 1(1):110–128CrossRef
go back to reference Wang H, Yao LG, Hua ZZ (2008) Optimization of sheet metal forming processes by adaptive response surface based on intelligent sampling method. J Mater Process Technol 197(1):77–88CrossRef Wang H, Yao LG, Hua ZZ (2008) Optimization of sheet metal forming processes by adaptive response surface based on intelligent sampling method. J Mater Process Technol 197(1):77–88CrossRef
go back to reference Wang R, Zhou Y (2014) Flower pollination algorithm with dimension by dimension improvement. Math Probl Eng 2014:9 Wang R, Zhou Y (2014) Flower pollination algorithm with dimension by dimension improvement. Math Probl Eng 2014:9
go back to reference Wang P, Zhu Z, Huang S (2013) Seven-spot ladybird optimization: a novel and efficient metaheuristic algorithm for numerical optimization. Sci World J 2013:11 Wang P, Zhu Z, Huang S (2013) Seven-spot ladybird optimization: a novel and efficient metaheuristic algorithm for numerical optimization. Sci World J 2013:11
go back to reference Wu HS, Zhang FM (2014) Wolf pack algorithm for unconstrained global optimization. Math Probl Eng, 2014 Wu HS, Zhang FM (2014) Wolf pack algorithm for unconstrained global optimization. Math Probl Eng, 2014
go back to reference Wu G (2016) Across neighborhood search for numerical optimization. Inf Sci 329:597–618CrossRef Wu G (2016) Across neighborhood search for numerical optimization. Inf Sci 329:597–618CrossRef
go back to reference Xu Y, Cui Z, Zeng J (2010) Social emotional optimization algorithm for nonlinear constrained optimization problems. In: SEMCCO, Springer, pp 583–590 Xu Y, Cui Z, Zeng J (2010) Social emotional optimization algorithm for nonlinear constrained optimization problems. In: SEMCCO, Springer, pp 583–590
go back to reference Yang XS, Deb S (2009) Cuckoo search via lévy flights. In: World congress on nature & biologically inspired computing, 2009. NaBIC 2009, IEEE, pp 210–214 Yang XS, Deb S (2009) Cuckoo search via lévy flights. In: World congress on nature & biologically inspired computing, 2009. NaBIC 2009, IEEE, pp 210–214
go back to reference Yang XS, Deb S, Hanne T, He X (2015) Attraction and diffusion in nature-inspired optimization algorithms. Neural Comput Appl, 1–8 Yang XS, Deb S, Hanne T, He X (2015) Attraction and diffusion in nature-inspired optimization algorithms. Neural Comput Appl, 1–8
go back to reference Yang XS (2008) Nature-inspired metaheuristic algorithms. Firefly Algorithm 20:79–90 Yang XS (2008) Nature-inspired metaheuristic algorithms. Firefly Algorithm 20:79–90
go back to reference Yang X-S (2010) A new metaheuristic bat-inspired algorithm. Springer, New York, pp 65–74MATH Yang X-S (2010) A new metaheuristic bat-inspired algorithm. Springer, New York, pp 65–74MATH
go back to reference Yang XS (2011) Metaheuristic optimization: algorithm analysis and open problems. In: International symposium on experimental algorithms, Springer, pp 21–32 Yang XS (2011) Metaheuristic optimization: algorithm analysis and open problems. In: International symposium on experimental algorithms, Springer, pp 21–32
go back to reference Yang XS (2012) Nature-inspired metaheuristic algorithms: success and new challenges. J Comput Eng Inf Technol 1:1–3CrossRef Yang XS (2012) Nature-inspired metaheuristic algorithms: success and new challenges. J Comput Eng Inf Technol 1:1–3CrossRef
go back to reference Yang X-S, Deb S (2014) Cuckoo search: recent advances and applications. Neural Comput Appl 24(1):169–174CrossRef Yang X-S, Deb S (2014) Cuckoo search: recent advances and applications. Neural Comput Appl 24(1):169–174CrossRef
go back to reference Yang F-C, Wang Y-P (2007) Water flow-like algorithm for object grouping problems. J Chin Inst Ind Eng 24(6):475–488 Yang F-C, Wang Y-P (2007) Water flow-like algorithm for object grouping problems. J Chin Inst Ind Eng 24(6):475–488
go back to reference Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102CrossRef Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102CrossRef
go back to reference Yazdani M, Jolai F (2016) Lion optimization algorithm (LOA): a nature-inspired metaheuristic algorithm. J Comput Des Eng 3(1):24–36 Yazdani M, Jolai F (2016) Lion optimization algorithm (LOA): a nature-inspired metaheuristic algorithm. J Comput Des Eng 3(1):24–36
go back to reference Yeh WC, Chung VYY, Jiang YZ, He X (2015) Solving reliability redundancy allocation problems with orthogonal simplified swarm optimization. In: International joint conference on neural networks (IJCNN), 2015, IEEE, pp 1–7 Yeh WC, Chung VYY, Jiang YZ, He X (2015) Solving reliability redundancy allocation problems with orthogonal simplified swarm optimization. In: International joint conference on neural networks (IJCNN), 2015, IEEE, pp 1–7
go back to reference Yin P-Y, Glover F, Laguna M, Zhu J-X (2010) Cyber swarm algorithms-improving particle swarm optimization using adaptive memory strategies. Eur J Oper Res 201(2):377–389MathSciNetMATHCrossRef Yin P-Y, Glover F, Laguna M, Zhu J-X (2010) Cyber swarm algorithms-improving particle swarm optimization using adaptive memory strategies. Eur J Oper Res 201(2):377–389MathSciNetMATHCrossRef
go back to reference Yu X, Gen M (2010) Introduction to evolutionary algorithms. Springer Science & Business Media, New YorkMATHCrossRef Yu X, Gen M (2010) Introduction to evolutionary algorithms. Springer Science & Business Media, New YorkMATHCrossRef
go back to reference Zelinka I (2015) A survey on evolutionary algorithms dynamics and its complexitymutual relations, past, present and future. Swarm Evolut Comput 25:2–14CrossRef Zelinka I (2015) A survey on evolutionary algorithms dynamics and its complexitymutual relations, past, present and future. Swarm Evolut Comput 25:2–14CrossRef
go back to reference Zhang G (2011) Quantum-inspired evolutionary algorithms: a survey and empirical study. J Heuristics 17(3):303–351MATHCrossRef Zhang G (2011) Quantum-inspired evolutionary algorithms: a survey and empirical study. J Heuristics 17(3):303–351MATHCrossRef
go back to reference Zhang M-X, Zhang B, Qian N (2017) University course timetabling using a new ecogeography-based optimization algorithm. Nat Comput 16(1):61–74MathSciNetCrossRef Zhang M-X, Zhang B, Qian N (2017) University course timetabling using a new ecogeography-based optimization algorithm. Nat Comput 16(1):61–74MathSciNetCrossRef
go back to reference Zhao R-Q, Tang W-S (2008) Monkey algorithm for global numerical optimization. J Uncertain Syst 2(3):165–176 Zhao R-Q, Tang W-S (2008) Monkey algorithm for global numerical optimization. J Uncertain Syst 2(3):165–176
go back to reference Zhao W, Wang L (2016) An effective bacterial foraging optimizer for global optimization. Inf Sci 329:719–735CrossRef Zhao W, Wang L (2016) An effective bacterial foraging optimizer for global optimization. Inf Sci 329:719–735CrossRef
go back to reference Zhou W, Chow TWS, Cheng S, Shi Y (2013) Contour gradient optimization. Int J Swarm Intell Res (IJSIR) 4(2):1–28CrossRef Zhou W, Chow TWS, Cheng S, Shi Y (2013) Contour gradient optimization. Int J Swarm Intell Res (IJSIR) 4(2):1–28CrossRef
go back to reference Zhu Y, Dai C, Chen W (2014) Seeker optimization algorithm for several practical applications. Int J Comput Intell Syst 7(2):353–359CrossRef Zhu Y, Dai C, Chen W (2014) Seeker optimization algorithm for several practical applications. Int J Comput Intell Syst 7(2):353–359CrossRef
Metadata
Title
Metaheuristic research: a comprehensive survey
Authors
Kashif Hussain
Mohd Najib Mohd Salleh
Shi Cheng
Yuhui Shi
Publication date
13-01-2018
Publisher
Springer Netherlands
Published in
Artificial Intelligence Review / Issue 4/2019
Print ISSN: 0269-2821
Electronic ISSN: 1573-7462
DOI
https://doi.org/10.1007/s10462-017-9605-z

Other articles of this Issue 4/2019

Artificial Intelligence Review 4/2019 Go to the issue

Premium Partner