{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:55:04Z","timestamp":1743029704127,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030143466"},{"type":"electronic","value":"9783030143473"}],"license":[{"start":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T00:00:00Z","timestamp":1553126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-14347-3_36","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T08:08:34Z","timestamp":1553069314000},"page":"370-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adaptive Sequence-Based Heuristic for the Two-Dimensional Non-guillotine Bin Packing Problem"],"prefix":"10.1007","author":[{"given":"\u00d3scar","family":"Oliveira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorabela","family":"Gamboa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,21]]},"reference":[{"key":"36_CR1","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, 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"JO Berkey","year":"1987","unstructured":"Berkey, J.O., Wang, P.Y.: Two-dimensional finite bin-packing algorithms. J. Oper. Res. Soc. 38, 423 (1987)","journal-title":"J. Oper. Res. Soc."},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Manag. Sci. 44, 388\u2013399 (1998)","journal-title":"Manag. Sci."},{"key":"36_CR4","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, 345\u2013357 (1999)","journal-title":"INFORMS J. Comput."},{"key":"36_CR5","first-page":"27","volume":"1","author":"MA Boschetti","year":"2003","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, 27\u201342 (2003)","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"key":"36_CR6","first-page":"135","volume":"1","author":"MA Boschetti","year":"2003","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, 135\u2013147 (2003)","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"key":"36_CR7","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, 267\u2013283 (2003)","journal-title":"INFORMS J. Comput."},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","volume":"113","author":"C Voudouris","year":"1999","unstructured":"Voudouris, C., Tsang, E.: Guided local search and its application to the traveling salesman problem. Oper. Res. 113, 469\u2013499 (1999)","journal-title":"Oper. Res."},{"key":"36_CR9","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, 71\u201385 (2006)","journal-title":"Informs J. Comput."},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10479-008-0449-4","volume":"179","author":"F Parre\u00f1o","year":"2010","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. 179, 203\u2013220 (2010)","journal-title":"Ann. Oper. Res."},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T Feo","year":"1995","unstructured":"Feo, T., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search. In: Search Methodologies. Introductory Tutorials in Optimization and Decision Support Techniques, pp. 211\u2013238 (2005)","DOI":"10.1007\/0-387-28356-0_8"},{"key":"36_CR13","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."},{"key":"36_CR14","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, 334\u2013341 (2009)","journal-title":"J. Math. Stat."},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.10.012","volume":"226","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed, R., Resende, M.G.C., Ribeiro, C.C.: Multi-start methods for combinatorial optimization. Eur. J. Oper. Res. 226, 1\u20138 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR16","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, Article no. 1.2 (2005)","DOI":"10.1145\/1064546.1083322"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0360-8352(96)00205-7","volume":"32","author":"KK Lai","year":"1997","unstructured":"Lai, K.K., Chan, J.W.M.: Developing a simulated annealing algorithm for the cutting stock problem. Comput. Ind. Eng. 32, 115\u2013127 (1997)","journal-title":"Comput. Ind. Eng."}],"container-title":["Advances in Intelligent Systems and Computing","Hybrid Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14347-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T01:07:29Z","timestamp":1585444049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-14347-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,21]]},"ISBN":["9783030143466","9783030143473"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14347-3_36","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,3,21]]},"assertion":[{"value":"21 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Hybrid Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"his2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mirlabs.net\/his18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}