{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:21:18Z","timestamp":1775082078637,"version":"3.50.1"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030854751","type":"print"},{"value":"9783030854768","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85476-8_8","type":"book-chapter","created":{"date-parts":[[2021,11,7]],"date-time":"2021-11-07T01:05:32Z","timestamp":1636247132000},"page":"95-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adaptive Sequence-Based Heuristic for\u00a0Two-Dimensional Non-guillotine Packing\u00a0Problems"],"prefix":"10.1007","author":[{"given":"\u00d3scar","family":"Oliveira","sequence":"first","affiliation":[]},{"given":"Dorabela","family":"Gamboa","sequence":"additional","affiliation":[]},{"given":"Elsa","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,8]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Alvarez-Vald\u00e9s, R., Parre\u00f1o, F., Tamarit, J.M.: A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. J. Oper. Res. Soc. 56(4), 414\u2013425 (2005)","DOI":"10.1057\/palgrave.jors.2601829"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Alvarez-Vald\u00e9s, R., Parre\u00f1o, F., Tamarit, J.M.: A tabu search algorithm for a two-dimensional non-guillotine cutting problem. Eur. J. Oper. Res. 183(3), 1167\u20131182 (2007)","DOI":"10.1016\/j.ejor.2005.11.068"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"36","author":"JE Beasley","year":"1985","unstructured":"Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. 36(1), 49\u201364 (1985)","journal-title":"Oper. Res."},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/S0377-2217(03)00139-5","volume":"156","author":"JE Beasley","year":"2004","unstructured":"Beasley, J.E.: A population heuristic for constrained two-dimensional non-guillotine cutting. Eur. J. Oper. Res. 156(3), 601\u2013627 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Berkey, J.O., Wang, P.Y.: Two-dimensional finite bin-packing algorithms. J. Oper. Res. Soc. 38(5), 423 (1987)","DOI":"10.2307\/2582731"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.procs.2013.05.255","volume":"18","author":"C Blum","year":"2013","unstructured":"Blum, C., Schmid, V.: Solving the 2D bin packing problem by means of a hybrid evolutionary algorithm. Procedia Comput. Sci. 18, 899\u2013908 (2013)","journal-title":"Procedia Comput. Sci."},{"issue":"6","key":"8_CR7","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1111\/j.1475-3995.2009.00701.x","volume":"16","author":"A Bortfeldt","year":"2009","unstructured":"Bortfeldt, A., Winter, T.: A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces. Int. Trans. Oper. Res. 16(6), 685\u2013713 (2009). Nov","journal-title":"Int. Trans. Oper. Res."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Boschetti, M.A., Mingozzi, A.: The two-dimensional finite bin packing problem. Part I: new lower bounds for the oriented case. Q. J. Belg., Fr. Ital. Oper. Res. Soc. 1(1), 27\u201342 (2003)","DOI":"10.1007\/s10288-002-0005-z"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Boschetti, M.A., Mingozzi, A.: The two-dimensional finite bin packing problem. Part II: new lower and upper bounds. Q. J. Belg., Fr. Ital. Oper. Res. Soc. 1(2), 135\u2013147 (2003)","DOI":"10.1007\/s10288-002-0006-y"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1093\/imaman\/13.2.95","volume":"13","author":"MA Boschetti","year":"2002","unstructured":"Boschetti, M.A., Mingozzi, A., Hadjiconstantinou, E.: New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem. IMA J. Manag. Math. 13(2), 95\u2013119 (2002)","journal-title":"IMA J. Manag. Math."},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0167-6377(03)00057-9","volume":"32","author":"A Caprara","year":"2004","unstructured":"Caprara, A., Monaci, M.: On the two-dimensional Knapsack Problem. Oper. Res. Lett. 32(1), 5\u201314 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N Christofides","year":"1977","unstructured":"Christofides, N., Whitlock, C.: An algorithm for two-dimensional cutting problems. Oper. Res. 25(1), 30\u201344 (1977)","journal-title":"Oper. Res."},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.cor.2010.12.018","volume":"39","author":"M Dolatabadi","year":"2012","unstructured":"Dolatabadi, M., Lodi, A., Monaci, M.: Exact algorithms for the two-dimensional guillotine knapsack. Comput. Oper. Res. 39(1), 48\u201353 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/ijoc.15.3.267.16080","volume":"15","author":"O Faroe","year":"2003","unstructured":"Faroe, O., Pisinger, D., Zachariasen, M.: Guided local search for the three-dimensional bin-packing problem. INFORMS J. Comput. 15(3), 267\u2013283 (2003)","journal-title":"INFORMS J. Comput."},{"key":"8_CR15","unstructured":"Fekete, S.P., Schepers, J.: On more-dimensional packing I: modeling. Technical report (2000)"},{"key":"8_CR16","unstructured":"Fekete, S.P., Schepers, J.: On more-dimensional packing II: bounds. Technical report (2000)"},{"key":"8_CR17","unstructured":"Fekete, S.P., Schepers, J.: On more-dimensional packing III: exact algorithms. Technical report (2000)"},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"SP Fekete","year":"2007","unstructured":"Fekete, S.P., Schepers, J., van der Veen, J.C.: An exact algorithm for higher-dimensional orthogonal packing. Oper. Res. 55(3), 569\u2013587 (2007)","journal-title":"Oper. Res."},{"issue":"4","key":"8_CR19","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1287\/ijoc.2016.0708","volume":"28","author":"K Fleszar","year":"2016","unstructured":"Fleszar, K.: An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting\/packing decision problem. INFORMS J. Comput. 28(4), 703\u2013720 (2016). Nov","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"8_CR20","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1287\/ijoc.2016.0710","volume":"28","author":"F Furini","year":"2016","unstructured":"Furini, F., Malaguti, E., Thomopulos, D.: Modeling two-dimensional guillotine cutting problems via integer programming. INFORMS J. Comput. 28(4), 736\u2013751 (2016)","journal-title":"INFORMS J. Comput."},{"key":"8_CR21","unstructured":"Garey, M.R., Johnson, D.S.: A Guide to the Theory of NP-Completeness (1979)"},{"issue":"6","key":"8_CR22","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting-stock problem. Oper. Res. 9(6), 849\u2013859 (1961)","journal-title":"Oper. Res."},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, J.F.: A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183(3), 1212\u20131229 (2007)","DOI":"10.1016\/j.ejor.2005.11.062"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J. Comb. Optim. 22(2), 180\u2013201 (2011)","DOI":"10.1007\/s10878-009-9282-1"},{"issue":"1","key":"8_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0377-2217(93)E0278-6","volume":"83","author":"E Hadjiconstantinou","year":"1995","unstructured":"Hadjiconstantinou, E., Christofides, N.: An exact algorithm for general, orthogonal, two-dimensional knapsack problems. Eur. J. Oper. Res. 83(1), 39\u201356 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"8_CR26","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.ejor.2005.11.061","volume":"183","author":"E Hadjiconstantinou","year":"2007","unstructured":"Hadjiconstantinou, E., Iori, M.: A hybrid genetic algorithm for the two-dimensional single large object placement problem. Eur. J. Oper. Res. 183(3), 1150\u20131166 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"8_CR27","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1016\/j.cor.2011.08.005","volume":"39","author":"K He","year":"2012","unstructured":"He, K., Huang, W., Jin, Y.: An efficient deterministic heuristic for two-dimensional rectangular packing. Comput. Oper. Res. 39(7), 1355\u20131363 (2012)","journal-title":"Comput. Oper. Res."},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Hopper, E., Turton, B.C.H.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur. J. Oper. Res. 128(1), 34\u201357 (2001)","DOI":"10.1016\/S0377-2217(99)00357-4"},{"issue":"1","key":"8_CR29","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S Jakobs","year":"1996","unstructured":"Jakobs, S.: On genetic algorithms for the packing of polygons. Eur. J. Oper. Res. 88(1), 165\u2013181 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"8_CR30","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10100-013-0300-0","volume":"22","author":"I Kierkosz","year":"2014","unstructured":"Kierkosz, I., Luczak, M.: A hybrid evolutionary algorithm for the two-dimensional packing problem. CEJOR 22(4), 729\u2013753 (2014)","journal-title":"CEJOR"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Lai, K.K., Chan, J.W.M.: Developing a simulated annealing algorithm for the cutting stock problem. Comput. Ind. Eng. 32(1), 115\u2013127 (1997)","DOI":"10.1016\/S0360-8352(96)00205-7"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Lesh, N., Marks, J., McMahon, A., Mitzenmacher, M.: New heuristic and interactive approaches to 2D rectangular strip packing. J. Exp. Algorithmics 10(1), 1.2 (2005)","DOI":"10.1145\/1064546.1083322"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Leung, S.C.H., Zhang, D., Zhou, C., Wu, T.: A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. Comput. Oper. Res. 39(1), 64\u201373 (2012)","DOI":"10.1016\/j.cor.2010.10.022"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Leung, T.W., Chan, C.,K., Troutt, M.D.: Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 145(3), 530\u2013542 (2003)","DOI":"10.1016\/S0377-2217(02)00218-7"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Leung, T.W.,Yung, C.H., Troutt, M.D.: Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem. Comput. Ind. Eng. 40(3), 201\u2013214 (2001)","DOI":"10.1016\/S0360-8352(01)00021-3"},{"issue":"4","key":"8_CR36","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A Lodi","year":"1999","unstructured":"Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. 11(4), 345\u2013357 (1999)","journal-title":"INFORMS J. Comput."},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Martello, S., Vigo, D.:. Exact solution of the two-dimensional finite bin packing problem. Manag. Sci. 44, 388\u2013399 (1998)","DOI":"10.1287\/mnsc.44.3.388"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Resende, M.G.C, Ribeiro, C.C.: Multi-start methods for combinatorial optimization. Eur. J. Oper. Res. 226(1), 1\u20138 (2013)","DOI":"10.1016\/j.ejor.2012.10.012"},{"issue":"1","key":"8_CR39","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1287\/ijoc.1040.0089","volume":"18","author":"M Monaci","year":"2006","unstructured":"Monaci, M., Toth, P.: A set-covering-based heuristic approach for bin-packing problems. INFORMS J. Comput. 18(1), 71\u201385 (2006)","journal-title":"INFORMS J. Comput."},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Oliveira, \u00d3., Gamboa, D.: Adaptive sequence-based heuristic for the two-dimensional non-guillotine bin packing problem. In: Madureira, A.M., Abraham, A., Gandhi, N., Varela, M.L. (eds.) Hybrid Intelligent Systems, pp. 370\u2013375. Springer International Publishing, Cham (2020)","DOI":"10.1007\/978-3-030-14347-3_36"},{"key":"8_CR41","doi-asserted-by":"crossref","unstructured":"Parre\u00f1o, F., Alvarez-Vald\u00e9s, R., Oliveira, J.F., Tamarit, J.M.: A hybrid GRASP\/VND algorithm for two- and three-dimensional bin packing. Ann. Oper. Res.\u00a0179(1), 203\u2013220 (2010)","DOI":"10.1007\/s10479-008-0449-4"},{"issue":"1","key":"8_CR42","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/02331939308843904","volume":"28","author":"G Scheithauer","year":"1993","unstructured":"Scheithauer, G., Terno, J.: Modeling of packing problems. Optimization 28(1), 63\u201384 (1993)","journal-title":"Optimization"},{"issue":"2","key":"8_CR43","first-page":"224","volume":"2","author":"K Singh","year":"2009","unstructured":"Singh, K., Jain, L.: Industrial scope of 2D packing problems. Natl. J. Syst. Inf. Technol. 2(2), 224\u2013237 (2009)","journal-title":"Natl. J. Syst. Inf. Technol."},{"issue":"3","key":"8_CR44","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.31.3.573","volume":"31","author":"PY Wang","year":"1983","unstructured":"Wang, P.Y.: Two algorithms for constrained two-dimensional cutting stock problems. Oper. Res. 31(3), 573\u2013586 (1983)","journal-title":"Oper. Res."},{"issue":"3","key":"8_CR45","doi-asserted-by":"publisher","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.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR46","doi-asserted-by":"crossref","unstructured":"Wei, L., Oon, W.C., Zhu, W., Lim, A.: A skyline heuristic for the 2D rectangular packing and strip packing problems. Eur. J. Oper. Res. 215(2), 337\u2013346 (2011)","DOI":"10.1016\/j.ejor.2011.06.022"},{"issue":"4","key":"8_CR47","doi-asserted-by":"publisher","first-page":"334","DOI":"10.3844\/jmssp.2009.334.341","volume":"5","author":"L Wong","year":"2009","unstructured":"Wong, L., Lee, L.S., Serdang, U.P.M.: Heuristic placement routines for two-dimensional bin packing problem. J. Math. Stat. 5(4), 334\u2013341 (2009)","journal-title":"J. Math. Stat."}],"container-title":["Springer Proceedings in Mathematics & Statistics","Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85476-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,7]],"date-time":"2021-11-07T01:06:07Z","timestamp":1636247167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85476-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030854751","9783030854768"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85476-8_8","relation":{},"ISSN":["2194-1009","2194-1017"],"issn-type":[{"value":"2194-1009","type":"print"},{"value":"2194-1017","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APDIO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Congress of the Portuguese Association of Operational Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tomar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apdio12019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}