CoChat

Evolving Bin Packing Heuristics with Genetic Programming

Burke, E. K., Hyde, M. R., Kendall, G. · 2006 · Lecture Notes in Computer Science

The DOI matches its Crossref record; 32 of the 34 references it cites were found in a registry or an index.

Overview

Integrity signals

Registry

Crossref · 10.1007/11844297_87

Cites

32 of 32 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, 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

Research works printed but not linked: 1

  1. Dowsland, K., Soubeiga, E., Burke, E.K.: A simulated annealing hyper-heuristic for determining shipper sizes. European Journal of Operational Research (in press, to appear 2006, available online November 29, 2005) (accepted)

Cited by

See all 145

Metadata

Authors
Burke, E. K., Hyde, M. R., & Kendall, G.
Affiliations
University of Nottingham (GB)
Venue
Lecture Notes in Computer Science
Published
2006
Pages
860-869
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1820078070
Cited by
144
References
34
Citations by year
2026: 3 · 2025: 3 · 2024: 3 · 2023: 5 · 2022: 7 · 2021: 5 · 2020: 10 · 2019: 5 · 2018: 4 · 2017: 8 · 2016: 5 · 2015: 2 · 2014: 9 · 2013: 13 · 2012: 11
FWCI
24.87
Type
conference paper
Language
en
Open access
closed
Licence
Locations
Lecture notes in computer science (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
bin packing, genetic programming, heuristic evolution, NP-hard optimization, automated heuristic design, bin packing heuristics

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.