{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T08:21:17Z","timestamp":1772007677982,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030597467","type":"print"},{"value":"9783030597474","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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-59747-4_42","type":"book-chapter","created":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T11:02:30Z","timestamp":1601118150000},"page":"651-665","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Reactive GRASP-Based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2097-6572","authenticated-orcid":false,"given":"Manuel","family":"Iori","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7138-8653","authenticated-orcid":false,"given":"Marco","family":"Locatelli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5935-846X","authenticated-orcid":false,"given":"Mayron C. O.","family":"Moreira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8118-6633","authenticated-orcid":false,"given":"Tiago","family":"Silveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2016\/3264214","volume":"2016","author":"M Alonso","year":"2016","unstructured":"Alonso, M., Alvarez-Valdes, R., Parre\u00f1o, F., Tamarit, J.: Algorithms for pallet building and truck loading in an interdepot transportation problem. Math. Probl. Eng. 2016, 1\u201311 (2016)","journal-title":"Math. Probl. Eng."},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1504\/EJIE.2014.065732","volume":"8","author":"M Alonso","year":"2014","unstructured":"Alonso, M., Alvarez-Valdes, R., Tamarit, J., Parre\u00f1o, F.: A reactive GRASP algorithm for the container loading problem with load-bearing constraints. Eur. J. Ind. Eng. 8, 669\u2013694 (2014)","journal-title":"Eur. J. Ind. Eng."},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0377-2217(00)00055-2","volume":"131","author":"A Bortfeldt","year":"2001","unstructured":"Bortfeldt, A., Gehring, H.: A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. 131, 143\u2013161 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR4","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 - a state-of-the-art review. Eur. J. Oper. Res. 229, 1\u201320 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"E Burke","year":"2004","unstructured":"Burke, E., Kendall, G., Whitwell, G.: A new placement heuristic for the orthogonal stock-cutting problem. Oper. Res. 52, 655\u2013671 (2004)","journal-title":"Oper. Res."},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1287\/ijoc.1070.0250","volume":"20","author":"T Crainic","year":"2008","unstructured":"Crainic, T., Perboli, G., Tadei, R.: Extreme point-based heuristics for three-dimensional bin packing. INFORMS J. Comput. 20, 368\u2013384 (2008)","journal-title":"INFORMS J. Comput."},{"key":"42_CR7","unstructured":"Crainic, T., Perboli, G., Tadei, R.: Recent advances in multi-dimensional packing problems. In: New Technologies, Chap. 5. IntechOpen (2012)"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.ijpe.2013.04.032","volume":"145","author":"T de Queiroz","year":"2013","unstructured":"de Queiroz, T., Miyazawa, F.: Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints. Int. J. Prod. Econ. 145, 511\u2013530 (2013)","journal-title":"Int. J. Prod. Econ."},{"key":"42_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme, M., Iori, M., Martello, S.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255, 1\u201320 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.cor.2016.09.009","volume":"78","author":"M Delorme","year":"2017","unstructured":"Delorme, M., Iori, M., Martello, S.: Logic based benders decomposition for orthogonal stock cutting problems. Comput. Oper. Res. 78, 290\u2013298 (2017)","journal-title":"Comput. Oper. Res."},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T Feo","year":"1995","unstructured":"Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.cor.2009.05.008","volume":"37","author":"S Imahori","year":"2010","unstructured":"Imahori, S., Yagiura, M.: The best-fit heuristic for the rectangular strip packing problem: an efficient implementation and the worst-case approximation ratio. Comput. Oper. Res. 37, 325\u2013333 (2010)","journal-title":"Comput. Oper. Res."},{"key":"42_CR13","unstructured":"Iori, M., Lima, V., Martello, S., Miyazawa, F., Monaci, M.: Two-dimensional cutting and packing: problems and solution techniques. Technical report, University of Bologna (2019)"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Iori, M., Locatelli, M., Moreira, M., Silveira, T.: Solution of a practical pallet building problem with visibility and contiguity constraints. In: International Conference on Enterprise Information Systems, vol. 1, pp. 327\u2013338. SciTePress (2020)","DOI":"10.5220\/0009351703270338"},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M Iori","year":"2010","unstructured":"Iori, M., Martello, S.: Routing problems with loading constraints. TOP 18, 4\u201327 (2010)","journal-title":"TOP"},{"key":"42_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-030-34029-2_31","volume-title":"Analysis of Experimental Algorithms","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R., Vo\u00df, S.: Fixed set search applied to the minimum weighted vertex cover problem. In: Kotsireas, I., Pardalos, P., Parsopoulos, K.E., Souravlias, D., Tsokas, A. (eds.) SEA 2019. LNCS, vol. 11544, pp. 490\u2013504. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-34029-2_31"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Jovanovic, R., Vo\u00df, S.: The fixed set search applied to the power dominating set problem. Expert Syst. e12559 (2020)","DOI":"10.1111\/exsy.12559"},{"key":"42_CR18","first-page":"29","volume":"10","author":"J J\u00f3zefowska","year":"2018","unstructured":"J\u00f3zefowska, J., Pawlak, G., Pesch, E., Morze, M., Kowalski, D.: Fast truck-packing of 3D boxes. Eng. Manag. Prod. Serv. 10, 29\u201340 (2018)","journal-title":"Eng. Manag. Prod. Serv."},{"key":"42_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ejor.2019.12.012","volume":"284","author":"D Kurpel","year":"2020","unstructured":"Kurpel, D., Scarpin, C., P\u00e9cora Junior, J., Schenekemberg, C., Coelho, L.: The exact solutions of several types of container loading problems. Eur. J. Oper. Res. 284, 87\u2013107 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2011.06.002","volume":"215","author":"S Leung","year":"2011","unstructured":"Leung, S., Zhang, D., Sim, K.: A two-stage intelligent search algorithm for the two-dimensional strip packing problem. Eur. J. Oper. Res. 215, 57\u201369 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR21","first-page":"107","volume-title":"Two-Dimensional Bin Packing Problems","author":"A Lodi","year":"2014","unstructured":"Lodi, A., Martello, S., Monaci, M., Vigo, D.: Two-Dimensional Bin Packing Problems, pp. 107\u2013129. Wiley, Hoboken (2014)"},{"key":"42_CR22","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.eswa.2019.07.020","volume":"137","author":"R Ranck J\u00fanior","year":"2019","unstructured":"Ranck J\u00fanior, R., Yanasse, H., Morabito, R., Junqueira, L.: A hybrid approach for a multi-compartment container loading problem. Expert Syst. Appl. 137, 471\u2013492 (2019)","journal-title":"Expert Syst. Appl."},{"key":"42_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64403-5","volume-title":"Introduction to Cutting and Packing Optimization","author":"G Scheithauer","year":"2018","unstructured":"Scheithauer, G.: Introduction to Cutting and Packing Optimization. Springer, Cham (2018)"},{"key":"42_CR24","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ejor.2012.08.014","volume":"224","author":"V Schmid","year":"2013","unstructured":"Schmid, V., Doerner, K., Laporte, G.: Rich routing problems arising in supply chain management. Eur. J. Oper. Res. 224, 435\u2013448 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR25","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1111\/itor.12099","volume":"23","author":"E Silva","year":"2016","unstructured":"Silva, E., Oliveira, J., W\u00e4scher, G.: The pallet loading problem: a review of solution methods and computational experiments. Int. Trans. Oper. Res. 23, 147\u2013172 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"42_CR26","unstructured":"Terno, J., Scheithauer, G., Sommerwei\u00df, U., Riehme, J.: An efficient approach for the multi-pallet loading problem. Eur. J. Oper. Res. 123, 372\u2013381 (2000)"},{"key":"42_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231, 1\u201321 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR28","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)"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59747-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T09:20:15Z","timestamp":1604308815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59747-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030597467","9783030597474"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59747-4_42","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 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Enschede","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2020.nl\/","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":"73","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":"49","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":"67% - 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":"2,5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}