{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:51:25Z","timestamp":1760709085774,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T00:00:00Z","timestamp":1465776000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61272003"],"award-info":[{"award-number":["61272003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Committee of University of Macau","award":["MYRG041(Y1-L1)-FST13-SYW"],"award-info":[{"award-number":["MYRG041(Y1-L1)-FST13-SYW"]}]},{"DOI":"10.13039\/100007567","name":"City University of Hong Kong","doi-asserted-by":"crossref","award":["7004149"],"award-info":[{"award-number":["7004149"]}],"id":[{"id":"10.13039\/100007567","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10878-016-0036-6","type":"journal-article","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T17:30:44Z","timestamp":1465839044000},"page":"513-530","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A hybrid algorithm based on variable neighbourhood for the strip packing problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Defu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxin","family":"Che","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Furong","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yain-Whar","family":"Si","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen C. H.","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,13]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","volume":"35","author":"R Alvarez-Valdes","year":"2008","unstructured":"Alvarez-Valdes R, Parreo F, Tamarit JM (2008) Reactive GRASP for the strip-packing problem. Comput Oper Res 35:1065\u20131083","journal-title":"Comput Oper Res"},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"JE Beasley","year":"1985","unstructured":"Beasley JE (1985) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33:49\u201364","journal-title":"Oper Res"},{"key":"36_CR3","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1057\/palgrave.jors.2602393","volume":"59","author":"G Belov","year":"2008","unstructured":"Belov G, Scheithauer G, Mukhacheva EA (2008) One-dimensional heuristics adapted for two-dimensional rectangular strip packing. J Oper Res Soc 59:823\u2013832","journal-title":"J Oper Res Soc"},{"key":"36_CR4","unstructured":"Beltran JD, Calderon JE, Cabrera RJ, Moreno Perez JA, Moreno-Vega JM (2004) GRASP\/VNS hybrid for the strip packing problem. In: Proceedings of the first international workshop on hybrid metaheuristics (HM 2004), Valencia, Spain, pp. 22\u201323"},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1093\/comjnl\/25.3.353","volume":"25","author":"BE Bengtsson","year":"1982","unstructured":"Bengtsson BE (1982) Packing rectangular pieces\u2014a heuristic approach. Comput J 25:253\u2013257","journal-title":"Comput J"},{"key":"36_CR6","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"JO Berkey","year":"1987","unstructured":"Berkey JO, Wang PY (1987) Two-dimensional finite bin packing algorithms. J Oper Res Soc 38:423\u2013429","journal-title":"J Oper Res Soc"},{"issue":"3","key":"36_CR7","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.ejor.2004.11.016","volume":"172","author":"A Bortfeldt","year":"2006","unstructured":"Bortfeldt A (2006) A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur J Oper Res 172(3):814\u2013837","journal-title":"Eur J Oper Res"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Bortfeldt A, Gehring H (2006) New large benchmark instances for the two-dimensional strip packing problem with rectangular pieces. In: Proceedings of the 39th annual hawaii international conference on system sciences (HICSS\u201906) vol 2, p. 30b","DOI":"10.1109\/HICSS.2006.360"},{"issue":"4","key":"36_CR9","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"EK Burke","year":"2004","unstructured":"Burke EK, Kendall G, Whitwell G (2004) A new placement heuristic for the orthogonal stock-cutting problem. Oper Res 52(4):655\u2013671","journal-title":"Oper Res"},{"issue":"3","key":"36_CR10","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1287\/ijoc.1080.0306","volume":"21","author":"EK Burke","year":"2009","unstructured":"Burke EK, Kendall G, Whitwell G (2009) A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock cutting problem. INFORMS J Comput 21(3):505\u2013516","journal-title":"INFORMS J Comput"},{"issue":"6","key":"36_CR11","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TEVC.2010.2041061","volume":"14","author":"EK Burke","year":"2010","unstructured":"Burke EK, Hyde MR, Kendall G, Woodward JR (2010) A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics. IEEE Trans Evol Comput 14(6):942\u2013958","journal-title":"IEEE Trans Evol Comput"},{"key":"36_CR12","doi-asserted-by":"publisher","unstructured":"Chen B, Wang Y, Yang S (2015) A hybrid demon algorithm for the two- dimensional orthogonal strip packing problem. Math Prob Eng. Article ID 541931. doi: 10.1155\/2015\/541931","DOI":"10.1155\/2015\/541931"},{"key":"36_CR13","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N Christofides","year":"1997","unstructured":"Christofides N, Whitlock C (1997) An algorithm for two-dimensional cutting problems. Oper Res 25:30\u201344","journal-title":"Oper Res"},{"issue":"4","key":"36_CR14","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1016\/j.cor.2006.08.011","volume":"35","author":"YD Cui","year":"2008","unstructured":"Cui YD, Yang YL, Cheng X, Song PH (2008) A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem. Comput Oper Res 35(4):1281\u20131291","journal-title":"Comput Oper Res"},{"issue":"1","key":"36_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318","journal-title":"Swarm Evol Comput"},{"key":"36_CR16","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ejor.2004.04.030","volume":"168","author":"KA Dowsland","year":"2006","unstructured":"Dowsland KA, Herbert EA, Kendall G, Burke EK (2006) Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems. Eur J Oper Res 168:390\u2013402","journal-title":"Eur J Oper Res"},{"issue":"2","key":"36_CR17","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/s10878-009-9282-1","volume":"22","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves JF, Resende MGC (2011) A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J Comb Optim 22(2):180\u2013201","journal-title":"J Comb Optim"},{"issue":"10","key":"36_CR18","doi-asserted-by":"crossref","first-page":"2877","DOI":"10.1016\/j.cor.2008.12.016","volume":"36","author":"M Haouari","year":"2009","unstructured":"Haouari M, Serairi M (2009) Heuristics for the variable sized bin-packing problem. Comput Oper Res 36(10):2877\u20132884","journal-title":"Comput Oper Res"},{"key":"36_CR19","doi-asserted-by":"crossref","first-page":"5542","DOI":"10.1016\/j.eswa.2013.04.005","volume":"40","author":"K He","year":"2013","unstructured":"He K, Jin Y, Huang WQ (2013) Heuristic for two-dimensional strip packing problem with 90 rotations. Expert Syst Appl 40:5542\u20135550","journal-title":"Expert Syst Appl"},{"key":"36_CR20","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.ejor.2014.09.042","volume":"241","author":"K He","year":"2015","unstructured":"He K, Ji P, Li C (2015) Dynamic reduction heuristics for the rectangle packing area minimization problem. Eur J Oper Res 241:674\u2013685","journal-title":"Eur J Oper Res"},{"key":"36_CR21","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E Hopper","year":"2001","unstructured":"Hopper E, Turton BCH (2001) An empirical investigation of metaheuristic and heuristic algorithms for a 2D packing problem. Eur J Oper Res 128:34\u201357","journal-title":"Eur J Oper Res"},{"issue":"11","key":"36_CR22","doi-asserted-by":"crossref","first-page":"3270","DOI":"10.1016\/j.cor.2005.12.005","volume":"34","author":"WQ Huang","year":"2007","unstructured":"Huang WQ, Chen DB, Xu RC (2007) A new heuristic algorithm for rectangle packing. Comput Oper Res 34(11):3270\u20133280","journal-title":"Comput Oper Res"},{"issue":"2","key":"36_CR23","first-page":"512","volume":"164","author":"LM Jefferson","year":"2014","unstructured":"Jefferson LM, da S, Eduardo CX, Fl\u00e1vio KM (2014) Two-dimensional strip packing with unloading constraints. Discret Appl Math 164(2):512\u2013521","journal-title":"Discret Appl Math"},{"issue":"1","key":"36_CR24","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ejor.2011.06.002","volume":"215","author":"SCH Leung","year":"2011","unstructured":"Leung SCH, Zhang D, Sim KM (2011) A two-stage intelligent search algorithm for the two-dimensional strip packing problem. Eur J Oper Res 215(1):57\u201369","journal-title":"Eur J Oper Res"},{"issue":"10","key":"36_CR25","doi-asserted-by":"crossref","first-page":"13032","DOI":"10.1016\/j.eswa.2011.04.105","volume":"38","author":"SCH Leung","year":"2011","unstructured":"Leung SCH, Zhang D (2011) A fast layer-based heuristic for non-guillotine strip packing. Expert Syst Appl 38(10):13032\u201313042","journal-title":"Expert Syst Appl"},{"issue":"2","key":"36_CR26","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: a survey. Eur J Oper Res 141(2):241\u2013252","journal-title":"Eur J Oper Res"},{"issue":"3","key":"36_CR27","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","volume":"15","author":"S Martello","year":"2003","unstructured":"Martello S, Monaci M, Vigo D (2003) An exact approach to the strip packing problem. INFORMS J Comput 15(3):310\u2013319","journal-title":"INFORMS J Comput"},{"key":"36_CR28","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manag Sci 44:388\u2013399","journal-title":"Manag Sci"},{"key":"36_CR29","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2008.08.020","volume":"198","author":"K Mitsutoshi","year":"2009","unstructured":"Mitsutoshi K, Takashi I, Koji N, Mutsunori Y, Hiroshi N (2009) Exact algorithms for the two-dimensional strip packing problem with and without rotations. Eur J Oper Res 198:73\u201383","journal-title":"Eur J Oper Res"},{"issue":"11","key":"36_CR30","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"key":"36_CR31","unstructured":"Pinto E, Oliveira JF (2005) Algorithm based on graphs for the non-guillotinable two-dimensional packing problem. Second ESICUP Meeting, Southampton"},{"issue":"4\u20135","key":"36_CR32","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1016\/j.engappai.2008.10.025","volume":"22","author":"MC Riff","year":"2009","unstructured":"Riff MC, Bonnaire X, Neveu B (2009) A revision of recent approaches for two-dimensional strip-packing problems. Eng Appl Artif Intell 22(4\u20135):823\u2013827","journal-title":"Eng Appl Artif Intell"},{"key":"36_CR33","unstructured":"Valenzuela CL, Wang PY (2001) Heuristics for large strip packing problems with guillotine patterns: an empirical study. In: Proceedings of the 4th metaheuristics international conference. University of Porto, Portugal, pp. 417\u2013421"},{"key":"36_CR34","doi-asserted-by":"crossref","first-page":"3297","DOI":"10.1016\/j.eswa.2014.12.021","volume":"42","author":"Y Wang","year":"2015","unstructured":"Wang Y, Chen L (2015) Two-dimensional residual-space-maximized packing. Expert Syst Appl 42:3297\u20133305","journal-title":"Expert Syst Appl"},{"issue":"3","key":"36_CR35","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G Wascher","year":"2007","unstructured":"Wascher G, Hausner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183(3):1109\u20131130","journal-title":"Eur J Oper Res"},{"issue":"2","key":"36_CR36","first-page":"337","volume":"215","author":"L Wei","year":"2011","unstructured":"Wei L, Oon WC, Zhu W, Lim A (2011) A skyline heuristic for the 2D rectangular packing and strip packing problems. Eur J Oper Res 215(2):337\u2013346","journal-title":"Eur J Oper Res"},{"issue":"1","key":"36_CR37","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.ejor.2014.04.020","volume":"239","author":"L Wei","year":"2014","unstructured":"Wei L, Tian T, Zhu W, Lim A (2014) A block-based layer building approach for the 2D guillotine strip packing problem. Eur J Oper Res 239(1):58\u201369","journal-title":"Eur J Oper Res"},{"issue":"1","key":"36_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2012.05.001","volume":"40","author":"S Yang","year":"2013","unstructured":"Yang S, Han S, Ye W (2013) A simple randomized algorithm for two-dimensional strip packing. Comput Oper Res 40(1):1\u20138","journal-title":"Comput Oper Res"},{"issue":"2","key":"36_CR39","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1287\/ijoc.1120.0505","volume":"25","author":"D Zhang","year":"2013","unstructured":"Zhang D, Wei L, Leung SCH, Chen Q (2013) A binary search heuristic algorithm based on randomized local search for the rectangular strip-packing problem. INFORMS J Comput 25(2):332\u2013345","journal-title":"INFORMS J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0036-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0036-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0036-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T12:17:58Z","timestamp":1498306678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0036-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,13]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["36"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0036-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2016,6,13]]}}}