Skip to main content
SpringerLink
Log in

A Classification of Hyper-Heuristic Approaches: Revisited

  • Chapter
  • First Online:
Handbook of Metaheuristics

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 272))

Abstract

Hyper-heuristics comprise a set of approaches that aim to automate the development of computational search methodologies. This chapter overviews previous categorisations of hyper-heuristics and provides a unified classification and definition. We distinguish between two main hyper-heuristic categories: heuristic selection and heuristic generation. Some representative examples of each category are discussed in detail and recent research trends are highlighted.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. S. Adriaensen, G. Ochoa, A. Nowé, A benchmark set extension and comparative study for the hyflex framework, in IEEE Congress on Evolutionary Computation, CEC (2015), pp. 784–791

    Google Scholar 

  2. F. Alanazi, P.K. Lehre, Limits to learning in reinforcement learning hyper-heuristics, in European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP. Lecture Notes in Computer Science, vol. 9595 (2016), pp. 170–185

    Google Scholar 

  3. S. Asta, E. Özcan, A tensor-based selection hyper-heuristic for cross-domain heuristic search. Inf. Sci. 299, 412–432 (2015)

    Google Scholar 

  4. S. Asta, E. Özcan, A.J. Parkes, CHAMP: creating heuristics via many parameters for online bin packing. Exp. Syst. Appl. 63, 208–221 (2016)

    Google Scholar 

  5. M. Bader-El-Den, R. Poli, Generating SAT local-search heuristics using a GP hyper-heuristic framework, in Artificial Evolution Conference, EA. Lecture Notes in Computer Science, vol. 4926 (2007), pp. 37–49

    Google Scholar 

  6. R. Bai, E.K. Burke, G. Kendall, Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation. J. Oper. Res. Soc. 59(10), 1387–1397 (2008)

    Google Scholar 

  7. R. Bai, J. Blazewicz, E.K. Burke, G. Kendall, B. McCollum, A simulated annealing hyper-heuristic methodology for flexible decision support. 4OR Quart. J. Oper. Res. 10(1), 43–66 (2012)

    Google Scholar 

  8. R. Bai, E.K. Burke, G. Kendall, T. van Woensel, A new model and a hyper-heuristic approach for two-dimensional shelf space allocation. 4OR Quart. J. Oper. Res. 11(1), 31–55 (2013)

    Google Scholar 

  9. B. Bilgin, E. Özcan, E.E. Korkmaz, An experimental study on hyper-heuristics and exam timetabling, in Practice and Theory of Automated Timetabling, PATAT. Lecture Notes in Computer Science, vol. 3867 (2007), pp. 394–412

    Google Scholar 

  10. J. Blazewicz, E.K. Burke, G. Kendall, W. Mruczkiewicz, C. Öguz, A. Swiercz, A hyper-heuristic approach to sequencing by hybridization of DNA sequences. Ann. Oper. Res. 207(1), 27–41 (2013)

    Google Scholar 

  11. J. Branke, S. Nguyen, C. Pickardt, M. Zhang, Automated design of production scheduling heuristics: a review. IEEE Trans. Evol. Comput. 20(1), 110–124 (2016)

    Google Scholar 

  12. E.K. Burke, J. Newall, Solving examination timetabling problems through adaptation of heuristic orderings. Ann. Oper. Res. 129(1–4), 107–134 (2004)

    Google Scholar 

  13. E.K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, S. Schulenburg, Hyper-heuristics: an emerging direction in modern search technology, in Handbook of Metaheuristics, ed. by F. Glover, G. Kochenberger (Kluwer, Dordecht, 2003), pp. 457–474

    Google Scholar 

  14. E.K. Burke, G. Kendall, E. Soubeiga, A tabu-search hyperheuristic for timetabling and rostering. J. Heuristics 9(6), 451–470 (2003)

    Google Scholar 

  15. E.K. Burke, S. Petrovic, R. Qu, Case based heuristic selection for timetabling problems. J. Sched. 9(2), 115–132 (2006)

    Google Scholar 

  16. E.K. Burke, M.R. Hyde, G. Kendall, Evolving bin packing heuristics with genetic programming, in Parallel Problem Solving from Nature, PPS. Lecture Notes in Computer Science, vol. 4193 (2006), pp. 860–869

    Google Scholar 

  17. E.K. Burke, M.R. Hyde, G. Kendall, J. Woodward, Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one, in Genetic and Evolutionary Computation Conference, GECCO (2007), pp. 1559–1565

    Google Scholar 

  18. E.K. Burke, M.R. Hyde, G. Kendall, J.R. Woodward, The scalability of evolved on line bin packing heuristics, in IEEE Congress on Evolutionary Computation, CEC (2007), pp. 2530–2537

    Google Scholar 

  19. E.K. Burke, B. McCollum, A. Meisels, S. Petrovic, R. Qu, A graph-based hyper-heuristic for educational timetabling problems. Eur. J. Oper. Res. 176(1), 177–192 (2007)

    Google Scholar 

  20. E.K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Özcan, J. Woodward, Exploring hyper-heuristic methodologies with genetic programming, in Collaborative Computational Intelligence, ed. by C. Mumford, L. Jain (Springer, Berlin, 2009), pp. 177–201

    Google Scholar 

  21. E.K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Özcan, J.R. Woodward, A Classification of Hyper-Heuristic Approaches (Springer, Boston, 2010), pp. 449–468

    Google Scholar 

  22. E.K. Burke, M.R. Hyde, G. Kendall, J.R. Woodward, A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics. IEEE Trans. Evol. Comput. 14(6), 942–958 (2010)

    Google Scholar 

  23. E.K. Burke, G. Kendall, M. Misir, E. Özcan, Monte Carlo hyper-heuristics for examination timetabling. Ann. Oper. Res. 196(1), 73–90 (2012)

    Google Scholar 

  24. E.K. Burke, M.R. Hyde, G. Kendall, Grammatical evolution of local search heuristics. IEEE Trans. Evol. Comput. 16(3), 406–417 (2012)

    Google Scholar 

  25. E.K. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, R. Qu, Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 695–1724 (2013)

    Google Scholar 

  26. A.W. Burnett, A.J. Parkes, Exploring the landscape of the space of heuristics for local search in SAT, in IEEE Congress on Evolutionary Computation CEC (2017), pp. 2518–2525

    Google Scholar 

  27. K. Chakhlevitch, P.I. Cowling, Hyperheuristics: recent developments, in Adaptive and Multilevel Metaheuristics. Studies in Computational Intelligence, vol. 136 (Springer, Berlin, 2008), pp. 3–29

    Google Scholar 

  28. P. Cowling, G. Kendall, E. Soubeiga, A hyperheuristic approach for scheduling a sales summit, in Selected Papers of the Third International Conference on the Practice and Theory of Automated Timetabling, PATAT 2000. Lecture Notes in Computer Science (2001)

    Google Scholar 

  29. P. Cowling, G. Kendall, L. Han, An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem, in IEEE Congress on Evolutionary Computation, CEC (2002), pp. 1185–1190

    Google Scholar 

  30. W.B. Crowston, F. Glover, G.L. Thompson, J.D. Trawick, Probabilistic and parametric learning combinations of local job shop scheduling rules. ONR research memorandum, Carnegie-Mellon University, Pittsburgh (1963)

    Google Scholar 

  31. K. Deb, A. Pratap, S. Agarwal, T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Google Scholar 

  32. J. Denzinger, M. Fuchs, M. Fuchs, High performance ATP systems by combining several AI methods, in International Joint Conference on Artificial Intelligence IJCAI (1997), pp. 102–107

    Google Scholar 

  33. C. Dimopoulos, A.M.S. Zalzala, Investigating the use of genetic programming for a classic one-machine scheduling problem. Adv. Eng. Softw. 32(6), 489–498 (2001)

    Google Scholar 

  34. K.A. Dowsland, E. Soubeiga, E.K. Burke, A simulated annealing hyper-heuristic for determining shipper sizes. Eur. J. Oper. Res. 179(3), 759–774 (2007)

    Google Scholar 

  35. A. Elyasaf, A. Hauptman, M. Sipper, Evolutionary design of freecell solvers. IEEE Trans. Comput. Intell. AI Games 4(4), 270–281 (2012)

    Google Scholar 

  36. H.L. Fang, P. Ross, D. Corne, A promising genetic algorithm approach to job shop scheduling, rescheduling, and open-shop scheduling problems, in International Conference on Genetic Algorithms, ICGA (1993), pp. 375–382

    Google Scholar 

  37. H.L. Fang, P. Ross, D. Corne, A promising hybrid GA/heuristic approach for open-shop scheduling problems, in European Conference on Artificial Intelligence, ECAI (1994)

    Google Scholar 

  38. H. Fisher, G.L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in Factory Scheduling Conference. Carnegie Institue of Technology (1961)

    Google Scholar 

  39. H. Fisher, G.L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in Industrial Scheduling, ed. by J.F. Muth, G.L. Thompson (Cengage Learning, Boston, 1963)

    Google Scholar 

  40. A.S. Fukunaga, Automated discovery of composite SAT variable selection heuristics, in AAAI Conference on Artificial Intelligence (2002), pp. 641–648

    Google Scholar 

  41. A.S. Fukunaga, Evolving local search heuristics for SAT using genetic programming, in Genetic and Evolutionary Computation, GECCO (2004), pp. 483–494

    Google Scholar 

  42. A.S. Fukunaga, Automated discovery of local search heuristics for satisfiability testing. Evol. Comput. J. 16(1), 31–61 (2008)

    Google Scholar 

  43. P. Garrido, M.C. Riff, DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic. J. Heuristics 16(6), 795–834 (2010)

    Google Scholar 

  44. C.D. Geiger, R. Uzsoy, H. Aytŭg, Rapid modeling and discovery of priority dispatching rules: an autonomous learning approach. J. Sched. 9(1), 7–34 (2006)

    Google Scholar 

  45. J. Gratch, S. Chien, Adaptive problem-solving for large-scale scheduling problems: a case study. J. Artif. Intell. Res. 4(1), 365–396 (1996)

    Google Scholar 

  46. J. Grobler, A.P. Engelbrecht, G. Kendall, V.S.S. Yadavalli, Heuristic space diversity control for improved meta-hyper-heuristic performance. Inf. Sci. 300, 49–62 (2015)

    Google Scholar 

  47. P. Hansen, N. Mladenovic, Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001)

    Google Scholar 

  48. E. Hart, K. Sim, A hyper-heuristic ensemble method for static job-shop scheduling. Evol. Comput. J. 24(4), 609–635 (2016)

    Google Scholar 

  49. E. Hart, P. Ross, J.A.D. Nelson, Solving a real-world problem using an evolving heuristically driven schedule builder. Evol. Comput. J. 6(1), 61–80 (1998)

    Google Scholar 

  50. J. He, F. He, H. Dong, Pure strategy or mixed strategy?, in European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP. Lecture Notes in Computer Science, vol. 7245 (2012), pp. 218–229

    Google Scholar 

  51. Y. Jia, M.B. Cohen, M. Harman, J. Petke, Learning combinatorial interaction test generation strategies using hyperheuristic search, in IEEE/ACM International Conference on Software Engineering, ICSE (2015), pp. 540–550

    Google Scholar 

  52. R.E. Keller, R. Poli, Cost-benefit investigation of a genetic-programming hyperheuristic, in Artificial Evolution Conference, EA. Lecture Notes in Computer Science, vol. 4926 (2007), pp. 13–24

    Google Scholar 

  53. R.E. Keller, R. Poli, Linear genetic programming of parsimonious metaheuristics, in IEEE Congress on Evolutionary Computation, CEC (2007), pp. 4508–4515

    Google Scholar 

  54. G. Kendall, J. Li, Competitive travelling salesmen problem: a hyper-heuristic approach. J. Oper. Res. Soc. 64(2), 208–216 (2013)

    Google Scholar 

  55. R.H. Kibria, Y. Li, Optimizing the initialization of dynamic decision heuristics in DPLL SAT solvers using genetic programming, in European Conference on Genetic Programming, EuroGP. Lecture Notes in Computer Science, vol. 3905 (2006), pp. 331–340

    Google Scholar 

  56. N. Krasnogor, S. Maturana Gustafson, A study on the use of “self-generation” in memetic algorithms. Nat. Comput. 3(1), 53–76 (2004)

    Google Scholar 

  57. P.K. Lehre, E. Özcan, A runtime analysis of simple hyper-heuristics: to mix or not to mix operators, in Workshop on Foundations of Genetic Algorithms, FOGA XII (2013), pp. 97–104

    Google Scholar 

  58. J. Li, G. Kendall, A hyper-heuristic methodology to generate adaptive strategies for games. IEEE Trans. Comput. Intell. AI Games 9(1), 1–10 (2017)

    Google Scholar 

  59. W. Li, E. Özcan, R. John, Multi-objective evolutionary algorithms and hyper-heuristics for wind farm layout optimisation. Renew. Energy 105, 473–482 (2017)

    Google Scholar 

  60. E. Lopez-Camacho, H. Terashima-Marin, P. Ross, G. Ochoa, A unified hyper-heuristic framework for solving bin packing problems. Exp. Syst. Appl. 41(15), 6876–6889 (2014)

    Google Scholar 

  61. M. Maashi, G. Kendall, E. Özcan, Choice function based hyper-heuristics for multi-objective optimization. Appl. Soft Comput. 28, 312–326 (2015)

    Google Scholar 

  62. J.G. Marin-Blazquez, S. Schulenburg, A hyper-heuristic framework with XCS: learning to create novel problem-solving algorithms constructed from simpler algorithmic ingredients, in Learning Classifier Systems. Lecture Notes in Computer Science, vol. 4399 (2007), pp. 193–218

    Google Scholar 

  63. J. Maturana, F. Lardeux, F. Saubion, Autonomous operator management for evolutionary algorithms. J. Heuristics 16(6), 881–909 (2010)

    Google Scholar 

  64. J. Mockus, L. Mockus, Bayesian approach to global optimization and applications to multi-objective constrained problems. J. Optim. Theory Appl. 70(1), 155–171 (1991)

    Google Scholar 

  65. A. Nareyek, Choosing search heuristics by non-stationary reinforcement learning, in Metaheuristics: Computer Decision-Making, ed. by M.G.C. Resende, J.P. de Sousa, Chap. 9 (Kluwer, Dordecht, 2003), pp. 523–544

    Google Scholar 

  66. G. Ochoa, M. Hyde, The cross-domain heuristic search challenge (CHeSC 2011) (2011). http://www.asap.cs.nott.ac.uk/chesc2011/

  67. G. Ochoa, R. Qu, E.K. Burke, Analyzing the landscape of a graph based hyper-heuristic for timetabling problems, in Genetic and Evolutionary Computation Conference, GECCO (2009), pp. 341–348

    Google Scholar 

  68. G. Ochoa, M. Hyde, T. Curtois, J.A. Vazquez-Rodriguez, J. Walker, M. Gendreau, G. Kendall, A.J. Parkes, S. Petrovic, E.K. Burke, Hyflex: a benchmark framework for cross-domain heuristic search, in European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP. Lecture Notes in Computer Science, vol. 7245 (2012), pp. 136–147

    Google Scholar 

  69. G. Ochoa, J. Walker, M. Hyde, T. Curtois, Adaptive evolutionary algorithms and extensions to the hyflex hyper-heuristic framework, in Parallel Problem Solving from Nature, PPSN XI (2012), pp. 418–427

    Google Scholar 

  70. M. Oltean, Evolving evolutionary algorithms using linear genetic programming. Evol. Comput. J. 13(3), 387–410 (2005)

    Google Scholar 

  71. E. Özcan, B. Bilgin, E.E. Korkmaz, Hill climbers and mutational heuristics in hyperheuristics, in Parallel Problem Solving from Nature, PPSN. Lecture Notes in Computer Science, vol. 4193 (2006), pp. 202–211

    Google Scholar 

  72. E. Özcan, B. Bilgin, E.E. Korkmaz, A comprehensive analysis of hyper-heuristics. Intell. Data Anal. 12(1), 3–23 (2008)

    Google Scholar 

  73. E. Özcan, A.J. Parkes, Policy matrix evolution for generation of heuristics, in Genetic and Evolutionary Computation, GECCO (2011), pp. 2011–2018

    Google Scholar 

  74. N. Pillay, A review of hyper-heuristics for educational timetabling. Ann. Oper. Res. 239(1), 3–38 (2016)

    Google Scholar 

  75. D. Pisinger, S. Ropke, A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007)

    Google Scholar 

  76. R. Qu, E.K. Burke, Hybridisations within a graph based hyper-heuristic framework for university timetabling problems. J. Oper. Res. Soc. 60, 1273–1285 (2009)

    Google Scholar 

  77. S. Remde, P. Cowling, K. Dahal, N. Colledge, E. Selensky, An empirical study of hyperheuristics for managing very large sets of low level heuristics. J. Oper. Res. Soc. 63(3), 392–345 (2012)

    Google Scholar 

  78. S. Ropke, D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)

    Google Scholar 

  79. P. Ross, Hyper-heuristics, in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, ed. by E.K. Burke, G. Kendall, Chap. 17 (Springer, Berlin, 2005), pp. 529–556

    Google Scholar 

  80. P. Ross, J.G. Marín-Blázquez, Constructive hyper-heuristics in class timetabling, in IEEE Congress on Evolutionary Computation, CEC (2005), pp. 1493–1500

    Google Scholar 

  81. P. Ross, S. Schulenburg, J.G. Marin-Blazquez, E. Hart, Hyper-heuristics: learning to combine simple heuristics in bin-packing problem, in Genetic and Evolutionary Computation Conference, GECCO (2002), pp. 942–948

    Google Scholar 

  82. P. Ross, J.G. Marin-Blazquez, E. Hart, Hyper-heuristics applied to class and exam timetabling problems, in IEEE Congress on Evolutionary Computation, CEC (2004), pp. 1691–1698

    Google Scholar 

  83. N.R. Sabar, G. Kendall, Population based Monte Carlo tree search hyper-heuristic for combinatorial optimization problems. Inf. Sci. 314, 225–239 (2015)

    Google Scholar 

  84. N.R. Sabar, M. Ayob, R. Qu, G. Kendall, A graph coloring constructive hyper-heuristic for examination timetabling problems. Appl. Intell. 37(1), 1–11 (2012)

    Google Scholar 

  85. N.R. Sabar, M. Ayob, G. Kendall, R. Qu, Grammatical evolution hyper-heuristic for combinatorial optimization problems. IEEE Trans. Evol. Comput. 17(6), 840–861 (2013)

    Google Scholar 

  86. N.R. Sabar, M. Ayob, G. Kendall, R. Qu, Automatic design of hyper-heuristic framework with gene expression programming for combinatorial optimization problems. IEEE Trans. Evol. Comput. 19(3), 309–325 (2015)

    Google Scholar 

  87. N.R. Sabar, M. Ayob, G. Kendall, R. Qu, A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems. IEEE Trans. Cybern. 45(2), 217–228 (2015)

    Google Scholar 

  88. K. Sim, E. Hart, A combined generative and selective hyper-heuristic for the vehicle routing problem, in Genetic and Evolutionary Computation Conference, GECCO (2016), pp. 1093–1100

    Google Scholar 

  89. K. Sim, E. Hart, B. Paechter, A lifelong learning hyper-heuristic method for bin packing. Evol. Comput. J. 23(1), 37–67 (2015)

    Google Scholar 

  90. J.A. Soria-Alcaraz, G. Ochoa, J. Swan, M. Carpio, H. Puga, E.K. Burke, Effective learning hyper-heuristics for the course timetabling problem. Eur. J. Oper. Res. 238(1), 7–86 (2014)

    Google Scholar 

  91. J.A. Soria-Alcaraza, E. Özcan, J. Swan, G. Kendall, M. Carpio, Iterated local search using an add and delete hyper-heuristic for university course timetabling. Appl. Soft Comput. 40, 581–593 (2016)

    Google Scholar 

  92. J.A. Soria-Alcaraz, G. Ochoa, M.A. Sotelo-Figeroa, E.K. Burke, A methodology for determining an effective subset of heuristics in selection hyper-heuristics. Eur. J. Oper. Res. 260(3), 972–983 (2017)

    Google Scholar 

  93. A. Sosa-Ascencio, G. Ochoa, H. Terashima-Marin, S.E. Conant-Pablos, Grammar-based generation of variable-selection heuristics for constraint satisfaction problems. Genet. Program Evolvable Mach. 17(2), 119–144 (2016)

    Google Scholar 

  94. E. Soubeiga, Development and application of hyperheuristics to personnel scheduling. Ph.D. Thesis, School of Computer Science and Information Technology, University of Nottingham, 2003

    Google Scholar 

  95. R.H. Storer, S.D. Wu, R. Vaccari, Problem and heuristic space search strategies for job shop scheduling. ORSA J. Comput. 7(4), 453–467 (1995)

    Google Scholar 

  96. J. Swan, J.R. Woodward, E. Özcan, G. Kendall, E.K. Burke, Searching the hyper-heuristic design space. Cogn. Comput. 6(1), 66–73 (2014)

    Google Scholar 

  97. J.C. Tay, N.B. Ho, Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput. Ind. Eng. 54(3), 453–473 (2008)

    Google Scholar 

  98. H. Terashima-Marin, P. Ross, M. Valenzuela-Rendon, Evolution of constraint satisfaction strategies in examination timetabling, in Genetic and Evolutionary Computation Conference, GECCO (1999), pp. 635–642

    Google Scholar 

  99. H. Terashima-Marin, E.J. Flores-Alvarez, P. Ross, Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems, in Genetic and Evolutionary Computation Conference, GECCO (2005), pp. 637–643

    Google Scholar 

  100. H. Terashima-Marin, A. Moran-Saavedra, P. Ross, Forming hyper-heuristics with GAs when solving 2D-regular cutting stock problems, in IEEE Congress on Evolutionary Computation, CEC, vol. 2 (2005), pp. 1104–1110

    Google Scholar 

  101. J.A. Vazquez-Rodriguez, S. Petrovic, A. Salhi, A combined meta-heuristic with hyper-heuristic approach to the scheduling of the hybrid flow shop with sequence dependent setup times and uniform machines, in Multidisciplinary International Scheduling Conference: Theory and Applications, MISTA (2007), pp. 506–513

    Google Scholar 

  102. J.A. Vrugt, B.A. Robinson, Improved evolutionary optimization from genetically adaptive multimethod search. Proc. Natl. Acad. Sci. 104(3), 708–711 (2007)

    Google Scholar 

  103. X. Wu, P.A. Consoli, L.L. Minku, G. Ochoa, X. Yao, An evolutionary hyper-heuristic for the software project scheduling problem, in Parallel Problem Solving from Nature, PPSN XIV (2016), pp. 37–47

    Google Scholar 

  104. K.Z. Zamil, F. Din, G. Kendall, B.S. Ahmed, An experimental study of hyper-heuristic selection and acceptance mechanism for combinatorial t-way test suite generation. Inf. Sci. 399, 121–153 (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Leicester, Leicester, UK

    Edmund K. Burke

  2. Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, University of Nottingham, Nottingham, UK

    Matthew R. Hyde & Ender Özcan

  3. University of Nottingham Malaysia Campus, Semenyih, Malaysia

    Graham Kendall

  4. Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, University of Nottingham, Nottingham, UK

    Graham Kendall

  5. Computing Science and Mathematics, University of Stirling, Stirling, UK

    Gabriela Ochoa

  6. Queen Mary University of London, London, UK

    John R. Woodward

Authors
  1. Edmund K. Burke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthew R. Hyde
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Graham Kendall
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gabriela Ochoa
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ender Özcan
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. John R. Woodward
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Edmund K. Burke .

Editor information

Editors and Affiliations

  1. Department of Mathematics and Industrial Engineering, Polytechnique Montréal, Montreal, QC, Canada

    Michel Gendreau

  2. Département d’informatique et de recherche opérationnelle, Université de Montréal, Montreal, QC, Canada

    Jean-Yves Potvin

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., Özcan, E., Woodward, J.R. (2019). A Classification of Hyper-Heuristic Approaches: Revisited. In: Gendreau, M., Potvin, JY. (eds) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol 272. Springer, Cham. https://doi.org/10.1007/978-3-319-91086-4_14

Download citation

Publish with us

Policies and ethics

Search

Navigation