{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T19:27:00Z","timestamp":1784230020226,"version":"3.55.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,12,15]],"date-time":"2013-12-15T00:00:00Z","timestamp":1387065600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s00291-013-0356-1","type":"journal-article","created":{"date-parts":[[2013,12,14]],"date-time":"2013-12-14T04:20:50Z","timestamp":1386994850000},"page":"837-878","source":"Crossref","is-referenced-by-count":24,"title":["Container packing problem with balance constraints"],"prefix":"10.1007","volume":"36","author":[{"given":"Ilkyeong","family":"Moon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thi Viet Ly","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,12,15]]},"reference":[{"key":"356_CR1","unstructured":"Crainic T, Perboli G, Tadei R (2012) Recent advances in multi-dimensional packing problems. In: Volosencu C (ed) New technologies\u2014trends, innovations and research. InTech, Chennai, pp 91\u2013111. ISBN: 978-953-51-0480-3"},{"issue":"1","key":"356_CR2","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","journal-title":"Eur J Oper Res"},{"issue":"2","key":"356_CR3","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"48","author":"S Martello","year":"2000","unstructured":"Martello S, Pisinger D, Vigo D (2000) The three-dimensional bin packing problem. Oper Res 48(2):256\u2013267","journal-title":"Oper Res"},{"issue":"4","key":"356_CR4","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) Issue in the development of approaches to container loading. OMEGA Int J Manag Sci 23(4):377\u2013390","journal-title":"OMEGA Int J Manag Sci"},{"key":"356_CR5","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:382\u2013392","journal-title":"Eur J Oper Res"},{"issue":"3","key":"356_CR6","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/0377-2217(95)00031-K","volume":"84","author":"EE Bischoff","year":"1995","unstructured":"Bischoff EE, Janetz F, Ratcliff MSW (1995) Loading pallets with non-identical items. Eur J Oper Res 84(3):681\u2013692","journal-title":"Eur J Oper Res"},{"issue":"2","key":"356_CR7","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","journal-title":"Eur J Oper Res"},{"issue":"5\u20136","key":"356_CR8","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","journal-title":"Int Trans Oper Res"},{"issue":"4","key":"356_CR9","first-page":"237","volume":"20","author":"A Bortfeldt","year":"1998","unstructured":"Bortfeldt A, Gehring H (1998) A tabu search algorithm for weakly heterogeneous container loading problems. OR Spect 20(4):237\u2013250","journal-title":"OR Spect"},{"key":"356_CR10","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1287\/ijoc.1070.0250","volume":"20","author":"TG Crainic","year":"2008","unstructured":"Crainic TG, Perboli G, Tadei R (2008) Extreme-point-based heuristics for the three-dimensional bin packing problem. Informs J Comput 20:368\u2013384","journal-title":"Informs J Comput"},{"issue":"9","key":"356_CR11","doi-asserted-by":"crossref","first-page":"2083","DOI":"10.1360\/jos182083","volume":"18","author":"D Zhang","year":"2007","unstructured":"Zhang D, Wei L, Chen Q, Chen H (2007) A combinatorial heuristic algorithm for the three-dimensional packing problem. J Softw 18(9):2083\u20132089","journal-title":"J Softw"},{"issue":"5","key":"356_CR12","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, Gerhring H, Mack D (2003) A parallel tabu search algorithm for solving the container loading problem. Parallel Comput 29(5):641\u2013662","journal-title":"Parallel Comput"},{"key":"356_CR13","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1016\/j.ejor.2007.06.063","volume":"195","author":"T Crainic","year":"2009","unstructured":"Crainic T, Perboli G, Tadei R (2009) TS $$^{2}$$ 2 PACK: a two-level tabu search for the three-dimensional bin packing problem. Eur J Oper Res 195:744\u2013760","journal-title":"Eur J Oper Res"},{"issue":"3","key":"356_CR14","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/ijoc.1070.0254","volume":"20","author":"F Parreno","year":"2008","unstructured":"Parreno F, Alvarez-Valdes R, Oliveira JF, Tamarit JM (2008) A maximal-space algorithm for the container loading problem. Informs J Comput 20(3):412\u2013422","journal-title":"Informs J Comput"},{"issue":"1","key":"356_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10732-008-9081-3","volume":"16","author":"F Parreno","year":"2010","unstructured":"Parreno F, Alvarez-Valdes R, Oliveira JF, Tamarit JM (2010) Neighborhood structures for the container loading problem: a VNS implementation. J Heuristics 16(1):1\u201322","journal-title":"J Heuristics"},{"key":"356_CR16","unstructured":"Perboli G, Crainic TG, Tadei R (2011) An efficient metaheuristic for multi-dimensional multi-container packing. In: IEEE Conference on Automation Science and Engineering (CASE). doi: 10.1109\/CASE.2011.6042476:563-568"},{"issue":"2","key":"356_CR17","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","journal-title":"Appl Intell"},{"issue":"4","key":"356_CR18","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","journal-title":"IEEE Intell Syst"},{"issue":"2005","key":"356_CR19","first-page":"441","volume":"3261","author":"K Karabulut","year":"2005","unstructured":"Karabulut K, Inceoglu MM (2005) A hybrid genetic algorithm for packing in 3D with deepest bottom left with fill method. Comput Sci 3261(2005):441\u2013450","journal-title":"Comput Sci"},{"issue":"3","key":"356_CR20","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","journal-title":"Eur J Oper Res"},{"key":"356_CR21","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.cor.2010.09.002","volume":"38","author":"J Liu","year":"2011","unstructured":"Liu J, Yue Y, Dong Z, Maple C, Keech M (2011) A novel hybrid tabu search approach to container loading. Comput Oper Res 38:797\u2013807","journal-title":"Comput Oper Res"},{"issue":"19","key":"356_CR22","doi-asserted-by":"crossref","first-page":"9802","DOI":"10.1016\/j.amc.2012.03.052","volume":"218","author":"MM Baldi","year":"2012","unstructured":"Baldi MM, Perboli G, Tadei R (2012) The three-dimensional knapsack problem with balancing constraints. Appl Math Comput 218(19):9802\u20139818","journal-title":"Appl Math Comput"},{"issue":"4","key":"356_CR23","first-page":"310","volume":"11","author":"M Gen","year":"2012","unstructured":"Gen M, Lin L (2012) Multiobjective genetic algorithm for scheduling problems in manufacturing systems. Ind Eng Manag Syst 11(4):310\u2013330","journal-title":"Ind Eng Manag Syst"},{"issue":"3","key":"356_CR24","first-page":"181","volume":"12","author":"H Parwananta","year":"2013","unstructured":"Parwananta H, Maghfiroh MFN, Yu VF (2013) Two-phase genetic algorithm for solving the paired single row facility layout problem. Ind Eng Manag Syst 12(3):181\u2013189","journal-title":"Ind Eng Manag Syst"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-013-0356-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-013-0356-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-013-0356-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T11:00:05Z","timestamp":1559041205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-013-0356-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,15]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["356"],"URL":"https:\/\/doi.org\/10.1007\/s00291-013-0356-1","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,15]]}}}