The DOI matches its Crossref record; 156 of the 156 references it cites were found in a registry or an index.
Hyper-heuristics: a survey of the state of the art
Open accessAbstract
Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the goal of automating the design of heuristic methods to solve hard computational search problems. An underlying strategic research challenge is to develop more generally applicable search methodologies. The term hyper-heuristic is relatively new; it was first used in 2000 to describe heuristics to choose heuristics in the context of combinatorial optimisation. However, the idea of automating the design of heuristics is not new; it can be traced back to the 1960s. The definition of hyper-heuristics has been recently extended to refer to a search method or learning mechanism for selecting or generating heuristics to solve computational search problems. Two main hyper-heuristic categories can be considered: heuristic selection and heuristic generation. The distinguishing feature of hyper-heuristics is that they operate on a search space of heuristics (or heuristic components) rather than directly on the search space of solutions to the underlying problem that is being addressed. This paper presents a critical discussion of the scientific literature on hyper-heuristics including their origin and intellectual roots, a detailed account of the main types of approaches, and an overview of some related areas. Current research trends and directions for future research are also discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
Optimization of Control Parameters for Genetic Algorithms
Grefenstette, J. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289288 · Cited by 2,854
Greedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,778
Optimization—Theory and Applications
Cesari, L. (1983) · Springer eBooks · doi:10.1007/978-1-4613-8165-5 · Cited by 2,559
Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution
Rechenberg, I. (1973) · Frommann-Holzboog eBooks · Cited by 2,440
Greedy Randomized Adaptive Search Procedures
Resende, M. G. C., & Ribeiro, C. C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_8 · Cited by 2,310
Parameter control in evolutionary algorithms
Eiben, A. E., Hinterding, R., & Michalewicz, Z. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771166 · Cited by 1,980
Genetic programming II: Automatic discovery of reusable programs
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90099-3 · Cited by 1,901
Bleiholder, J., & Naumann, F. (2009) · ACM Computing Surveys · doi:10.1145/1456650.1456651 · Cited by 1,838
A general heuristic for vehicle routing problems
Pisinger, D., & Ropke, S. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.09.012 · Cited by 1,443
Classifier Fitness Based on Accuracy
Wilson, S. W. (1995) · Evolutionary Computation · doi:10.1162/evco.1995.3.2.149 · Cited by 1,388
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
Shaw, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49481-2_30 · Cited by 1,366
Stochastic Local Search: Foundations & Applications
Hoos, H. H., & St�tzle, T. (2004) · Medical Entomology and Zoology · Cited by 1,227
The Algorithm Selection Problem
Rice, J. R. (1976) · Advances in Computers · doi:10.1016/s0065-2458(08)60520-3 · Cited by 1,195
(2004) · Lecture Notes in Computer Science · doi:10.1007/b100601 · Cited by 1,147
Messy genetic algorithms: motivation, analysis, and first results
Goldberg, D. E., Korb, B., & Deb, K. (1989) · Complex Systems · Cited by 1,127
(2004) · Lecture Notes in Computer Science · doi:10.1007/b98643 · Cited by 957
Case-Based Reasoning: Experiences, Lessons and Future Directions
Leake, D. B. (1996) · Cumulative Index of Computer Aided Architectural Design · Cited by 888
ParamILS: An Automatic Algorithm Configuration Framework
Hutter, F., Hoos, H. H., Leyton-Brown, K., & Stuetzle, T. (2009) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2861 · Cited by 882
(2005) · doi:10.1007/0-387-28356-0 · Cited by 853
Evolutionary Optimization in Dynamic Environments
Branke, J. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4615-0911-0 · Cited by 829
Dueck, G. (1993) · Journal of Computational Physics · doi:10.1006/jcph.1993.1010 · Cited by 765
Schwefel, H.-P. (1977) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-5927-1 · Cited by 729
Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules
Fisher, H. F. (1963) · Medical Entomology and Zoology · Cited by 729
Convergence of an annealing algorithm
Lundy, M., & Mees, A. (1986) · Mathematical Programming · doi:10.1007/bf01582166 · Cited by 693
Hyper-Heuristics: An Emerging Direction in Modern Search Technology
Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., & Schulenburg, S. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_16 · Cited by 665
Self-citationMeta-Lamarckian Learning in Memetic Algorithms
Ong, Y. S., & Keane, A. J. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819944 · Cited by 657
Improved evolutionary optimization from genetically adaptive multimethod search
Vrugt, J. A., & Robinson, B. A. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0610471104 · Cited by 614
Cross-disciplinary perspectives on meta-learning for algorithm selection
Smith-Miles, K. A. (2009) · ACM Computing Surveys · doi:10.1145/1456650.1456656 · Cited by 552
New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
Storer, R. H., Wu, S. D., & Vaccari, R. (1992) · Management Science · doi:10.1287/mnsc.38.10.1495 · Cited by 546
Classification of adaptive memetic algorithms: a comparative study
Ong, Y.-S., Lim, M.-H., Zhu, N., & Wong, K.-W. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2005.856143 · Cited by 514
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Burke, E. K., Kendall, G., & Soubeiga, E. (2003) · Journal of Heuristics · doi:10.1023/b:heur.0000012446.94732.b6 · Cited by 509
Self-citationA graph-based hyper-heuristic for educational timetabling problems
Burke, E. K., McCollum, B., Meisels, A., Petrovic, S., & Qu, R. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.08.012 · Cited by 507
Self-citationA Racing Algorithm for Configuring Metaheuristics
Birattari, M., Stützle, T., Paquete, L., & Varrentrapp, K. (2002) · Cited by 498
2011 IEEE Congress of Evolutionary Computation (CEC)
(2011) · doi:10.1109/cec15497.2011 · Cited by 487
Tay, J. C., & Ho, N. B. (2008) · Computers & Industrial Engineering · doi:10.1016/j.cie.2007.08.008 · Cited by 471
Modern Heuristic Search Methods
Rayward-Smith, V. J., Osman, I. H., Reeves, C. R., & Smith, G. D. (1996) · Cited by 459
Recent Advances in Memetic Algorithms
Hart, W. E., Smith, J. E., & Krasnogor, N. (2005) · Springer eBooks · doi:10.1007/3-540-32363-5 · Cited by 446
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
Adenso-Díaz, B., & Laguna, M. (2006) · Operations Research · doi:10.1287/opre.1050.0243 · Cited by 435
2000 Genetic and Evolutionary Computation Conference (GECCO-2000)
智晴, 中. (2000) · システム/制御/情報 : システム制御情報学会誌 · doi:10.11509/isciesci.44.10_611 · Cited by 422
Parameter Setting in Evolutionary Algorithms
(2007) · Studies in Computational Intelligence · doi:10.1007/978-3-540-69432-8 · Cited by 422
An Economics Approach to Hard Computational Problems
Huberman, B. A., Lukose, R. M., & Hogg, T. (1997) · Science · doi:10.1126/science.275.5296.51 · Cited by 390
NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE
Hilton, W. (1983) · Cited by 376
Journal of Artificial Intelligence Research (JAIR)
Minton, S. (1993) · Cited by 331
Scatter Search: Methodology and Implementations in C
(2003) · Operations Research/Computer Science Interfaces Series · doi:10.1007/978-1-4615-0337-8 · Cited by 316
Exploring Hyper-heuristic Methodologies with Genetic Programming
Burke, E. K., Hyde, M. R., Kendall, G., Ochoa, G., Ozcan, E., & Woodward, J. R. (2009) · Intelligent Systems Reference Library · doi:10.1007/978-3-642-01799-5_6 · Cited by 304
Self-citationCorr, P. G., McCollum, B., McGreevy, M. A. J., & McMullan, P. (2006) · Lecture notes in computer science · doi:10.1007/11844297 · Cited by 299
Glover, F., Laguna, M., & Martı́, R. (2003) · Cited by 297
Fang, H.-L., Ross, P. D., & Corne, D. (1993) · Cited by 254
A comprehensive analysis of hyper-heuristics
Özcan, E., Bilgin, B., & Korkmaz, E. E. (2008) · Intelligent Data Analysis · doi:10.3233/ida-2008-12102 · Cited by 246
Self-citationAutomatic algorithm configuration based on local search
Hutter, F., Hoos, H. H., & Stützle, T. (2007) · Cited by 240
Using Experimental Design to Find Effective Parameter Settings for Heuristics
Coy, S. P., Golden, B. L., Runger, G. C., & Wasil, E. A. (2001) · Journal of Heuristics · doi:10.1023/a:1026569813391 · Cited by 228
Case-based heuristic selection for timetabling problems
Burke, E. K., Petrovic, S., & Qu, R. (2006) · Journal of Scheduling · doi:10.1007/s10951-006-6775-y · Cited by 223
Self-citationSqueaky Wheel OptimizationPreprint
Clements, D. P., & Joslin, D. E. (2011) · arXiv (Cornell University) · doi:10.1613/jair.561 · Cited by 221
2013 IEEE Congress on Evolutionary Computation
(2013) · doi:10.1109/cec20747.2013 · Cited by 220
Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach
Geiger, C. D., Uzsoy, R., & Aytuğ, H. (2006) · Journal of Scheduling · doi:10.1007/s10951-006-5591-8 · Cited by 217
Koza, J. R., & Poli, R. (2006) · Search Methodologies · doi:10.1007/0-387-28356-0_5 · Cited by 216
Operator and parameter adaptation in genetic algorithms
Smith, J. E., & Fogarty, T. C. (1997) · Soft Computing · doi:10.1007/s005000050009 · Cited by 215
Dumitrescu, D., Lazzerini, B., Jain, L. C., & Dumitrescu, A. (2000) · CRC Press eBooks · doi:10.1201/9781482273960 · Cited by 203
Multimeme Algorithms for Protein Structure Prediction
Krasnogor, N., Blackburne, B. P., Burke, E. K., & Hirst, J. D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45712-7_74 · Cited by 182
Self-citationJulstrom, B. A. (1995) · international conference on Genetic algorithms · Cited by 178
Birattari, M. (2009) · Studies in Computational Intelligence · doi:10.1007/978-3-642-00483-4 · Cited by 176
Adapting Operator Settings in Genetic Algorithms
Tuson, A., & Ross, P. (1998) · Evolutionary Computation · doi:10.1162/evco.1998.6.2.161 · Cited by 175
Coevolving Memetic Algorithms: A Review and Progress Report
Smith, J. E. (2007) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2006.883273 · Cited by 169
Parallel Strategies for Meta-Heuristics
Crainic, T. G., & Toulouse, M. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_17 · Cited by 166
Hyperheuristics: Recent Developments
Chakhlevitch, K., & Cowling, P. (2008) · Studies in Computational Intelligence · doi:10.1007/978-3-540-79438-7_1 · Cited by 162
Automatically configuring constraint satisfaction programs: A case study
Minton, S. (1996) · Constraints · doi:10.1007/bf00143877 · Cited by 148
Choosing Search Heuristics by Non-Stationary Reinforcement Learning
Nareyek, A. (2003) · Applied optimization · doi:10.1007/978-1-4757-4137-7_25 · Cited by 146
Dowsland, K. A., Soubeiga, E., & Burke, E. K. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.03.058 · Cited by 146
Self-citationAutomated Discovery of Local Search Heuristics for Satisfiability Testing
Fukunaga, A. S. (2008) · Evolutionary Computation · doi:10.1162/evco.2008.16.1.31 · Cited by 146
Evolving Bin Packing Heuristics with Genetic Programming
Burke, E. K., Hyde, M. R., & Kendall, G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11844297_87 · Cited by 144
Self-citationThe Conference on Uncertainty in Artificial Intelligence (UAI 2017)
Belle, V. (2017) · Cited by 139
A Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics
Burke, E. K., Hyde, M., Kendall, G., & Woodward, J. R. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2041061 · Cited by 137
Self-citationHyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems
Ross, P. D., Schulenburg, S., Marín-Blázquez, J. G., & Hart, E. (2002) · Edinburgh Napier Research Repository (Edinburgh Napier University) · Cited by 136
Ross, P. D. (2006) · Springer eBooks · doi:10.1007/0-387-28356-0_17 · Cited by 134
Evolving Evolutionary Algorithms Using Linear Genetic Programming
Oltean, M. (2005) · Evolutionary Computation · doi:10.1162/1063656054794815 · Cited by 133
A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling
Özcan, E., Mısır, M., Ochoa, G., & Burke, E. K. (2010) · International Journal of Applied Metaheuristic Computing · doi:10.4018/jamc.2010102603 · Cited by 131
Self-citationThe problem of tuning metaheuristics as seen from a machine learning perspective
Birattari, M., & Dorigo, M. (2004) · Cited by 128
Adaptive and Multilevel Metaheuristics
Cotta, C., Sevaux, M., & Sörensen, K. (2008) · Studies in computational intelligence · doi:10.1007/978-3-540-79438-7 · Cited by 124
Best-Fit Bin-Packing with Random Order
Mathieu, C. (1995) · HAL · Cited by 123
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. (2007) · Proceedings of the 9th annual conference on Genetic and evolutionary computation · doi:10.1145/1276958.1277273 · Cited by 121
Self-citationHybridizations within a graph-based hyper-heuristic framework for university timetabling problems
Qu, R., & Burke, E. K. (2008) · Journal of the Operational Research Society · doi:10.1057/jors.2008.102 · Cited by 120
Self-citationAutomating the Packing Heuristic Design Process with Genetic Programming
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. R. (2011) · Evolutionary Computation · doi:10.1162/evco_a_00044 · Cited by 114
Self-citationA Bayesian Approach to Tackling Hard Computational ProblemsPreprint
Horvitz, E., Ruan, Y., Gomes, C. P., Kautz, H., Selman, B., & Chickering, D. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2279 · Cited by 114
Extreme Value Based Adaptive Operator Selection
Fialho, A. R. S., Costa, L. D., Schoenauer, M., & Sébag, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87700-4_18 · Cited by 113
Learning dynamic algorithm portfolios
Gagliolo, M., & Schmidhuber, J. (2007) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-006-9036-z · Cited by 107
Decision making in a hybrid genetic algorithm
Lobo, F. G., & Goldberg, D. E. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/icec.1997.592281 · Cited by 105
Bai, R., & Kendall, G. (2007) · INFORMS journal on computing · doi:10.1287/ijoc.1070.0219 · Cited by 105
Self-citationA Study on the use of ``self-generation'' in memetic algorithms
Krasnogor, N., & Gustafson, S. (2004) · Natural Computing · doi:10.1023/b:naco.0000023419.83147.67 · Cited by 102
Ross, P. D., Marín-Blázquez, J. G., Schulenburg, S., & Hart, E. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45110-2_5 · Cited by 98
Grammatical Evolution of Local Search Heuristics
Burke, E. K., Hyde, M. R., & Kendall, G. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2160401 · Cited by 98
Self-citationEvolving Evolutionary Algorithms Using Linear Genetic Programming
Oltean, M. (2005) · Cited by 97
Reactive search, a history-sensitive heuristic for MAX-SAT
Battiti, R., & Protasi, M. (1997) · ACM Journal of Experimental Algorithmics · doi:10.1145/264216.264220 · Cited by 94
2023 IEEE Congress on Evolutionary Computation (CEC)
(2023) · doi:10.1109/cec53210.2023 · Cited by 91
High Performance ATP Systems by Combining Several AI Methods
Denzinger, J., Fuchs, M., & Fuchs, M. (1996) · doi:10.22028/d291-41582 · Cited by 90
Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems
Terashima‐Marín, H., Ross, P. D., Farías-Zárate, C. J., López-Camacho, E., & Valenzuela-Rendón, M. (2008) · Annals of Operations Research · doi:10.1007/s10479-008-0475-2 · Cited by 90
Generating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework
Bader-El-Den, M. B., & Poli, R. (2008) · Springer eBooks · doi:10.1007/978-3-540-79305-2_4 · Cited by 85
Coello, C. A. C., Pavone, M. F., Nicosia, G., Forrest, S., Deb, K., & Cutello, V. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32937-1 · Cited by 85
Bai, R., Burke, E. K., & Kendall, G. (2007) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602463 · Cited by 81
Self-citationMonte Carlo hyper-heuristics for examination timetabling
Burke, E. K., Kendall, G., Mısır, M., & Özcan, E. (2010) · Annals of Operations Research · doi:10.1007/s10479-010-0782-2 · Cited by 76
Self-citationSelf Generating Metaheuristics in Bioinformatics: The Proteins Structure Comparison Case
Krasnogor, N. (2004) · Genetic Programming and Evolvable Machines · doi:10.1023/b:genp.0000023687.41210.d7 · Cited by 76
Examination timetabling using late acceptance hyper-heuristics
Özcan, E., Bykov, Y., Birben, M., & Burke, E. K. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4983054 · Cited by 72
Self-citationEvolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework
Bader-El-Den, M. B., Poli, R., & Fatima, S. S. (2009) · Memetic Computing · doi:10.1007/s12293-009-0022-y · Cited by 69
A Compass to Guide Genetic Algorithms
Maturana, J., & Saubion, F. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87700-4_26 · Cited by 68
Automated Discovery of Composite SAT Variable-Selection Heuristics
Fukunaga, A. S. (2002) · Cited by 67
An Ant Algorithm Hyperheuristic for the Project Presentation Scheduling Problem
Burke, E., Kendall, G., Landa-Silva, D., O'Brien, R. F. J., & Soubeiga, E. (2005) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2005.1554976 · Cited by 66
Self-citationMeignan, D., Koukam, A., & Créput, J.-C. (2009) · Journal of Heuristics · doi:10.1007/s10732-009-9121-7 · Cited by 65
Hill Climbers and Mutational Heuristics in Hyperheuristics
Özcan, E., Bilgin, B., & Korkmaz, E. E. (2006) · Lecture notes in computer science · doi:10.1007/11844297_21 · Cited by 63
Self-citationThe Next Wave in Computing, Optimization, and Decision Technologies
Golden, B., Wasil, E., & Raghavan, S. (2005) · Operations research, computer science. Interface series · doi:10.1007/b101696 · Cited by 62
Extreme compass and Dynamic Multi-Armed Bandits for Adaptive Operator Selection
Maturana, J., Fialho, A. R. S., Saubion, F., Schoenauer, M., & Sébag, M. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4982970 · Cited by 61
An Intelligent Hyper-Heuristic Framework for CHeSC 2011
Mısır, M., Verbeeck, K., Causmaecker, P. D., & den Berghe, G. V. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34413-8_45 · Cited by 60
Markov chain hyper-heuristic (MCHH)
McClymont, K., & Keedwell, E. C. (2011) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2001576.2001845 · Cited by 60
An Improved Choice Function Heuristic Selection for Cross Domain Heuristic Search
Drake, J. H., Özcan, E., & Burke, E. K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32964-7_31 · Cited by 59
Self-citationProblem and Heuristic Space Search Strategies for Job Shop Scheduling
Storer, R. H., Wu, S. D., & Vaccari, R. (1995) · INFORMS journal on computing · doi:10.1287/ijoc.7.4.453 · Cited by 58
Evolving Local Search Heuristics for SAT Using Genetic Programming
Fukunaga, A. S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24855-2_59 · Cited by 57
The scalability of evolved on line bin packing heuristics
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. R. (2007) · 2007 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2007.4424789 · Cited by 55
Self-citationAn Ant Based Hyper-heuristic for the Travelling Tournament Problem
Chen, P.-C., Kendall, G., & Berghe, G. V. (2007) · IEEE Symposium on Computational Intelligence in Scheduling (CISched) · doi:10.1109/scis.2007.367665 · Cited by 54
Self-citationLinear genetic programming of parsimonious metaheuristics
Keller, R. E., & Poli, R. (2007) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2007.4425062 · Cited by 50
A histogram-matching approach to the evolution of bin-packing strategies
Poli, R., Woodward, J. R., & Burke, E. K. (2007) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2007.4424926 · Cited by 49
Self-citationThere Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists
Poli, R., & Graff, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01181-8_17 · Cited by 48
Distributed Choice Function Hyper-heuristics for Timetabling and Scheduling
Rattadilok, P., Gaw, A., & Kwan, R. S. K. (2005) · Lecture notes in computer science · doi:10.1007/11593577_4 · Cited by 45
Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem
Mısır, M., Verbeeck, K., Causmaecker, P. D., & den Berghe, G. V. (2010) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2010.5586348 · Cited by 39
Co-evolving Memetic Algorithms: Initial Investigations
Smith, J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45712-7_52 · Cited by 38
A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem
Terashima‐Marín, H., Zárate, C. J. F., Ross, P. D., et al. (2006) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1143997.1144102 · Cited by 38
A genetic programming based hyper-heuristic approach for combinatorial optimisation
Nguyen, S., Zhang, M., & Johnston, M. (2011) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2001576.2001752 · Cited by 36
Reactive Search: Machine Learning for Memory-Based Heuristics
Battiti, R., & Brunato, M. (2018) · Chapman & Hall/CRC eBooks · doi:10.1201/9781351236423-19 · Cited by 35
Gagliolo, M., & Schmidhuber, J. (2006) · Cited by 35
Evolving reusable 3d packing heuristics with genetic programming
Allen, S. D., Burke, E. K., Hyde, M., & Kendall, G. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1570029 · Cited by 34
Self-citationCost-Benefit Investigation of a Genetic-Programming Hyperheuristic
Keller, R. E., & Poli, R. (2008) · Springer eBooks · doi:10.1007/978-3-540-79305-2_2 · Cited by 32
Kumar, R., Joshi, A. H., Banka, K. K., & Rockett, P. I. (2008) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1389095.1389335 · Cited by 32
Policy matrix evolution for generation of heuristics
Özcan, E., & Parkes, A. J. (2011) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2001576.2001846 · Cited by 31
Self-citationEvaluation of a Family of Reinforcement Learning Cross-Domain Optimization Heuristics
Gaspero, L. D., & Urli, T. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34413-8_32 · Cited by 29
On the investigation of hyper-heuristics on a financial forecasting problem
Kampouridis, M., Alsheddy, A., & Tsang, E. P. K. (2012) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-012-9283-0 · Cited by 26
Integrating neural networks and logistic regression to underpin hyper-heuristic search
Li, J., Burke, E. K., & Qu, R. (2010) · Knowledge-Based Systems · doi:10.1016/j.knosys.2010.10.004 · Cited by 23
Self-citationA selection hyper-heuristic for scheduling deliveries of ready-mixed concrete
Mısır, M., Vancroonenburg, W., Verbeeck, K., & den Berghe, G. V. (2011) · Cited by 22
Evolving an edge selection formula for ant colony optimization
Runka, A. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1570046 · Cited by 18
Comparing two models to generate hyper-heuristics for the 2d-regular bin-packing problem
Terashima‐Marín, H., Zárate, C. J. F., Ross, P. D., et al. (2007) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1276958.1277377 · Cited by 17
Providing a memory mechanism to enhance the evolutionary design of heuristics
Burke, E. K., Hyde, M. R., & Kendall, G. (2010) · IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2010.5586388 · Cited by 15
Self-citationInvestigating the use of local search for improving meta-hyper-heuristic performance
Grobler, J., Engelbrecht, A. P., Kendall, G., & Yadavalli, V. S. S. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6252970 · Cited by 13
Self-citationA hyper-heuristic approach to design and tuning heuristic methods for web document clustering
Cobos, C., Mendoza, M., & León, E. (2011) · doi:10.1109/cec.2011.5949773 · Cited by 13
A hyper-heuristic clustering algorithm
Tsai, C., Song, H.-J., & Chiang, M. (2012) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2012.6378179 · Cited by 11
Grammar-based genetic programming for timetabling
Den, M. B. E., & Poli, R. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4983259 · Cited by 10
Evolutionary Squeaky Wheel Optimization: A New Framework for Analysis
Li, J., Parkes, A. J., & Burke, E. K. (2011) · Evolutionary Computation · doi:10.1162/evco_a_00033 · Cited by 9
Self-citationTeacher: A Genetics Based System for Learning and Generalizing Heuristics
Wah, B. W.-S., & Ieumwananonthachai, A. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0687-6_8 · Cited by 7
Self-adaptive hyperheuristic and greedy search
Keller, R. E., & Poli, R. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4631313 · Cited by 6
Keller, R. E., & Poli, R. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4631224 · Cited by 6
Cited by
A survey on new generation metaheuristic algorithms
Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.106040 · Cited by 923
Metaheuristic Algorithms: A Comprehensive Review
Abdel-Basset, M., Abdel-Fatah, L., & Sangaiah, A. K. (2018) · Computational Intelligence for Multimedia Big Data on the Cloud with Engineering Applications · doi:10.1016/b978-0-12-813314-9.00010-4 · Cited by 637
Bio-inspired computation: Where we stand and what's next
Del Ser, J., Osaba, E., Molina, D., Yang, X.-S., Salcedo-Sanz, S., Camacho, D., Das, S., Suganthan, P. N., Coello Coello, C. A., & Herrera, F. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.008 · Cited by 593
Proceedings of the Genetic and Evolutionary Computation Conference
(2022) · doi:10.1145/3512290 · Cited by 546
Mathematical discoveries from program search with large language models
Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J. R., Ellenberg, J. S., Wang, P., Fawzi, O., et al. (2024) · Nature · doi:10.1038/s41586-023-06924-6 · Cited by 544
Metadata
- Authors
- Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R.
- Venue
- Journal of the Operational Research Society
- Publisher
- Informa UK Limited
- Published
- 2013-12
- Volume
- 64
- Issue
- 12
- Pages
- 1695-1724
- ISSN
- 0160-5682 (ISSN-L)
- 1476-9360
- OpenAlex
- W2072441740
- Cited by
- 1,263
- References
- 156
- FWCI
- 101.60
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.