Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one
The DOI matches its Crossref record; 29 of the 31 references it cites were found in a registry or an index.
Abstract
It is possible to argue that online bin packing heuristics should be evaluated by using metrics based on their performance over the set of all bin packing problems, such as the worst case or average case performance. However, this method of assessing a heuristic would only be relevant to a user who employs the heuristic over a set of problems which is actually representative of the set of all possible bin packing problems. On the other hand, a real world user will often only deal with packing problems that are representative of a particular sub-set. Their piece sizes will all belong to a particular distribution. The contribution of this paper is to show that a Genetic Programming system can automate the process of heuristic generation and produce heuristics that are human-competitive over a range of sets of problems, or which excel on a particular sub-set. We also show that the choice of training instances is vital in the area of automatic heuristic generation, due to the trade-off between the performance and generality of the heuristics generated and their applicability to new problems.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Indeed, like FunSearch, hyper-heuristics have also been applied to online bin packing, with the learned heuristics able to match the performance of first fit82 and best fit83 on a set of generated bin packing instances.”
From Mathematical discoveries from program search with large language models (2024) · cites this paper as [83]
Citations
Cites
(1979) · Cited by 43,841
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
(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
Knapsack Problems: Algorithms and Computer Implementations
Connolly, D., Martello, S., & Toth, P. (1991) · Journal of the Operational Research Society · doi:10.2307/2583458 · Cited by 3,120
Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019
Auger, A., & Stützle, T. (2019) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 1,749
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
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-citationA 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 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-citationA 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
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-citationKoza, J. R., & Poli, R. (2006) · Search Methodologies · doi:10.1007/0-387-28356-0_5 · Cited by 216
A Simple but Theoretically-Motivated Method to Control Bloat in Genetic Programming
Poli, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36599-0_19 · Cited by 183
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-citationBin 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 1×
“Importantly, the fitness function avoids the problem of plateaus in the search space that occur when the fitness function is simply the number of bins used by the heuristic, which is a problem encountered in [2].”
MethodSelf-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
Best-Fit Bin-Packing with Random Order
Mathieu, C. (1995) · HAL · Cited by 123
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
Automated Discovery of Composite SAT Variable-Selection Heuristics
Fukunaga, A. S. (2002) · Cited by 77
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 73
Development and application of hyperheuristics to personnel scheduling
Soubeiga, E. (2003) · Nottingham ePrints (University of Nottingham) · Cited by 72
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 60
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 58
Complexity Theory and the No Free Lunch Theorem
Whitley, D., & Watson, J. P. (2006) · Springer eBooks · doi:10.1007/0-387-28356-0_11 · Cited by 57
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
Research works printed but not linked: 3
- 10.1007/11844297_87 · DOI · Paper page
- K. Dowsland , E. Soubeiga , and E. K. Burke . A simulated annealing hyper-heuristic for determining shipper sizes. European Journal of Operational Research 179(3) :759--774 , 2007 . K. Dowsland, E. Soubeiga, and E. K. Burke. A simulated annealing hyper-heuristic for determining shipper sizes. European Journal of Operational Research 179(3) :759--774, 2007.
- M. O'Neill , R. Cleary , and N. Nikolov . Solving knapsack problems with attribute grammars . In Proceedings of the Third Grammatical Evolution Workshop (GEWS'04) Seattle, WA, USA. , 2004 . M. O'Neill, R. Cleary, and N. Nikolov. Solving knapsack problems with attribute grammars. In Proceedings of the Third Grammatical Evolution Workshop (GEWS'04) Seattle, WA, USA., 2004.
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-citationMathematical 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
“Indeed, like FunSearch, hyper-heuristics have also been applied to online bin packing, with the learned heuristics able to match the performance of first fit 82 and best fit 83 on a set of generated bin packing instances.”
MethodAutomated Design of Production Scheduling Heuristics: A Review
Branke, J., Nguyen, S., Pickardt, C. W., & Zhang, M. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2429314 · Cited by 469
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-citation
Metadata
- Authors
- Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J.
- Affiliations
- University of Nottingham (GB)
- Venue
- Proceedings of the 9th annual conference on Genetic and evolutionary computation
- Publisher
- ACM
- Published
- 2007-07-07
- Pages
- 1559-1565
- OpenAlex
- W2137654273
- Cited by
- 121
- References
- 31
- Citations by year
- 2026: 1 · 2025: 3 · 2024: 2 · 2023: 2 · 2022: 5 · 2021: 6 · 2020: 7 · 2019: 4 · 2018: 8 · 2017: 7 · 2016: 5 · 2015: 3 · 2014: 12 · 2013: 12 · 2012: 5
- FWCI
- 26.66
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Genetic and Evolutionary Computation Conference (GECCO) (publishedVersion)
- Topics
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Optimization and Packing Problems
- Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- online bin packing, genetic programming, heuristic evaluation, training instance selection
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.