{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T06:22:47Z","timestamp":1776752567495,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540389903","type":"print"},{"value":"9783540389910","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11844297_87","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T18:55:37Z","timestamp":1160074537000},"page":"860-869","source":"Crossref","is-referenced-by-count":77,"title":["Evolving Bin Packing Heuristics with Genetic Programming"],"prefix":"10.1007","author":[{"given":"E. K.","family":"Burke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. R.","family":"Hyde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Kendall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"87_CR1","volume-title":"Genetic Programming II: Automatic Discovery of Reusable Programs","author":"J.R. Koza","year":"1994","unstructured":"Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. The MIT Press, Cambridge, Massachusetts (1994)"},{"key":"87_CR2","volume-title":"Genetic Programming III: Darwinian Invention and Problem solving","author":"J.R. Koza","year":"1999","unstructured":"Koza, J.R., Bennett III, F.H., Andre, D., Keane, M.A.: Genetic Programming III: Darwinian Invention and Problem solving. Morgan Kaufmann, San Francisco (1999)"},{"key":"87_CR3","volume-title":"Genetic Programming: on the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: on the Programming of Computers by Means of Natural Selection. The MIT Press, Boston, Massachusetts (1992)"},{"key":"87_CR4","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/0-387-28356-0_17","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"P. Ross","year":"2005","unstructured":"Ross, P.: Hyper-heuristics. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 529\u2013556. Kluwer, Boston (2005)"},{"key":"87_CR5","first-page":"457","volume-title":"Handbook of Meta-Heuristics","author":"E.K. Burke","year":"2003","unstructured":"Burke, E.K., Hart, E., Kendall, G., Newall, J., Ross, P., Schulenburg, S.: Hyper-heuristics: An emerging direction in modern search technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Meta-Heuristics, pp. 457\u2013474. Kluwer, Dordrecht (2003)"},{"key":"87_CR6","unstructured":"Soubeiga, E.: Development and Application of Hyperheuristics to Personnel Scheduling. PhD thesis, Univesity of Nottingham, School of Computer Science (2003)"},{"key":"87_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"4","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation\u00a04, 67\u201382 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"87_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/0-387-28356-0_11","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"D. Whitley","year":"2005","unstructured":"Whitley, D., Watson, J.P.: Complexity theory and the no free lunch theorem. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 317\u2013339. Kluwer, Boston (2005)"},{"key":"87_CR9","unstructured":"Ross, P., Schulenburg, S., Marin-Blazquez, J.G., Hart, E.: Hyper heuristics: Learning to combine simple heuristics in bin packing problems. In: Proceedings of the Genetic and Evolutionary Computation Conference 2002 (GECCO 2002), pp. 942\u2013948 (2002)"},{"key":"87_CR10","doi-asserted-by":"crossref","unstructured":"Ross, P., Marin-Blazquez, J.G., Schulenburg, S., Hart, E.: Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyperheurstics. In: Proceedings of the Genetic and Evolutionary Computation Conference 2003 (GECCO 2003), Chicago, Illinois, pp. 1295\u20131306 (2003)","DOI":"10.1007\/3-540-45110-2_5"},{"key":"87_CR11","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Kendall, G., Landa Silva, J.D., O\u2019Brien, R.F.J., Soubeiga, E.: An ant algorithm hyperheuristic for the project presentation scheduling problem. In: Proceedings of the Congress on Evolutionary Computation 2005 (CEC 2005), Edinburgh, U.K., vol.\u00a03, pp. 2263\u20132270 (2005)","DOI":"10.1109\/CEC.2005.1554976"},{"key":"87_CR12","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E.K. Burke","year":"2003","unstructured":"Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyper-heuristic for timetabling and rostering. Journal of Heuristics\u00a09, 451\u2013470 (2003)","journal-title":"Journal of Heuristics"},{"key":"87_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"Practice and Theory of Automated Timetabling III","author":"P. Cowling","year":"2001","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 176\u2013190. Springer, Heidelberg (2001)"},{"key":"87_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/0-387-25383-1_6","volume-title":"Meta-heuristics: Progress as Real Problem Solvers, Selected Papers from the 5th Metaheuristics International Conference (MIC 2003)","author":"E.K. Burke","year":"2005","unstructured":"Burke, E.K., Landa Silva, J.D., Soubeiga, E.: Multi-objective hyper-heuristic approaches for space allocation and timetabling. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Meta-heuristics: Progress as Real Problem Solvers, Selected Papers from the 5th Metaheuristics International Conference (MIC 2003), pp. 129\u2013158. Springer, Heidelberg (2005)"},{"key":"87_CR15","unstructured":"Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper heuristic for educational timetabling problems. European Journal of Operational Research (in press, to appear 2006, available online November 21, 2005)"},{"key":"87_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10951-006-6775-y","volume":"9","author":"E.K. Burke","year":"2006","unstructured":"Burke, E.K., Petrovic, S., Qu, R.: Case based heuristic selection for timetabling problems. Journal of Scheduling\u00a09, 115\u2013132 (2006)","journal-title":"Journal of Scheduling"},{"key":"87_CR17","unstructured":"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)"},{"key":"87_CR18","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley and Sons, Chichester (1990)"},{"key":"87_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E. Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics\u00a02, 5\u201330 (1996)","journal-title":"Journal of Heuristics"},{"key":"87_CR20","unstructured":"Beasley, J.E.: Binpacking benchmark data, at the brunell university or-library. (Last modified: 07-09-2004) [accessed March 1, 2006], Available at: http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/binpackinfo.html"},{"key":"87_CR21","volume-title":"Handbook of Combinatorial Optimization","author":"E.G. Coffman Jr.","year":"1998","unstructured":"Coffman Jr., E.G., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: Combinatorial analysis. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, Kluwer, Dordrecht (1998)"},{"key":"87_CR22","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Fransisco (1979)"},{"key":"87_CR23","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.18.2.438","volume":"18","author":"W.T. Rhee","year":"1993","unstructured":"Rhee, W.T., Talagrand, M.: On line bin packing with items of random size. Math. Oper. Res.\u00a018, 438\u2013445 (1993)","journal-title":"Math. Oper. Res."},{"key":"87_CR24","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D. Johnson","year":"1974","unstructured":"Johnson, D., Demers, A., Ullman, J., Garey, M., Graham, R.: Worst-case performance bounds for simple one-dimensional packaging algorithms. SIAM Journal on Computing\u00a03, 299\u2013325 (1974)","journal-title":"SIAM Journal on Computing"},{"key":"87_CR25","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/0-387-28356-0_5","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"J.R. Koza","year":"2005","unstructured":"Koza, J.R., Poli, R.: Genetic programming. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 127\u2013164. Kluwer, Boston (2005)"},{"key":"87_CR26","doi-asserted-by":"crossref","unstructured":"Bernstein, Y., Li, X., Ciesielski, V., Song, A.: Multiobjective parsimony enforcement for superior generalisation performance. In: Proceedings of the Congress for Evolutionary Computation 2004 (CEC 2004), Portland, Oregon, pp. 83\u201389 (2004)","DOI":"10.1109\/CEC.2004.1330841"},{"key":"87_CR27","doi-asserted-by":"crossref","unstructured":"Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: Proceedings of the IEEE 1992 Int. Conference on Robotics and Automation, Nice, France, pp. 1186\u20131192 (1992)","DOI":"10.1109\/ROBOT.1992.220088"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN IX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/11844297_87","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T07:11:46Z","timestamp":1736579506000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/11844297_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540389903","9783540389910"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11844297_87","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}