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
A Field Guide to Genetic Programming
Poli, R., Langdon, W. B., & McPhee, N. F. (2008) · Cited by 1,930
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
“An alternative idea is to use genetic programming to evolve a program representing a function, which is part of the processing of a given problem specific construction heuristic [9, 8, 11, 22, 31, 59].”
BackgroundMethodInfluentialSelf-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.”
MethodBin packing and cutting stock problems: Mathematical models and exact algorithms
Delorme, M., Iori, M., & Martello, S. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.04.030 · Cited by 379
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
“In the first paper [10], a number of existing heuristics are listed.”
BackgroundMethodInfluentialSelf-citationA survey on evolutionary machine learning
Al‐Sahaf, H., Bi, Y., Chen, Q., Lensen, A., Mei, Y., Sun, Y., Tran, B., Xue, B., & Zhang, M. (2019) · Journal of the Royal Society of New Zealand · doi:10.1080/03036758.2019.1609052 · Cited by 245
“(Burke et al. 2006) developed GPHH for one-dimensional bin packing.”
Open issues in genetic programming
O’Neill, M., Vanneschi, L., Gustafson, S., & Banzhaf, W. (2010) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-010-9113-2 · Cited by 224
“These questions have given rise to the search for better GP algorithms using GP, i.e., meta-GP (e.g., [94, 103,16]).”
BackgroundNguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2227326 · Cited by 221
“[29], [30] proposed a GP-HH framework to evolve construction heuristics for online bin packing.”
BackgroundA Classification of Hyper-Heuristic Approaches: Revisited
Burke, E. K., Hyde, M. R., Kendall, G., Ochoa, G., Özcan, E., & Woodward, J. R. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_14 · Cited by 168
Self-citationGenetic Programming: An Introduction and Tutorial, with a Survey of Techniques and Applications
Langdon, W. B., Poli, R., McPhee, N. F., & Koza, J. R. (2008) · Studies in Computational Intelligence · doi:10.1007/978-3-540-78293-3_22 · Cited by 196
“For example, GP has evolved competitive SAT solvers [19, 20, 103, 177], state-of-the-art or better than state-of-the-art bin packing algorithms [41,42,313], particle swarm optimizers [310, 311], evolutionary algorithms [277], and travelling salesman problem solvers [172–174,278].”
BackgroundAutomated 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
“The genetic programming algorithm is only 9This is description is highly simplified for the sake of clarity – see (Burke et al., 2006).”
BackgroundInfluentialA Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics
Burke, E. K., Hyde, M., Kendall, G., & Woodward, J. R. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2041061 · Cited by 155
“[34]–[36], have superior performance to the human-designed”
Self-citationA Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling
Özcan, E., Mısır, M., Ochoa, G., & Burke, E. K. (2010) · International Journal of Applied Metaheuristic Computing · doi:10.4018/jamc.2010102603 · Cited by 131
Self-citationA study of ant-based pheromone spaces for generation constructive hyper-heuristics
Singh, E., & Pillay, N. (2022) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2022.101095 · Cited by 131
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
“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-citationAutomating the Packing Heuristic Design Process with Genetic Programming
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. R. (2011) · Evolutionary Computation · doi:10.1162/evco_a_00044 · Cited by 118
“Genetic programming has also been used as a hyper-heuristic for the 1D bin packing problem (Burke, Hyde et al., 2006; Burke et al., 2007a, 2007b; Burke, Hyde, and Kendall, 2010), evolving heuristics which are reusable on new problem instances, and for the 2D strip packing problem (Burke, Hyde,…”
MethodSelf-citationGrammatical Evolution of Local Search Heuristics
Burke, E. K., Hyde, M. R., & Kendall, G. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2160401 · Cited by 103
“Constructive heuristics for 1-D bin packing have been evolved by genetic programming in [11]–[13], showing that evolved constructive bin packing heuristics can perform better than the best-fit heuristic [14] on new problems with the same piece size distribution as that which they were trained on [12].”
BackgroundSelf-citationGeneralized hyper-heuristics for solving 2D Regular and Irregular Packing Problems
Terashima‐Marín, H., Ross, P. D., Farías-Zárate, C. J., López-Camacho, E., & Valenzuela-Rendón, M. (2008) · Annals of Operations Research · doi:10.1007/s10479-008-0475-2 · Cited by 90
“Additional work related to hyper-heuristics, bin-packing methods, and their application to other optimization problems is reported by Dowsland et al. (2007), Burke et al. (2003b, 2006, 2007) , Kendall et al. (2004), and Poli et al. (2007).”
MethodA Lifelong Learning Hyper-heuristic Method for Bin Packing
Sim, K., Hart, E., & Paechter, B. (2014) · Evolutionary Computation · doi:10.1162/evco_a_00121 · Cited by 92
“Burke et al. (2009) describe the use of Genetic Programming to generate new heuristics within a Hyper-heuristic framework; this has been applied specifically to bin-packing (Burke et al.”
MethodResultInfluentialGenerating 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
“For example, in recent work [3] genetic programming [13, 14] was successfully used to evolve new heuristics in HH-Class 3 for one-dimensional online bin packing problems.”
MethodMonte Carlo hyper-heuristics for examination timetabling
Burke, E. K., Kendall, G., Mısır, M., & Özcan, E. (2010) · Annals of Operations Research · doi:10.1007/s10479-010-0782-2 · Cited by 91
“For example, Burke et al. (2006, 2007a) uses a Genetic Programming meta-heuristic as a hyper-heuristic to search for the best heuristic for solving a given online bin packing problem.”
MethodSelf-citationExamination timetabling using late acceptance hyper-heuristics
Özcan, E., Bykov, Y., Birben, M., & Burke, E. K. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4983054 · Cited by 72
“…H TABLE I SOME PREVIOUS APPLICATIONS OF HYPER-HEURISTICS Application (s) Reference (s) Benchmark function optimisation [4] [5] [6] Bin packing [7] [8] [9] [10] Channel assignment [11] Chicken catching and transportation [12] Component placement sequencing [13] Course timetabling [14] [15]…”
BackgroundSelf-citationEvolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework
Bader-El-Den, M. B., Poli, R., & Fatima, S. S. (2009) · Memetic Computing · doi:10.1007/s12293-009-0022-y · Cited by 75
Meignan, D., Koukam, A., & Créput, J.-C. (2009) · Journal of Heuristics · doi:10.1007/s10732-009-9121-7 · Cited by 65
“For instance, the hyper-heuristic of generation presented in Burke et al. (2006) uses a genetic programming system to determine a criterion for incremental solution construction.”
MethodGenetic Programming An Introductory Tutorial and a Survey of Techniques and Applications
Poli, R., Langdon, W. B., McPhee, N. F., & Koza, J. R. (2011) · UCL Discovery (University College London) · Cited by 63
Luo, J., Vanhoucke, M., Coelho, J., & Guo, W. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.116753 · Cited by 62
Genetic Programming for Dynamic Workflow Scheduling in Fog Computing
Xu, M. R., Mei, Y., Zhu, S., Zhang, B., Xiang, T., Zhang, F., & Zhang, M. (2023) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2023.3249160 · Cited by 58
“Genetic Programming Hyper-Heuristic (GPHH) [19] has been widely used to automatically generate scheduling heuristics for many combinatorial optimisation problems, including job shop scheduling [20], [21], [22], [23], bin packing [24], [25], [26] and routing problems [27], [28], [29].”
MethodTan, B., Ma, H., Mei, Y., & Zhang, M. (2020) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2020.3026338 · Cited by 57
“For the bin packing problems, GPHH has been applied to evolve the rules for 1-dimension [33], 2-dimension [34], and 3-dimension [35] problems.”
MethodThe 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
“Previous work [4], [5] demonstrated that this is achievable.”
BackgroundMethodResultInfluentialSelf-citationA genetic programming hyper-heuristic for the multidimensional knapsack problem
Drake, J. H., Hyde, M., Ibrahim, K., & Özcan, E. (2014) · Kybernetes · doi:10.1108/k-09-2013-0201 · Cited by 61
“Burke et al. [4], [5] showed that stand-alone heuristics generated using genetic programming could outperform the human designed ‘best-fit’ heuristic from the literature on unseen instances of the same class of one dimensional bin packing problems.”
MethodSelf-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
“For the bin-packing problem, [5] introduces a hyperheuristic that is driven by GP.”
BackgroundMacLachlan, J., Mei, Y., Branke, J., & Zhang, M. (2019) · Evolutionary Computation · doi:10.1162/evco_a_00267 · Cited by 49
A histogram-matching approach to the evolution of bin-packing strategies
Poli, R., Woodward, J. R., & Burke, E. K. (2007) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2007.4424926 · Cited by 49
Self-citationAbbasi-khazaei, T., & Rezvani, M. H. (2022) · Soft Computing · doi:10.1007/s00500-022-07245-y · Cited by 48
“Previous researchers have shown that bin-packing is an NP-hard problem (Burke et al. 2006).”
BackgroundThere Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists
Poli, R., & Graff, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01181-8_17 · Cited by 53
“For example, GP has evolved competitive SAT solvers [1,2,8,14], evolutionary algorithms [16,17], bin packing algorithms [5,6,22], particle swarm optimisers [7,19,20], and travelling salesman problem solvers [11,12,13,18].”
MethodQuantum-Inspired Hyper-Heuristics for Energy-Aware Scheduling on Heterogeneous Computing Systems
Chen, S., Li, Z., Yang, B., & Rudolph, G. (2015) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2462835 · Cited by 50
Evolving a Nelder–Mead Algorithm for Optimization with Genetic Programming
Fajfar, I., Puhan, J., & Bűrmen, Á. (2016) · Evolutionary Computation · doi:10.1162/evco_a_00174 · Cited by 44
“Typically, GP has been used as a hyperheuristic for combinatorial optimization and other combinatorial problems, either in its standard or in some of its modified forms (Burke et al., 2006; Koohestani and Poli, 2014; Nguyen et al., 2012; O’Neill et al., 2014; Martin and Tauritz, 2013; Nguyen et al., 2015; Sim et al.,…”
MethodVázquez-Rodríguez, J. A., & Ochoa, G. (2011) · Journal of the Operational Research Society · doi:10.1057/jors.2010.132 · Cited by 47
“…solve hard combinatorial problems, such as boolean satisfiability, (Kibria and Li, 2006; Bader-El-Den and Poli, 2008; Fukunaga, 2008), bin packing (Burke et al , 2006a, 2007c), travelling salesman problem (Keller and Poli, 2007a,b) and production scheduling (Dimopoulos and Zalzala, 2001; Geiger…”
BackgroundMethodPolyakovskiy, S., & M’Hallah, R. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.10.046 · Cited by 41
“Indeed, BP variants are generally tackled using approximate approaches that are based on meta-heuristics (Lodi et al., 2002, 2014; Sim & Hart, 2013), including GA, and hyper-heuristics (Burke et al., 2006; LópezCamacho et al., 2014; Sim et al., 2015).”
Tan, B., Ma, H., & Mei, Y. (2019) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2019.8790220 · Cited by 39
“GP has also been used for a number of variants of bin packing problems such as 1-D bin packing [23] and 2-D strip packing [24].”
MethodHyper-heuristics with a dynamic heuristic set for the home care scheduling problem
Mısır, M., Verbeeck, K., Causmaecker, P. D., & den Berghe, G. V. (2010) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2010.5586348 · Cited by 39
“For the heuristic generation, in [15], [16], [17] Genetic Programming is employed to construct high quality heuristics dedicated to solving a target problem.”
MethodHyper-heuristic decision tree induction
Vella, A., Corne, D., & Murphy, C. (2009) · World Congress on Nature and Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2009.5393568 · Cited by 41
Generation of VNS Components with Grammatical Evolution for Vehicle Routing
Drake, J. H., Kililis, N., & Özcan, E. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37207-0_3 · Cited by 40
“create heuristics for for strip packing [7] and bin packing problems [9, 11, 8] with human-competitive results.”
BackgroundA genetic programming based hyper-heuristic approach for combinatorial optimisation
Nguyen, S., Zhang, M., & Johnston, M. (2011) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2001576.2001752 · Cited by 38
“[6], [8], [9] evolved new construction heuristics for online bin packing problem with GP-HH.”
BackgroundKoohestani, B., & Poli, R. (2011) · Springer eBooks · doi:10.1007/978-1-4471-2318-7_7 · Cited by 35
“For e xample, GP has evolved competitive SAT solvers [1, 2, 14, 23], state-of-th e art or better than stateof-the-art bin packing algorithms [4, 40], particle swarm o ptimisers [39], evolutionary algorithms [31], and TSP solvers [22, 32].”
MethodCHAMP: Creating heuristics via many parameters for online bin packing
Asta, S., Özcan, E., & Parkes, A. J. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.07.005 · Cited by 36
“A particularly relevant study is provided in Burke et al. (2006).”
BackgroundMethodResultEvolving reusable 3d packing heuristics with genetic programming
Allen, S. D., Burke, E. K., Hyde, M., & Kendall, G. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1570029 · Cited by 39
Self-citationCost-Benefit Investigation of a Genetic-Programming Hyperheuristic
Keller, R. E., & Poli, R. (2008) · Springer eBooks · doi:10.1007/978-3-540-79305-2_2 · Cited by 39
“For the bin-packing problem, [4] introduces a hyperheuristic that is driven by GP.”
BackgroundKumar, R., Joshi, A. H., Banka, K. K., & Rockett, P. I. (2008) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1389095.1389335 · Cited by 36
“[2, 3] have recently described an approach to evolve a heuristic for the single objective bin packing problem using genetic programming.”
BackgroundCompetitive travelling salesmen problem: A hyper-heuristic approach
Kendall, G., & Li, J. (2012) · Journal of the Operational Research Society · doi:10.1057/jors.2012.37 · Cited by 32
“They have been applied to personnel scheduling (Cowling et al , 2000), timetabling (Burke et al , 2003a, 2005), space allocation (Bai et al , 2008), packing problems (Burke et al , 2006, 2010a), and vehicle routing problems (Pisinger and Ropke, 2007; Garrido and Riff, 2007).”
MethodSelf-citationLuo, J., Vanhoucke, M., & Coelho, J. (2023) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2023.101339 · Cited by 31
A new hyper-heuristic as a general problem solver: an implementation in HyFlex
Mısır, M., Verbeeck, K., Causmaecker, P. D., & den Berghe, G. V. (2012) · Journal of Scheduling · doi:10.1007/s10951-012-0295-8 · Cited by 36
“Burke et al. (2006a), Burke et al. (2007), Fukunaga (2008), Bader-El-Den et al. (2009), and Burke et al. (2010b) utilised genetic programming to generate low-level heuristics designed for the problem instances.”
BackgroundPolicy matrix evolution for generation of heuristics
Özcan, E., & Parkes, A. J. (2011) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2001576.2001846 · Cited by 33
“Particularly relevant is the work in [4] that used GP to evolve heuristics to decide the choice of bin for packing a given item.”
BackgroundResultInfluentialvan Lon, R. R. S., Branke, J., & Holvoet, T. (2017) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-017-9300-5 · Cited by 31
“Hyper-heuristics and GP in particular, have been applied in a wide range of contexts, including production scheduling [16], traveling salesman problems [17], bin packing [18], etc.”
BackgroundTowards mixed criticality task scheduling in cyber physical systems: Challenges and perspectives
Capota, E. A., Stangaciu, C. S., Micea, M. V., & Curiac, D.-I. (2019) · Journal of Systems and Software · doi:10.1016/j.jss.2019.06.099 · Cited by 33
Sim, K., & Hart, E. (2013) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2463372.2463555 · Cited by 25
“In [1, 5] the heuristics evolved directly decide which bin to pack an item into given the state of any partially packed bins and the characteristics of the next item presented.”
BackgroundMethodSecurity personnel routing and rostering: a hyper-heuristic approach
Mısır, M., Smet, P., Verbeeck, K., & Berghe, G. V. (2011) · Lirias · Cited by 25
Metaheuristic Design Pattern: Surrogate Fitness Functions
Brownlee, A. E. I., Woodward, J. R., & Swan, J. (2015) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/2739482.2768499 · Cited by 26
Zhang, R., Liu, F., Lin, X., Wang, Z., Lu, Z., & Zhang, Q. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-70068-2_12 · Cited by 68
A mixture experiments multi-objective hyper-heuristic
Vázquez-Rodríguez, J. A., & Petrović, S. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2012.125 · Cited by 24
“Hyper-heuristics have been very successful in many real-world problems (Cowling et al , 2002; Ross et al , 2002; Kendall and Mohamad, 2004; Bai and Kendall, 2005; Terashima-Marı´n et al , 2006; Burke et al , 2006b,c; Aickelin and Li, 2007; Va´zquez-Rodrı´guez et al, 2007; Bai et al , 2008).”
BackgroundMethodQAL-BP: an augmented Lagrangian quantum approach for bin packing
Cellini, L., Macaluso, A., & Lombardi, M. (2024) · Scientific Reports · doi:10.1038/s41598-023-50540-3 · Cited by 28
A selection hyper-heuristic for scheduling deliveries of ready-mixed concrete
Mısır, M., Vancroonenburg, W., Verbeeck, K., & den Berghe, G. V. (2011) · Cited by 22
Human-evolutionary problem solving through gamification of a bin-packing problem
Ross, N. D. F., Johns, M. B., Keedwell, E. C., & Savic, D. A. (2019) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3319619.3326871 · Cited by 21
“[10] used genetic programming to create an effective algorithm to solve bin-packing problems, allowing for algorithms to be evolved based on the state of the bins.”
MethodMcClymont, K., Keedwell, E. C., Savic, D. A., & Randall-Smith, M. (2013) · Journal of Hydroinformatics · doi:10.2166/hydro.2013.226 · Cited by 20
A Genetic Programming Hyper-Heuristic Approach to Automated Packing
Hyde, M. (2010) · Nottingham ePrints (University of Nottingham) · Cited by 25
Self-citationA hybrid evolutionary algorithm for the offline Bin Packing Problem
Borgulya, I. (2020) · Central European Journal of Operations Research · doi:10.1007/s10100-020-00695-5 · Cited by 17
“The common heuristic methods are improved versions of the approximation algorithms, versions with local searches and heuristics generated with genetic programming (Burke et al. 2006).”
MethodLearning to Solve Bin Packing Problems with an Immune Inspired Hyper-heuristic
Sim, K., Hart, E., & Paechter, B. (2013) · European Conference on Artificial Life · doi:10.1162/978-0-262-31709-2-ch126 · Cited by 16
A Hyper-Heuristic for the Orienteering Problem With Hotel Selection
Toledo, A., Riff, M.-C., & Neveu, B. (2019) · IEEE Access · doi:10.1109/access.2019.2960492 · Cited by 17
“Problem domains such as packing [23], [24], [38] and satisfiability [25]–[27] have been addressed with this methodology.”
Evolving Bin Packing Heuristic Using Micro-Differential Evolution with Indirect Representation
Sotelo-Figueroa, M. A., Soberanes, H. J. P., Carpio, M., Huacuja, H. J. F., Cruz–Reyes, L., & Soria-Alcaraz, J. A. (2012) · Studies in computational intelligence · doi:10.1007/978-3-642-33021-6_28 · Cited by 16
Providing a memory mechanism to enhance the evolutionary design of heuristics
Burke, E. K., Hyde, M. R., & Kendall, G. (2010) · IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2010.5586388 · Cited by 15
“The work in this paper extends previous work on how to evolve one dimensional bin packing heuristics [1], [9], [18].”
BackgroundSelf-citationA New Hyper-heuristic Implementation in HyFlex: a Study on Generality
Mısır, M., Verbeeck, K., Causmaecker, P. D., & den Berghe, G. V. (2011) · Lirias · Cited by 19
Hyper‐Heuristics and Metaheuristics for Selected Bio‐Inspired Combinatorial Optimization Problems
Świercz, A. (2017) · InTech eBooks · doi:10.5772/intechopen.69225 · Cited by 13
Pillay, N. (2012) · South African Computer Journal · doi:10.18489/sacj.v48i1.87 · Cited by 21
“This led to the derivation of a number of low-level construction heuristics for this domain including first-fit [9], best-fit [3], next-fit [13], worst-fit [6], better-fit [3] and Djang and Finch(2) [19] heuristics.”
BackgroundMethodEvolving an Improved Algorithm for Envelope Reduction Using a Hyper-Heuristic Approach
Koohestani, B., & Poli, R. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281512 · Cited by 13
A data-driven methodology for the automated configuration of online algorithms
Dunke, F., & Nickel, S. (2020) · Decision Support Systems · doi:10.1016/j.dss.2020.113343 · Cited by 13
Evolving mean-update selection methods for CMA-ES
Richter, S. N., Schoen, M. G., & Tauritz, D. R. (2019) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3319619.3326827 · Cited by 13
Evolution of Search Algorithms Using Graph Structured Program Evolution
Shirakawa, S., & Nagao, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01181-8_10 · Cited by 13
A New Hyperheuristic Algorithm for Cross-Domain Search Problems
Lehrbaum, A., & Musliu, N. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34413-8_41 · Cited by 24
“Existing Hyperheuristic Research Heuristic generation methods have been applied to bin-packing in [14], where a genetic programming approach was able to autonomously evolve the well known firstfit heuristic often applied by humans.”
MethodAutomatic Design of Dispatching Rules for Job Shop Scheduling with Genetic Programming
Nguyen, S. (2013) · Open Access Victoria University of Wellington | Te Herenga Waka (Figshare) · doi:10.26686/wgtn.17005813 · Cited by 14
“[29, 32, 33] proposed a GPHH framework to evolve construction heuristics for online bin packing.”
A Nature-Inspired Metaheuristic Optimization Algorithm Based on Crocodiles Hunting Search (CHS)
Kareem, S. W. (2022) · International Journal of Swarm Intelligence Research · doi:10.4018/ijsir.302616 · Cited by 12
Autoconstructive evolution for structural problems
Harrington, K., Spector, L. C., Pollack, J. B., & O’Reilly, U.-M. (2012) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/2330784.2330797 · Cited by 11
“Evolutionary computation has been used to evolve heuristics for several kinds of problems including path functions for the traveling salesman problem [21] and bin evaluation functions for bin packing problems [5].”
MethodGrammar-based genetic programming for timetabling
Den, M. B. E., & Poli, R. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4983259 · Cited by 10
“In recent work [6], a similar GP approach was successfully used to evolve new heuristics of for one-dimensional online bin packing problems, while in [5] this approach was used to evolve heuristics for the SAT problem which are specialised to solve specific sets of instances of the problem.”
MethodImproving the Bin Packing Heuristic through Grammatical Evolution Based on Swarm Intelligence
Sotelo-Figueroa, M. A., Soberanes, H. J. P., Carpio, M., Huacuja, H. J. F., Cruz–Reyes, L., & Soria-Alcaraz, J. A. (2014) · Mathematical Problems in Engineering · doi:10.1155/2014/545191 · Cited by 10
Hyper-heuristics: Autonomous Problem Solvers
Mısır, M. (2021) · Natural computing series · doi:10.1007/978-3-030-72069-8_7 · Cited by 10
A Genetic Programming Approach for Evolving Variable Selectors in Constraint Programming
Nguyen, S., Thiruvady, D., Zhang, M., & Tan, K. C. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2021.3050465 · Cited by 11
“Different from conventional optimization approaches, AHD is a hyperheuris-tic approach [26]–[29] that explores the heuristic search space rather than the solution search space.”
BackgroundMethodMatrix Analysis of Genetic Programming Mutation
Parkes, A. J., Özcan, E., & Hyde, M. R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29139-5_14 · Cited by 10
“This system is presented in [5,6], and is also employed in this paper.”
MethodSelf-citationKrasnogor, N. (2012) · Springer eBooks · doi:10.1007/978-3-540-92910-9_29 · Cited by 15
Drake, J. H., Swan, J., Neumann, G., & Özcan, E. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-55453-2_13 · Cited by 8
“An example of a GP solution to the bin packing problem can be found in the work of Burke et al. [15].”
MethodFast algorithms for online construction of web tag clouds
Marszałkowski, J., Mokwa, D., Drozdowski, M., Rusiecki, Ł., & Narożny, H. (2017) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.06.023 · Cited by 8
Towards Bin Packing (preliminary problem survey, models with multiset estimates)Preprint
Levin, M. S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.07574 · Cited by 7
“Combinations of evolutionary algorithms and hyper-heuristics [42,198,236]”
MethodAutomated code generation by local search
Hyde, M. R., Burke, E. K., & Kendall, G. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2012.149 · Cited by 7
“Constructive heuristics for one dimensional bin packing have been evolved by genetic programming by Burke et al (2006, 2007a,b), showing that evolved constructive bin packing heuristics can perform better than the best-fit heuristic (Kenyon, 1996) on new problems with the same piece size…”
BackgroundSelf-citationSelf-adaptive hyperheuristic and greedy search
Keller, R. E., & Poli, R. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4631313 · Cited by 6
“For the bin-packing problem, [5] introduces a hyperheuristic that is driven by GP.”
BackgroundKeller, R. E., & Poli, R. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4631224 · Cited by 8
“For the bin-packing problem, GP has produced state-of-the-art or better than state-of-the-art hyperheuristics [6], [7], [26].”
BackgroundMathematical models and decomposition algorithms for cutting and packing problems
Delorme, M. (2017) · 4OR · doi:10.1007/s10288-017-0365-z · Cited by 6
A steady state micro genetic algorithm for hyper-heuristic generation in one-dimensional bin packing
Juárez, J., Falcón-Cardona, J. G., & Ortíz-Bayliss, J. C. (2025) · Scientific Reports · doi:10.1038/s41598-025-10790-9 · Cited by 5
“Regarding the BPP, GAs and Genetic Programming (GP) approaches have been extensively studied 7,8,18–20 .”
Ortíz-Bayliss, J. C., Juárez, J., & Falcón-Cardona, J. G. (2023) · International Conference on Soft Computing & Machine Intelligence (ISCMI) · doi:10.1109/iscmi59957.2023.10458597 · Cited by 4
“Genetic Programming (GP) was first used to produce hyper-heuristics in 2006 by Burke et al., where they solved the bin packing problem [7].”
MethodEfficient query retrieval in Neo4jHA using metaheuristic social data allocation scheme
Mathew, A. B., Kumar, S. D. M., Krishnan, K. M., & Salam, S. M. (2017) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2017.12.005 · Cited by 4
Evolving and reusing Bin Packing heuristic through Grammatical Differential Evolution
Sotelo-Figueroa, M. A., Soberanes, H. J. P., Carpio, M., Huacuja, H. J. F., Cruz–Reyes, L., & Soria-Alcaraz, J. A. (2013) · World Congress on Nature and Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2013.6617844 · Cited by 4
“The elements from Table I were the result of a preliminary analysis [6] in which the terminals and non-terminals for the BPP were identified.”
BackgroundMethodResultModeling fabric cutting scheduling as mixed integer programming
Wang, T.-J., Peng, J., & Hung, Y.-F. (2016) · IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) · doi:10.1109/ieem.2016.7798012 · Cited by 4
“[15] used a genetic programming system to solve on-line bin packing problem.”
Method
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.