Exploring Hyper-heuristic Methodologies with Genetic Programming
The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
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
(1979) · Cited by 43,841
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
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
A Field Guide to Genetic Programming
Poli, R., Langdon, W. B., & McPhee, N. F. (2008) · Cited by 1,930
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
Banzhaf, W., Francone, F. D., Keller, R. E., & Nordin, P. C. (1998) · Cited by 1,678
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5529-2 · Cited by 1,235
Stochastic Local Search: Foundations & Applications
Hoos, H. H., & St�tzle, T. (2004) · Medical Entomology and Zoology · Cited by 1,227
Handbook of Combinatorial Optimization
(1999) · Springer eBooks · doi:10.1007/978-1-4757-3023-4 · Cited by 1,216
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., & Graham, R. L. (1974) · SIAM Journal on Computing · doi:10.1137/0203025 · Cited by 911
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 825
Genetic Programming III: Darwinian Invention and Problem Solving
Koza, J. R., André, D., Bennett, F. H., & Keane, M. A. (1999) · Medical Entomology and Zoology · Cited by 763
(2005) · Genetic Programming Series · doi:10.1007/b137549 · 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
Learning to Learn: Introduction and Overview
Thrun, S., & Pratt, L. (1998) · Learning to Learn · doi:10.1007/978-1-4615-5529-2_1 · Cited by 521
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-citationGenetic Programming III - Darwinian Invention and Problem Solving
Nordin, P. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.4.451 · Cited by 501
A Hyperheuristic Approach to Scheduling a Sales Summit
Cowling, P., Kendall, G., & Soubeiga, E. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44629-x_11 · Cited by 475
Self-citationModern Heuristic Search Methods
Rayward-Smith, V. J., Osman, I. H., Reeves, C. R., & Smith, G. D. (1996) · Cited by 459
Application of Bayesian approach to numerical methods of global and stochastic optimization
Mockus, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01099263 · Cited by 399
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
Proceedings of the Genetic and Evolutionary Computation Conference
(2019) · doi:10.1145/3321707 · Cited by 319
On the online bin packing problem
Seiden, S. S. (2002) · Journal of the ACM · doi:10.1145/585265.585269 · Cited by 310
Handbook of Combinatorial Optimization: Volume1–3
(1998) · Springer eBooks · doi:10.1007/978-1-4613-0303-9 · Cited by 292
A genetic algorithm for bin packing and line balancing
Falkenauer, E., & Delchambre, A. (2003) · Proceedings 1992 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1992.220088 · Cited by 279
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
Automatic algorithm configuration based on local search
Hutter, F., Hoos, H. H., & Stützle, T. (2007) · Cited by 240
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-citationRapid 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
Dowsland, K. A., Soubeiga, E., & Burke, E. K. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.03.058 · Cited by 169
Self-citationCoevolving 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
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
Automated 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
Bin Packing Approximation Algorithms: Combinatorial Analysis
Coffman, E. G., Galambos, G., Martello, S., & Vigo, D. (1999) · Springer eBooks · doi:10.1007/978-1-4757-3023-4_3 · Cited by 145
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 · cited 5×
“In the first paper [10], a number of existing heuristics are listed.”
BackgroundMethodInfluentialSelf-citationRoss, P. D. (2006) · Springer eBooks · doi:10.1007/0-387-28356-0_17 · Cited by 134
The problem of tuning metaheuristics as seen from a machine learning perspective
Birattari, M., & Dorigo, M. (2004) · Cited by 128
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Hutter, F., Hamadi, Y., Hoos, H. H., et al. (2006) · Lecture notes in computer science · doi:10.1007/11889205_17 · Cited by 125
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-citationLearning dynamic algorithm portfolios
Gagliolo, M., & Schmidhuber, J. (2007) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-006-9036-z · Cited by 107
A 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
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
Automated Discovery of Composite SAT Variable-Selection Heuristics
Fukunaga, A. S. (2002) · Cited by 77
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-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
Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems
Terashima‐Marín, H., Flores-Álvarez, E. J., & Ross, P. D. (2005) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1068009.1068115 · Cited by 44
On Line Bin Packing with Items of Random Size
Rhee, W. T., & Talagrand, M. (1993) · Mathematics of Operations Research · doi:10.1287/moor.18.2.438 · Cited by 38
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
Teacher: 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
Cited by
Hyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
Self-citationA Classification of Hyper-heuristic Approaches
Burke, E. K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Woodward, J. R. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_15 · Cited by 563
Self-citationRecent advances in selection hyper-heuristics
Drake, J. H., Kheiri, A., Özcan, E., & Burke, E. K. (2020) · European Journal of Operational Research · doi:10.1016/j.ejor.2019.07.073 · Cited by 365
Self-citationGenetic programming for production scheduling: a survey with a unified framework
Nguyen, S., Mei, Y., & Zhang, M. (2017) · Complex & Intelligent Systems · doi:10.1007/s40747-017-0036-x · Cited by 279
Nguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2248159 · Cited by 272
Metadata
- Authors
- Burke, E. K., Hyde, M. R., Kendall, G., Ochoa, G., Ozcan, E., & Woodward, J. R.
- Venue
- Intelligent Systems Reference Library
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 177-201
- ISSN
- 1868-4394 (ISSN-L)
- 1868-4408
- OpenAlex
- W1536647479
- Cited by
- 304
- References
- 54
- FWCI
- 21.60
- Type
- book chapter
- Language
- en
- Open access
- closed
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.