Evolving Bin Packing Heuristics with Genetic Programming
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
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 [82]
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 · cited 1×
“Of course, the No Free Lunch theorem [7,8] shows that all search algorithms have the same average performance on all problems defined on a given finite search space.”
BackgroundGenetic 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 · cited 1×
“In other words, the set of integers must be divided into the smallest number of subsets so that the sum of the sizes of the pieces in a subset does not exceed C [18].”
BackgroundGenetic programming II: Automatic discovery of reusable programs
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90099-3 · Cited by 1,901
Knapsack problems, algorithms and computer implementations
De Kort, J. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90159-s · Cited by 1,402
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
(2005) · doi:10.1007/0-387-28356-0 · Cited by 853
Self-citation
Research works printed but not linked: 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
Items 101–145 of 145
A study of agnostic hyper-heuristics based on sampling solution chains
Chuang, C.-Y., & Smith, S. F. (2017) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2017.7969323 · Cited by 4
Asynchronous optimization of part logistics routing problem
Huang, Y., Chen, B., Lu, W., Jin, Z., & Zheng, R. (2021) · Journal of Global Optimization · doi:10.1007/s10898-021-01078-z · Cited by 4
Genetic-based Constraint Programming for Resource Constrained Job Scheduling
Nguyen, S., Thiruvady, D., Sun, Y., & Zhang, M. (2024) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3638529.3654046 · Cited by 4
“AHD is a hyperheuristic method that de-parts from traditional optimisation approaches [10, 46, 18, 15], where the aim is to explore the space of heuristics rather than the traditional aim of exploring a solution search space.”
MethodGenetic Programming for Auction Based Scheduling
Bader-El-Den, M. B., & Fatima, S. S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12148-7_22 · Cited by 6
“GP been used to evolve Boolean satisfiability heuristics [14,3] and specialised onedimensional bin packing heuristics [ 4 ,5].”
MethodRaghavjee, R., & Pillay, N. (2011) · South African Institute of Computer Scientists and Information Technologists · doi:10.1145/2072221.2072243 · Cited by 4
“For example, construction heuristics commonly used for the onedimensional bin-packing problem include first fit, best fit, worst fit and the next fit heuristic [3].”
MethodAn investigation of multi-objective hyper-heuristics for multi-objective optimisation
Maashi, M. S. (2014) · Nottingham ePrints (University of Nottingham) · Cited by 7
Co-evolutionary hyper-heuristic method for auction based scheduling
Fatima, S. S., & Bader-El-Den, M. B. (2010) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2010.5586319 · Cited by 4
“GP been used to evolve Boolean satisfiability heuristics [19], [4], [3] and specialised one-dimensional bin packing heuristics [7], [8].”
MethodLearning classifier systems for optimisation problems
Tabacman, M., Krasnogor, N., Bacardit, J., & Loiseau, I. (2008) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/1388969.1389018 · Cited by 3
“These ideas can be employed by themselves to solve complex problems ([7],[8],[6],[16],[17],[18],[29],[11]).”
BackgroundAnt algorithm hyperheuristic approaches for scheduling problems
O'Brien, R. F. J. (2008) · Nottingham ePrints (University of Nottingham) · Cited by 6
Crossover Control in Selection Hyper-heuristics: Case Studies using MKP and HyFlex
Drake, J. H. (2014) · Nottingham ePrints (University of Nottingham) · Cited by 4
Automatic Construction of Loading Algorithms With Interactive Genetic Programming
悠介, 蛭., Nishihara, K., Koguma, Y., Fujii, M., & Nakata, M. (2022) · IEEE Access · doi:10.1109/access.2022.3225543 · Cited by 3
“For generative HHs, GP-based HHs (GPHHs) have been a major approach to BPPs and CLPs [22], [23].”
BackgroundToward Building Aesthetic, Useful and Readable Tag Clouds for Websites
Marszałkowski, J., Rusiecki, Ł., Drozdowski, M., & Narożny, H. (2014) · International Conference on e-Business · doi:10.5220/0005116302300235 · Cited by 2
“Several well known low-level heuristics greedy like FirstFit (FF), BestFit (BF), WorstFit (WF) (Burke et al., 2006) were used.”
BackgroundMethodGenetically designed heuristics for the bin packing problem
Muntean, O. (2007) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/1274000.1274088 · Cited by 2
“A different approach for evolving BPP heuristics using GP has been proposed in [1].”
BackgroundMethodInfluentialBader-El-Den, M. B., & Poli, R. (2008) · Genetic and evolutionary computation · doi:10.1007/978-0-387-87623-8_11 · Cited by 2
“work ( Burke etal., 2006a ) GP wassuccessfully used to evolve new heuristics of for one-dimensional online bin packing problems.”
MethodDiscovering Beneficial Cooperative Structures for the Automated Construction of Heuristics
Terrazas, G., Landa-Silva, D., & Krasnogor, N. (2010) · Studies in computational intelligence · doi:10.1007/978-3-642-12538-6_8 · Cited by 3
“Hyper-heuristics have been employed for s olving search and optimisation problems such as bin-packing [4, 17], timetabling [14], scheduling [8, 9] and satisfiability [2] among others.”
Evolving human-competitive reusable 2D strip packing heuristics
Hyde, M., Burke, E. K., & Kendall, G. (2009) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/1570256.1570299 · Cited by 2
“[3, 4, 5] have shown that it is possible to evolve stand-alone heuristics for one dimensional bin packing using a similar methodology to that presented here.”
MethodSelf-citationMetaheuristic-Based BFDACO Data Allocation Optimization in Neo4jHA for Efficient Query Retrieval
Mathew, A. B., Krishnan, K. M., & Salam, S. M. (2018) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-018-3366-0 · Cited by 2
“in their paper [28] define a genetic algorithm-based fitness function for BPP as two to be the perfect result, because the pieces are grouped into less number of bins possible.”
BackgroundEfficient Module Design for Chassis-Mounted Components of Commercial Vehicles
Stocker, J., Çavuşoğlu, M., Felgenhauer, M., & Lienkamp, M. (2018) · Cited by 2
A Neural Approach to Generation of Constructive Heuristics
Alissa, M., Sim, K., & Hart, E. (2021) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec45853.2021.9504989 · Cited by 2
“DS total nitems Lower - Upper Bounds Distribution DS1 450 120 [40-60] Gaussian DS2 450 120 [20-100] Uniform”
BackgroundMethodA modified choice function hyper-heuristic with Boltzmann function
Mellouli, O., Hafidi, I., & Metrane, A. (2021) · Mathematical Modeling and Computing · doi:10.23939/mmc2021.04.736 · Cited by 1
Genetic Programming as a Hyper-Heuristic for Solving Combinatorial Optimisation Problems
Ðurasević, M., Gil-Gala, F. J., Jakobović, D., & Mei, Y. (2025) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3712255.3716516 · Cited by 1
Scheepers, D., & Pillay, N. (2025) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-025-09528-3 · Cited by 1
“Burke and Hyde [4, 16, 17] examined the use of genetic programming generation construction hyper-heu-ristics for the one-dimensional, two-dimensional, three-dimensional and knapsack packing problems.”
Sotelo-Figueroa, M. A., Soberanes, H. J. P., Carpio, M., Huacuja, H. J. F., Cruz–Reyes, L., & Soria-Alcaraz, J. A. (2014) · Studies in computational intelligence · doi:10.1007/978-3-319-10960-2_10 · Cited by 1
“It has been shown that metaheuristics, like Genetic Programming [5], can generate an heuristic that can be applied to an instance problem [6].”
BackgroundMethodOptimising multi-modal polynomial mutation operators for multi-objective problem classes
McClymont, K., & Keedwell, E. C. (2010) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2010.5586076 · Cited by 1
“Considering the findings in this paper and work such as [ 25 ] the authors support the observation of [20] that such studies highlight “the need of a theory for how operators should be designed for MO-EAs” [20].”
BackgroundMethodResultInfluentialHeuristic Algorithm for Constrained 3D Container Loading Problem: A Genetic Approach
Jegadeshwari, S. (2014) · International Journal of Computing Algorithm · doi:10.20894/ijcoa.101.003.001.025 · Cited by 1
Novel Hyper-heuristic Approaches in Exam Timetabling
Soghier, A. (2013) · Cited by 1
Genetic Hyper-Heuristics for Graph Layout Problems
Koohestani, B. (2013) · Cited by 2
A Parameter-Based Analysis of Ant-Based Generation Hyper-Heuristics
Singh, E., & Pillay, N. (2022) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci51031.2022.10022101 · Cited by 1
Xue, F. (2013) · PolyU Institutional Research Archive (Hong Kong Polytechnic University) · Cited by 1
Brownlee, A. E. I., Woodward, J. R., & Veerapen, N. (2018) · Stirling Online Research Repository (University of Stirling) · Cited by 2
Hyper-heuristic cooperation based approach for bus driver scheduling
Li, S. (2013) · theses.fr (ABES) · doi:10.70675/0f3005bcz8cccz47daz95ecz9a2b67e980b1 · Cited by 1
An Indirect Approach to the Three-Dimensional Multi-pipe Routing Problem
Furuholmen, M., Glette, K., Hovin, M. E., & Tørresen, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12148-7_8
“Evolution of heuristics for packing problems [ 13 ] [14] [15] [16], scheduling problems [17] [18] [19], and facility layout problems [20] demonstrated that heuristics were generated which in many cases were equal to, or better than, previously known human made heuristics.”
BackgroundCHaMP: Creating Heuristics via Many Parameters
Asta, S., & Parkes, A. J. (2014)
Hyper-heuristics for grouping problems
Elhag, A. (2015) · Nottingham ePrints (University of Nottingham)
Applying Gene Expression Programming for Solving One-Dimensional Bin-Packing Problems
Al-Saati, N. A. (2013) · Maǧallaẗ al-rāfidayn li-ʿulūm al-ḥāsibāt wa-al-riyāḍiyyāẗ/Al-Rafidain journal for computer sciences and mathematics · doi:10.33899/csmj.2013.163549
An Evolutionary Computation Approach to Resource Allocation in Container-based Clouds
Tan, B. (2020) · Open Access Victoria University of Wellington | Te Herenga Waka (Figshare) · doi:10.26686/wgtn.17151155 · Cited by 1
A Survey on Evolutionary Machine Learning
Al-Sahaf, H., Bi, Y., Chen, Q., Lensen, A., Mei, Y., Sun, Y., Tran, B., Xue, B., & Zhang, M. (2020) · Open Access Victoria University of Wellington | Te Herenga Waka (Figshare) · doi:10.26686/wgtn.13058792.v1
Transfer Optimisation in Genetic Programming for Solving Uncertain Capacitated Arc Routing Problem
Ardeh, M. A. (2022) · Open Access Victoria University of Wellington | Te Herenga Waka (Figshare) · doi:10.26686/wgtn.20311185
Wang, S. (2023) · Open Access Victoria University of Wellington | Te Herenga Waka (Figshare) · doi:10.26686/wgtn.24208311 · Cited by 2
van Lon, R. R. S. (2017) · Lirias
Gamification of Optimisation for Operations Research
(15815954), N. R. (2024) · Open Research Exeter (University of Exeter)
QAL-BP: An Augmented Lagrangian Quantum Approach for the Bin Packing Problem
Cellini, L. (2023) · AMS Degree Thesis (University of Bologna)
Planinić, L., Ðurasević, M., & Jakobović, D. (2026) · Neural Computing and Applications · doi:10.1007/s00521-026-12034-x
CSF: A curriculum-based scaffolding framework for heuristic evolution in combinatorial optimization
Zhang, Z., Li, S., Chen, X., Chen, X., Tianle, Z., Zhao, J. W., & Liu, P. (2026) · Pattern Recognition · doi:10.1016/j.patcog.2026.114659
Novel Hyper-heuristics Applied to the Domain of Bin Packing
Sim, K. (2014) · Edinburgh Napier Research Repository (Edinburgh Napier University) · doi:10.17869/enu.175745 · Cited by 2
Metadata
- Authors
- Burke, E. K., Hyde, M. R., & Kendall, G.
- Affiliations
- University of Nottingham (GB)
- ORCID
- Kendall, G.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- 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
- www.springer.com/tdm (tdm)
- www.springer.com/tdm (vor)
- 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.