{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T19:34:19Z","timestamp":1766086459083},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406037"},{"type":"electronic","value":"9783540451105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45110-2_5","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T09:04:48Z","timestamp":1197277488000},"page":"1295-1306","source":"Crossref","is-referenced-by-count":54,"title":["Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics"],"prefix":"10.1007","author":[{"given":"Peter","family":"Ross","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier G.","family":"Mar\u00edn-Bl\u00e1zquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonia","family":"Schulenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emma","family":"Hart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"5_CR1","unstructured":"http:\/\/www.ms.ic.ac.uk\/info.html\n                    \n                  ."},{"key":"5_CR2","unstructured":"http:\/\/www.bwl.tu-darmstadt.de\/bwl3\/forsch\/projekte\/binpp\/\n                    \n                  ."},{"key":"5_CR3","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"E.G. Coffman","year":"1996","unstructured":"E.G. Coffman, M.R. Garey, and D.S. Johnson. Approximation algorithms for bin packing: a survey. In D. Hochbaum, editor, Approximation algorithms for NP-hard problems, pages 46\u201393. PWS Publishing, Boston, 1996."},{"key":"5_CR4","unstructured":"Philipp A. Djang and Paul R. Finch. Solving One Dimensional Bin Packing Problems. 1998."},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1162\/evco.1994.2.2.123","volume":"2","author":"E. Falkenauer","year":"1994","unstructured":"Emanuel Falkenauer. A new representation and operators for genetic algorithms applied to grouping problems. Evolutionary Computation, 2(2):123\u2013144, 1994.","journal-title":"Evolutionary Computation"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E. Falkenauer","year":"1996","unstructured":"Emanuel Falkenauer. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5\u201330, 1996.","journal-title":"Journal of Heuristics"},{"key":"5_CR7","unstructured":"Emanuele Falkenauer. A Hybrid Grouping Genetic Algorithm for Bin Packing. Working Paper IDSIA-06-99, CRIF Industrial Management and Automation, CP 106-P4, 50 av. F.D.Roosevelt, B-1050 Brussels, Belgium, 1994."},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1009678411503","volume":"3","author":"I.P. Gent","year":"1998","unstructured":"I.P. Gent. Heuristic Solution of Open Bin Packing Problems. Journal of Heuristics, 3(4):299\u2013304, 1998.","journal-title":"Journal of Heuristics"},{"key":"5_CR9","unstructured":"D.S. Johnson. Near-optimal bin-packing algorithms. PhD thesis, MIT Department of Mathematics, 1973."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Sami Khuri, Martin Schutz, and J\u00f6rg Heitk\u00f6tter. Evolutionary Heuristics for the Bin Packing Problem. In D.W. Pearson, N.C. Steele, and R.F. Albrecht, editors, Artificial Neural Nets and Genetic Algorithms: Proceedings of the International Conference in Ales, France, 1995, 1995.","DOI":"10.1007\/978-3-7091-7535-4_75"},{"key":"5_CR11","unstructured":"Silvano Martello and Paolo Toth. Knapsack Problems. Algorithms and Computer Implementations. John Wiley & Sons, 1990."},{"key":"5_CR12","unstructured":"Peter Ross, Sonia Schulenburg, Javier G. Mar\u00edn-Bl\u00e1zquez, and Emma Hart. Hyperheuristics: learning to combine simple heuristics in bin packing problems. In Genetic and Evolutionary Computation Conference, New York, NY, 2002. Winner of the Best Paper Award in the Learning Classifier Systems Category of GECCO 2002."},{"key":"5_CR13","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Learning Classifier Systems: From Foundations to Applications","author":"S. Schulenburg","year":"2003","unstructured":"Sonia Schulenburg, Peter Ross, Javier G. Mar\u00edn-Bl\u00e1zquez, and Emma Hart. A Hyper-Heuristic Approach to Single and Multiple Step Environments in Bin-Packing Problems. In Pier Luca Lanzi, Wolfgang Stolzmann, and Stewart W. Wilson, editors, Learning Classifier Systems: From Foundations to Applications, Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, 2003. In press."},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/evco.1995.3.2.149","volume":"3","author":"S. W. Wilson","year":"1995","unstructured":"Stewart W. Wilson. Classifier Systems Based on Accuracy. Evolutionary Computation, 3(2):149\u2013175, 1995.","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2014 GECCO 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45110-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T22:26:00Z","timestamp":1551219960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45110-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406037","9783540451105"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45110-2_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}