{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T16:24:36Z","timestamp":1777652676119,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,10,25]],"date-time":"2008-10-25T00:00:00Z","timestamp":1224892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10479-008-0449-4","type":"journal-article","created":{"date-parts":[[2008,10,24]],"date-time":"2008-10-24T13:24:16Z","timestamp":1224854656000},"page":"203-220","source":"Crossref","is-referenced-by-count":80,"title":["A\u00a0hybrid GRASP\/VND algorithm for\u00a0two-\u00a0and\u00a0three-dimensional bin packing"],"prefix":"10.1007","volume":"179","author":[{"given":"F.","family":"Parre\u00f1o","sequence":"first","affiliation":[]},{"given":"R.","family":"Alvarez-Valdes","sequence":"additional","affiliation":[]},{"given":"J. F.","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"J. M.","family":"Tamarit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,25]]},"reference":[{"key":"449_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1057\/jors.1985.51","volume":"36","author":"J.\u00a0E. Beasley","year":"1985","unstructured":"Beasley,\u00a0J.\u00a0E. (1985a). Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society, 36, 297\u2013306.","journal-title":"Journal of the Operational Research Society"},{"key":"449_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"J.\u00a0E. Beasley","year":"1985","unstructured":"Beasley,\u00a0J.\u00a0E. (1985b). An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research, 33, 49\u201364.","journal-title":"Operations Research"},{"key":"449_CR3","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.\u00a0E. Beasley","year":"1990","unstructured":"Beasley,\u00a0J.\u00a0E. (1990). OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41, 1069\u20131072.","journal-title":"Journal of the Operational Research Society"},{"key":"449_CR4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1093\/comjnl\/25.3.353","volume":"25","author":"B.\u00a0E. Bengtsson","year":"1982","unstructured":"Bengtsson,\u00a0B.\u00a0E. (1982). Packing rectangular pieces\u2014a heuristic approach. The Computer Journal, 25, 353\u2013357.","journal-title":"The Computer Journal"},{"key":"449_CR5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"J.\u00a0O. Berkey","year":"1987","unstructured":"Berkey,\u00a0J.\u00a0O., & Wang,\u00a0P.\u00a0Y. (1987). Two dimensional finite bin packing algorithms. Journal of the Operational Research Society, 38, 423\u2013429.","journal-title":"Journal of the Operational Research Society"},{"key":"449_CR6","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/0377-2217(95)00031-K","volume":"84","author":"E.\u00a0E. Bischoff","year":"1995","unstructured":"Bischoff,\u00a0E.\u00a0E., Janetz,\u00a0F., & Ratcliff,\u00a0M.\u00a0S.\u00a0W. (1995). Loading pallets with non-identical items. European Journal of Operational Research, 84, 681\u2013692.","journal-title":"European Journal of Operational Research"},{"key":"449_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.dam.2003.08.004","volume":"140","author":"M.\u00a0A. Boschetti","year":"2004","unstructured":"Boschetti,\u00a0M.\u00a0A. (2004). New lower bounds for the finite three-dimensional bin packing problem. Discrete Applied Mathematics, 140, 241\u2013258.","journal-title":"Discrete Applied Mathematics"},{"key":"449_CR8","first-page":"27","volume":"1","author":"M.\u00a0A. Boschetti","year":"2003","unstructured":"Boschetti,\u00a0M.\u00a0A., & Mingozzi,\u00a0A. (2003a). Two-dimensional finite bin packing problems. Part\u00a0I: New lower and upper bounds. 4OR, 1, 27\u201342.","journal-title":"4OR"},{"key":"449_CR9","first-page":"135","volume":"2","author":"M.\u00a0A. Boschetti","year":"2003","unstructured":"Boschetti,\u00a0M.\u00a0A., & Mingozzi,\u00a0A. (2003b). Two-dimensional finite bin packing problems. Part\u00a0II: New lower and upper bounds. 4OR, 2, 135\u2013147.","journal-title":"4OR"},{"issue":"1","key":"449_CR10","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N. Christofides","year":"1977","unstructured":"Christofides,\u00a0N., & Whitlock,\u00a0C. (1977). An algorithm for two-dimensional cutting problems. Operations Research, 25(1), 30\u201344.","journal-title":"Operations Research"},{"key":"449_CR11","author":"T.\u00a0G. Crainic","year":"2008","unstructured":"Crainic,\u00a0T.\u00a0G., Perboli,\u00a0G., & Tadei,\u00a0R. (2008). TS 2 PACK: A\u00a0two-level tabu search for the three-dimensional bin packing problem. European Journal of Operational Research. doi: 10.1016\/j.ejr.2007.06.063 .","journal-title":"European Journal of Operational Research"},{"key":"449_CR12","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1287\/opre.1050.0210","volume":"53","author":"E. Boef den","year":"2005","unstructured":"den\u00a0Boef,\u00a0E., Korst,\u00a0J., Martello,\u00a0S., Pisinger,\u00a0D., & Vigo,\u00a0D. (2005). Erratum to \u2018The three-dimensional bin packing problem\u2019: robot-packable and orthogonal variants of packing problems. Operations Research, 53, 735\u2013736.","journal-title":"Operations Research"},{"issue":"3","key":"449_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/ijoc.15.3.267.16080","volume":"15","author":"O. Faroe","year":"2003","unstructured":"Faroe,\u00a0O., Pisinger,\u00a0D., & Zachariasen,\u00a0M. (2003). Guided local search for the three-dimensional bin-packing problem. INFORMS Journal on Computing, 15(3), 267\u2013283.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"449_CR14","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/moor.1030.0079","volume":"29","author":"S.\u00a0P. Fekete","year":"2004","unstructured":"Fekete,\u00a0S.\u00a0P., & Schepers,\u00a0J. (2004a). A\u00a0combinatorial characterization of higher-dimensional orthogonal packing. Mathematics of Operations Research, 29(2), 353\u2013368.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"449_CR15","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"S. P. Fekete","year":"2004","unstructured":"Fekete,\u00a0S. P., & Schepers,\u00a0J. (2004b). A\u00a0general framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research, 60(2), 311\u2013329.","journal-title":"Mathematical Methods of Operations Research"},{"key":"449_CR16","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1016\/j.ejor.2006.04.023","volume":"183","author":"S.\u00a0P. Fekete","year":"2007","unstructured":"Fekete,\u00a0S.\u00a0P., & Van der\u00a0Veen,\u00a0J.\u00a0C. (2007). PackLib2: An integrated library of multi-dimensional packing problems. European Journal of Operational Research 183, 1131\u20131135.","journal-title":"European Journal of Operational Research"},{"key":"449_CR17","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"S.\u00a0P. Fekete","year":"2007","unstructured":"Fekete,\u00a0S.\u00a0P., Schepers,\u00a0J., & Van\u00a0der\u00a0Veen,\u00a0J.\u00a0C. (2007). An exact algorithm for higher-dimensional packing. Operations Research, 55, 569\u2013587.","journal-title":"Operations Research"},{"key":"449_CR18","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.\u00a0A. Feo","year":"1989","unstructured":"Feo,\u00a0T.\u00a0A., & Resende,\u00a0M.\u00a0G.\u00a0C. (1989). A\u00a0probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8, 67\u201371.","journal-title":"Operations Research Letters"},{"key":"449_CR19","volume-title":"Non parametric statistical inference","author":"J. D. Gibbons","year":"2003","unstructured":"Gibbons,\u00a0J. D., & Chakraborti,\u00a0S. (2003). Non parametric statistical inference (4th ed.). New York: Marcel Dekker.","edition":"4"},{"key":"449_CR20","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/0-387-28356-0_8","volume-title":"Search methodologies: introductory tutorials in optimization and decision support techniques","author":"P. Hansen","year":"2005","unstructured":"Hansen,\u00a0P., & Mladenovic,\u00a0N. (2005). Variable neighborhood search. In E.\u00a0Burke & G.\u00a0Kendall (Eds.), Search methodologies: introductory tutorials in optimization and decision support techniques (pp.\u00a0211\u2013238). Berlin: Springer."},{"issue":"1","key":"449_CR21","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/S0377-2217(97)00388-3","volume":"112","author":"A. Lodi","year":"1999","unstructured":"Lodi,\u00a0A., Martello,\u00a0S., & Vigo,\u00a0D. (1999). Approximation algorithms for the oriented two-dimensional bin packing problem. European Journal of Operational Research, 112(1), 158\u2013166.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"449_CR22","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/S0377-2217(02)00134-0","volume":"141","author":"A. Lodi","year":"2002","unstructured":"Lodi,\u00a0A., Martello,\u00a0S., & Vigo,\u00a0D. (2002). Heuristic algorithms for the three-dimensional bin packing problem. European Journal of Operational Research, 141(2), 410\u2013420.","journal-title":"European Journal of Operational Research"},{"key":"449_CR23","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/B:ANOR.0000039519.03572.08","volume":"131","author":"A. Lodi","year":"2004","unstructured":"Lodi,\u00a0A., Martello,\u00a0S., & Vigo,\u00a0D. (2004). TSpack: a unified tabu search code for multi-dimensional bin packing problems. Annals of Operations Research, 131, 203\u2013213.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"449_CR24","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S. Martello","year":"1998","unstructured":"Martello,\u00a0S., & Vigo,\u00a0D. (1998). Exact solution of the two-dimensional finite bin packing problem. Management Science, 44(3), 388\u2013399.","journal-title":"Management Science"},{"key":"449_CR25","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"40","author":"S. Martello","year":"2000","unstructured":"Martello,\u00a0S., Pisinger,\u00a0D., & Vigo,\u00a0D. (2000). The three-dimensional bin packing problem. Operations Research, 40, 256\u2013267.","journal-title":"Operations Research"},{"key":"449_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1206040.1206047","volume":"33","author":"S. Martello","year":"2007","unstructured":"Martello,\u00a0S., Pisinger,\u00a0D., Vigo,\u00a0D., den\u00a0Boef,\u00a0E., & Korst,\u00a0J. (2007). Algorithm 864: Algorithms for general and robot-packable variants of the three-dimensional bin packing problem. ACM Transactions on Mathematical Software, 33, 1.","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"1","key":"449_CR27","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1287\/ijoc.1040.0089","volume":"18","author":"M. Monaci","year":"2006","unstructured":"Monaci,\u00a0M., & Toth,\u00a0P. (2006). A\u00a0set-covering-based heuristic approach for bin-packing problems. INFORMS Journal on Computing, 18(1), 71\u201385.","journal-title":"INFORMS Journal on Computing"},{"key":"449_CR28","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/ijoc.1070.0254","volume":"20","author":"F. Parre\u00f1o","year":"2008","unstructured":"Parre\u00f1o,\u00a0F., Alvarez-Valdes,\u00a0R., Oliveira,\u00a0J.\u00a0F., & Tamarit,\u00a0J.\u00a0M. (2008a). A\u00a0maximal-space algorithm for the container loading problem. INFORMS Journal on Computing, 20, 412\u2013422.","journal-title":"INFORMS Journal on Computing"},{"key":"449_CR29","author":"F. Parre\u00f1o","year":"2008","unstructured":"Parre\u00f1o,\u00a0F., Alvarez-Valdes,\u00a0R., Oliveira,\u00a0J.\u00a0F., & Tamarit,\u00a0J.\u00a0M. (2008b). Neighborhood structures for the container loading problem: a VNS implementation. Journal of Heuristics. doi: 10.1007\/s10732-008-9081-3 .","journal-title":"Journal of Heuristics"},{"issue":"3","key":"449_CR30","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"2000","unstructured":"Prais,\u00a0M., & Ribeiro,\u00a0C.\u00a0C. (2000). Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12(3), 164\u2013176.","journal-title":"INFORMS Journal on Computing"},{"key":"449_CR31","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of metaheuristics","author":"M.\u00a0G.\u00a0C. Resende","year":"2003","unstructured":"Resende,\u00a0M.\u00a0G.\u00a0C., & Ribeiro,\u00a0C.\u00a0C. (2003). Greedy randomized adaptive search procedures. In F.\u00a0Glover & G.\u00a0Kochenberger (Eds.), Handbook of metaheuristics (pp.\u00a0219\u2013249). Dordrecht: Kluwer Academic."},{"key":"449_CR32","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G. W\u00e4scher","year":"2007","unstructured":"W\u00e4scher,\u00a0G., Haussner,\u00a0H., & Schumann,\u00a0H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research. 183, 1109\u20131130.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0449-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0449-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0449-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:50Z","timestamp":1559153270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0449-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,25]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["449"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0449-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,25]]}}}