CoChat

Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one

Burke, Edmund K., Hyde, Matthew R., Kendall, Graham, Woodward, John · 2007 · Proceedings of the 9th annual conference on Genetic and evolutionary computation

The DOI matches its Crossref record; 29 of the 29 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

Crossref · 10.1145/1276958.1277273

Cites

29 of 29 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 29 references

Research works printed but not linked: 3

  1. 10.1007/11844297_87 · DOI · Paper page
  2. 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.
  3. 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

See all 121

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
29
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one. https://app.cochat.ai/papers/10.1145/1276958.1277273
The paper
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. (2007). Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one. Proceedings of the 9th annual conference on Genetic and evolutionary computation. https://doi.org/10.1145/1276958.1277273

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.