{"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":1775082078588,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030386283","type":"print"},{"value":"9783030386290","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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-38629-0_6","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:05:05Z","timestamp":1579597505000},"page":"69-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adaptive Sequence-Based Heuristic for the Three-Dimensional Bin Packing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3807-7292","authenticated-orcid":false,"given":"\u00d3scar","family":"Oliveira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8301-7806","authenticated-orcid":false,"given":"Telmo","family":"Matos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8720-8597","authenticated-orcid":false,"given":"Dorabela","family":"Gamboa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.12.006","volume":"229","author":"A Bortfeldt","year":"2013","unstructured":"Bortfeldt, A., W\u00e4scher, G.: Constraints in container loading \u2013 a state-of-the-art review. Eur. J. Oper. Res. 229, 1\u201320 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR2","doi-asserted-by":"publisher","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.: The Three-dimensional bin packing problem. Oper. Res. 48, 256\u2013267 (2000)","journal-title":"Oper. Res."},{"key":"6_CR3","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":"6_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"SP Fekete","year":"2001","unstructured":"Fekete, S.P., Schepers, J.: New classes of fast lower bounds for bin packing problems. Math. Program. 91, 11\u201331 (2001)","journal-title":"Math. Program."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/S0377-2217(02)00134-0","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Vigo, D.: Heuristic algorithms for the three-dimensional bin packing problem. Eur. J. Oper. Res. 141, 410\u2013420 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search\u2014part I. ORSA J. Comput. 1, 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"key":"6_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":"6_CR8","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/0-306-48056-5_7","volume-title":"Handbook of Metaheuristics","author":"C Voudouris","year":"2003","unstructured":"Voudouris, C., Tsang, E.P.K.: Guided Local Search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. ISOR, vol. 57, pp. 185\u2013218. Springer, Boston (2003). \nhttps:\/\/doi.org\/10.1007\/0-306-48056-5_7"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.dam.2003.08.004","volume":"140","author":"MA Boschetti","year":"2004","unstructured":"Boschetti, M.A.: New lower bounds for the three-dimensional finite bin packing problem. Discrete Appl. Math. 140, 241\u2013258 (2004)","journal-title":"Discrete Appl. Math."},{"key":"6_CR10","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, 569\u2013587 (2007)","journal-title":"Oper. Res."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1287\/moor.1030.0079","volume":"29","author":"SP Fekete","year":"2004","unstructured":"Fekete, S.P., Schepers, J.: A combinatorial characterization of higher-dimensional orthogonal packing. Math. Oper. Res. 29, 353\u2013368 (2004)","journal-title":"Math. Oper. Res."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/j.ejor.2007.06.063","volume":"195","author":"TG Crainic","year":"2009","unstructured":"Crainic, T.G., Perboli, G., Tadei, R.: TS2PACK: a two-level tabu search for the three-dimensional bin packing problem. Eur. J. Oper. Res. 195, 744\u2013760 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR13","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":"6_CR14","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":"6_CR15","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., P\u00e9rez, J.A.M.: Variable neighborhood search. Comput. Oper. Res. 57\u201397 (2019)","DOI":"10.1007\/978-3-319-91086-4_3"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Crainic, T.G., Perboli, G., Tadei, R.: A greedy adaptive search procedure for multi-dimensional multi-container packing problems (2012)","DOI":"10.1109\/CASE.2011.6042476"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.ijpe.2013.04.019","volume":"145","author":"JF Gon\u00e7alves","year":"2013","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: A biased random key genetic algorithm for 2D and 3D bin packing problems. Int. J. Prod. Econ. 145, 500\u2013510 (2013)","journal-title":"Int. J. Prod. Econ."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17, 487\u2013525 (2011)","journal-title":"J. Heuristics"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1111\/itor.12035","volume":"21","author":"M Hifi","year":"2014","unstructured":"Hifi, M., Negre, S., Wu, L.: Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem. Int. Trans. Oper. Res. 21, 59\u201379 (2014)","journal-title":"Int. Trans. Oper. Res."},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.endm.2018.03.023","volume":"66","author":"A Zudio","year":"2018","unstructured":"Zudio, A., da Silva Costa, D.H., Masquio, B.P., Coelho, I.M., Pinto, P.E.D.: BRKGA\/VND hybrid algorithm for the classic three-dimensional bin packing problem. Electron. Notes Discret. Math. 66, 175\u2013182 (2018)","journal-title":"Electron. Notes Discret. Math."},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1111\/itor.12094","volume":"23","author":"X Zhao","year":"2016","unstructured":"Zhao, X., Bennell, J.A., Bekta\u015f, T., Dowsland, K.: A comparative review of 3D container loading algorithms. Int. Trans. Oper. Res. 23, 287\u2013320 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ipl.2005.08.013","volume":"97","author":"N Lesh","year":"2006","unstructured":"Lesh, N., Mitzenmacher, M.: BubbleSearch: a simple heuristic for improving priority-based greedy algorithms. Inf. Process. Lett. 97, 161\u2013169 (2006)","journal-title":"Inf. Process. Lett."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1057\/palgrave.jors.2602393","volume":"59","author":"G Belov","year":"2008","unstructured":"Belov, G., Scheithauer, G., Mukhacheva, E.A.: One-dimensional heuristics adapted for two-dimensional rectangular strip packing. J. Oper. Res. Soc. 59, 823\u2013832 (2008)","journal-title":"J. Oper. Res. Soc."},{"key":"6_CR24","unstructured":"Zubaran, T., Ritt, M.: A simple, adaptive bubble search for improving heuristic solutions of the permutation flowshop scheduling problem. In: XLV SBPO - Simp\u00f3sio Brasileiro de Pesquisa Operacional, pp. 1847\u20131856 (2013)"},{"key":"6_CR25","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."},{"key":"6_CR26","first-page":"653","volume":"39","author":"F Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path relinking. Control Cybern. 39, 653\u2013684 (2000)","journal-title":"Control Cybern."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38629-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:19:55Z","timestamp":1579598395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chania, Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion13.pem.tuc.gr\/en\/home\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}