{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T05:26:16Z","timestamp":1773638776955,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T00:00:00Z","timestamp":1327968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10489-012-0337-0","type":"journal-article","created":{"date-parts":[[2012,1,30]],"date-time":"2012-01-30T00:05:48Z","timestamp":1327881948000},"page":"431-445","source":"Crossref","is-referenced-by-count":38,"title":["The six elements to block-building approaches for the single container loading problem"],"prefix":"10.1007","volume":"37","author":[{"given":"Wenbin","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wee-Chong","family":"Oon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yujian","family":"Weng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,31]]},"reference":[{"issue":"3","key":"337_CR1","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1016\/j.ejor.2004.04.037","volume":"168","author":"EE Bischoff","year":"2006","unstructured":"Bischoff EE (2006) Three-dimensional packing of items with limited load bearing strength. Eur J Oper Res 168(3):952\u2013966. doi: 10.1016\/j.ejor.2004.04.037","journal-title":"Eur J Oper Res"},{"issue":"4","key":"337_CR2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","volume":"23","author":"EE Bischoff","year":"1995","unstructured":"Bischoff EE, Ratcliff MSW (1995) Issues in the development of approaches to container loading. OMEGA Int J Manag Sci 23(4):377\u2013390. doi: 10.1016\/0305-0483(95)00015-G","journal-title":"OMEGA Int J Manag Sci"},{"issue":"1","key":"337_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0377-2217(00)00055-2","volume":"131","author":"A Bortfeldt","year":"2001","unstructured":"Bortfeldt A, Gehring H (2001) A hybrid genetic algorithm for the container loading problem. Eur J Oper Res 131(1):143\u2013161. doi: 10.1016\/S0377-2217(00)00055-2","journal-title":"Eur J Oper Res"},{"issue":"5","key":"337_CR4","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0167-8191(03)00047-4","volume":"29","author":"A Bortfeldt","year":"2003","unstructured":"Bortfeldt A, Gehring H, Mack D (2003) A parallel tabu search algorithm for solving the container loading problem. Parallel Comput 29(5):641\u2013662. doi: 10.1016\/S0167-8191(03)00047-4","journal-title":"Parallel Comput"},{"issue":"3","key":"337_CR5","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.ejor.2011.04.017","volume":"214","author":"CH Che","year":"2011","unstructured":"Che CH, Huang W, Lim A, Zhu W (2011) The multiple container loading cost minimization problem. Eur J Oper Res 214(3):501\u2013511. doi: 10.1016\/j.ejor.2011.04.017 ,","journal-title":"Eur J Oper Res"},{"issue":"1\u20132","key":"337_CR6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0360-8352(98)00084-9","volume":"35","author":"CF Chien","year":"1998","unstructured":"Chien CF, Wu WT (1998) A recursive computational procedure for container loading. Comput Ind Eng 35(1\u20132):319\u2013322. doi: 10.1016\/S0360-8352(98)00084-9","journal-title":"Comput Ind Eng"},{"issue":"3","key":"337_CR7","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(98)00139-8","volume":"114","author":"AP Davies","year":"1999","unstructured":"Davies AP, Bischoff EE (1999) Weight distribution considerations in container loading. Eur J Oper Res 114(3):509\u2013527. doi: 10.1016\/S0377-2217(98)00139-8","journal-title":"Eur J Oper Res"},{"key":"337_CR8","series-title":"Contributions to management science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58165-6","volume-title":"Cutting and packing in production and distribution: a typology and bibliography","author":"H Dyckhoff","year":"1992","unstructured":"Dyckhoff H, Finke U (1992) Cutting and packing in production and distribution: a typology and bibliography, 1st edn. Contributions to management science. Physica-Verlag, Heidelberg","edition":"1"},{"issue":"2","key":"337_CR9","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(02)00133-9","volume":"141","author":"M Eley","year":"2002","unstructured":"Eley M (2002) Solving container loading problems by block arrangement. Eur J Oper Res 141(2):393\u2013409. doi: 10.1016\/S0377-2217(02)00133-9","journal-title":"Eur J Oper Res"},{"issue":"2","key":"337_CR10","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1287\/ijoc.1090.0338","volume":"22","author":"T Fanslau","year":"2010","unstructured":"Fanslau T, Bortfeldt A (2010) A tree search algorithm for solving the container loading problem. INFORMS J Comput 22(2):222\u2013235. doi: 10.1287\/ijoc.1090.0338","journal-title":"INFORMS J Comput"},{"issue":"2","key":"337_CR11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/moor.1030.0079","volume":"29","author":"SP Fekete","year":"2004","unstructured":"Fekete SP, Schepers J (2004) A combinatorial characterization of higher-dimensional orthogonal packing. Math Oper Res 29(2):353\u2013368. doi: 10.1287\/moor.1030.0079","journal-title":"Math Oper Res"},{"issue":"3","key":"337_CR12","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"SP Fekete","year":"2007","unstructured":"Fekete SP, Schepers J, van\u00a0der Veen JC (2007) An exact algorithm for higher-dimensional orthogonal packing. Oper Res 55(3):569\u2013587. doi: 10.1287\/opre.1060.0369","journal-title":"Oper Res"},{"issue":"5\u20136","key":"337_CR13","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1111\/j.1475-3995.1997.tb00095.x","volume":"4","author":"H Gehring","year":"1997","unstructured":"Gehring H, Bortfeldt A (1997) A genetic algorithm for solving the container loading problem. Int Trans Oper Res 4(5\u20136):401\u2013418. doi: 10.1111\/j.1475-3995.1997.tb00095.x","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"337_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.cor.2011.03.009","volume":"39","author":"JF Gon\u00e7alves","year":"2012","unstructured":"Gon\u00e7alves JF, Resende MGC (2012) A parallel multi-population biased random-key genetic algorithm for a container loading problem. Comput Oper Res 39(2):179\u2013190. doi: 10.1016\/j.cor.2011.03.009","journal-title":"Comput Oper Res"},{"issue":"2","key":"337_CR15","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1090\/S0002-9947-1982-0662044-8","volume":"272","author":"P Hanlon","year":"1982","unstructured":"Hanlon P (1982) Counting interval graphs. Trans Am Math Soc 272(2):383\u2013426. doi: 10.2307\/1998705","journal-title":"Trans Am Math Soc"},{"issue":"1","key":"337_CR16","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.cor.2010.04.015","volume":"38","author":"K He","year":"2011","unstructured":"He K, Huang W (2011) An efficient placement heuristic for three-dimensional rectangular packing. Comput Oper Res 38(1):227\u2013233. doi: 10.1016\/j.cor.2010.04.015","journal-title":"Comput Oper Res"},{"issue":"1","key":"337_CR17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ejor.2008.02.024","volume":"196","author":"W Huang","year":"2009","unstructured":"Huang W, He K (2009) A caving degree approach for the single container loading problem. Eur J Oper Res 196(1):93\u2013101. doi: 10.1016\/j.ejor.2008.02.024","journal-title":"Eur J Oper Res"},{"key":"337_CR18","doi-asserted-by":"crossref","first-page":"3270","DOI":"10.1016\/j.cor.2005.12.005","volume":"34","author":"W Huang","year":"2007","unstructured":"Huang W, Chen D, Xu R (2007) A new heuristic algorithm for rectangle packing. Comput Oper Res 34:3270\u20133280","journal-title":"Comput Oper Res"},{"key":"337_CR19","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1145\/1066677.1066888","volume-title":"SAC\u201905: Proceedings of the 2005 ACM symposium on applied computing","author":"A Lim","year":"2005","unstructured":"Lim A, Zhang X (2005) The container loading problem. In: SAC\u201905: Proceedings of the 2005 ACM symposium on applied computing. ACM, New York, pp 913\u2013917. doi: 10.1145\/1066677.1066888"},{"issue":"6","key":"337_CR20","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.omega.2003.08.004","volume":"31","author":"A Lim","year":"2003","unstructured":"Lim A, Rodrigues B, Wang Y (2003) A multi-faced buildup algorithm for three-dimensional packing problems. OMEGA Int J Manag Sci 31(6):471\u2013481. doi: 10.1016\/j.omega.2003.08.004","journal-title":"OMEGA Int J Manag Sci"},{"issue":"2","key":"337_CR21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10489-005-5601-0","volume":"22","author":"A Lim","year":"2005","unstructured":"Lim A, Rodrigues B, Yang Y (2005) 3-D container packing heuristics. Appl Intell 22(2):125\u2013134. doi: 10.1007\/s10489-005-5601-0","journal-title":"Appl Intell"},{"issue":"2","key":"337_CR22","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/S0377-2217(02)00135-2","volume":"141","author":"L Lins","year":"2002","unstructured":"Lins L, Lins S, Morabito R (2002) An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container. Eur J Oper Res 141(2):421\u2013439. doi: 10.1016\/S0377-2217(02)00135-2","journal-title":"Eur J Oper Res"},{"issue":"5","key":"337_CR23","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1111\/j.1475-3995.2004.00474.x","volume":"11","author":"D Mack","year":"2004","unstructured":"Mack D, Bortfeldt A, Gehring H (2004) A parallel hybrid local search algorithm for the container loading problem. Int Trans Oper Res 11(5):511\u2013533. doi: 10.1111\/j.1475-3995.2004.00474.x","journal-title":"Int Trans Oper Res"},{"key":"337_CR24","series-title":"Wiley Interscience series in discrete mathematics and optimization","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley Interscience series in discrete mathematics and optimization. Wiley, Chichester,"},{"issue":"4","key":"337_CR25","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MIS.2005.57","volume":"20","author":"A Moura","year":"2005","unstructured":"Moura A, Oliveira JF (2005) A GRASP approach to the container-loading problem. IEEE Intell Syst 20(4):50\u201357. doi: 10.1109\/MIS.2005.57","journal-title":"IEEE Intell Syst"},{"issue":"3","key":"337_CR26","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/ijoc.1070.0254","volume":"20","author":"F Parre\u00f1o","year":"2008","unstructured":"Parre\u00f1o F, Alvarez-Valdes R, Tamarit JM, Oliveira JF (2008) A maximal-space algorithm for the container loading problem. INFORMS J Comput 20(3):412\u2013422. doi: 10.1287\/ijoc.1070.0254","journal-title":"INFORMS J Comput"},{"issue":"1","key":"337_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10732-008-9081-3","volume":"16","author":"F Parre\u00f1o","year":"2010","unstructured":"Parre\u00f1o F, Alvarez-Valdes R, Oliveira JE, Tamarit JM (2010) Neighborhood structures for the container loading problem: a VNS implementation. J Heuristics 16(1):1\u201322. doi: 10.1007\/s10732-008-9081-3","journal-title":"J Heuristics"},{"issue":"2","key":"337_CR28","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","volume":"141","author":"D Pisinger","year":"2002","unstructured":"Pisinger D (2002) Heuristics for the container loading problem. Eur J Oper Res 141(2):382\u2013392. doi: 10.1016\/S0377-2217(02)00132-7","journal-title":"Eur J Oper Res"},{"issue":"1","key":"337_CR29","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01545534","volume":"20","author":"MSW Ratcliff","year":"1998","unstructured":"Ratcliff MSW, Bischoff EE (1998) Allowing for weight considerations in container loading. OR Spektrum 20(1):65\u201371. doi: 10.1007\/BF01545534","journal-title":"OR Spektrum"},{"issue":"2","key":"337_CR30","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/S0377-2217(99)00263-5","volume":"123","author":"J Terno","year":"2000","unstructured":"Terno J, Scheithauer G, Sommerwei\u00dfU, Riehme J (2000) An efficient approach for the multi-pallet loading problem. Eur J Oper Res 123(2):372\u2013381. doi: 10.1016\/S0377-2217(99)00263-5","journal-title":"Eur J Oper Res"},{"issue":"3","key":"337_CR31","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 G, Hau\u00dfner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183(3):1109\u20131130. doi: 10.1016\/j.ejor.2005.12.047","journal-title":"Eur J Oper Res"},{"issue":"2","key":"337_CR32","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0377-2217(02)00129-7","volume":"141","author":"Y Wu","year":"2002","unstructured":"Wu Y (2002) An effective quasi-human based heuristic for solving the rectangle packing problem. Eur J Oper Res 141(2):341\u2013358. doi: 10.1016\/S0377-2217(02)00129-7","journal-title":"Eur J Oper Res"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-012-0337-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-012-0337-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-012-0337-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:25:47Z","timestamp":1559139947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-012-0337-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,31]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["337"],"URL":"https:\/\/doi.org\/10.1007\/s10489-012-0337-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,31]]}}}