{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:49:04Z","timestamp":1774910944764,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032205360","type":"print"},{"value":"9783032205377","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-20537-7_8","type":"book-chapter","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:32:52Z","timestamp":1773757972000},"page":"117-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Vehicle Routing Problems with\u00a0Loading Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6165-0547","authenticated-orcid":false,"given":"Mohamed-Amine","family":"Ouberkouk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2357-0404","authenticated-orcid":false,"given":"Ammar","family":"Oulamara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,18]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2019.03.006","volume":"107","author":"F Arnold","year":"2019","unstructured":"Arnold, F., Gendreau, M., S\u00f6rensen, K.: Efficiently solving very large-scale routing problems. Comput. Oper. Res. 107, 32\u201342 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"8_CR2","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), 1\u201320 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR3","unstructured":"Christensen, H.I., Khan, A., Pokutta, S., Tetali, P.: Multidimensional bin packing and other related problems: a survey. Comput. Sci. Rev. (2016)"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ejor.2016.06.072","volume":"257","author":"J-F C\u00f4t\u00e9","year":"2017","unstructured":"C\u00f4t\u00e9, J.-F., Guastaroba, G., Speranza, M.G.: The value of integrating loading and routing. Eur. J. Oper. Res. 257(1), 89\u2013105 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1111\/itor.12070","volume":"21","author":"O Dominguez","year":"2014","unstructured":"Dominguez, O., Juan, A.A., Faulin, J.: A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations. Int. Trans. Oper. Res. 21(3), 375\u2013398 (2014)","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.cor.2010.08.017","volume":"38","author":"C Duhamel","year":"2011","unstructured":"Duhamel, C., Lacomme, P., Quilliot, A., Toussaint, H.: A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Comput. Oper. Res. 38(3), 617\u2013640 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.cor.2007.10.021","volume":"36","author":"G Fuellerer","year":"2009","unstructured":"Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M.: Ant colony optimization for the two-dimensional loading vehicle routing problem. Comput. Oper. Res. 36(3), 655\u2013673 (2009)","journal-title":"Comput. Oper. Res."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Iori, M., Laporte, G., Martello, S.: A Tabu Search heuristic for the vehicle routing problem with two-dimensional loading constraints. Netw. Int. J. 51(1), 4\u201318 (2008)","DOI":"10.1002\/net.20192"},{"issue":"1\u20133","key":"8_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F Glover","year":"1996","unstructured":"Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discret. Appl. Math. 65(1\u20133), 223\u2013253 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR12","unstructured":"Helsgaun, K.: An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems. Roskilde Roskilde University 12, 966\u2013980 (2017)"},{"issue":"1","key":"8_CR13","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(1), 4\u201327 (2010)","journal-title":"TOP"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/trsc.1060.0165","volume":"41","author":"M Iori","year":"2007","unstructured":"Iori, M., Salazar-Gonz\u00e1lez, J.-J., Vigo, D.: An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transp. Sci. 41(2), 253\u2013264 (2007)","journal-title":"Transp. Sci."},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10696-010-9061-4","volume":"22","author":"SC Leung","year":"2010","unstructured":"Leung, S.C., Zheng, J., Zhang, D., Zhou, X.: Simulated annealing for the vehicle routing problem with two-dimensional loading constraints. Flex. Serv. Manuf. J. 22(1), 61\u201382 (2010)","journal-title":"Flex. Serv. Manuf. J."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"106790","DOI":"10.1016\/j.cor.2024.106790","volume":"172","author":"C Liu","year":"2024","unstructured":"Liu, C., Lyu, J., Fang, K.: Integrated packing and routing: a model and its solutions. Comput. Oper. Res. 172, 106790 (2024)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","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.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141(2), 241\u2013252 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Lodi, A., Martello, S., Monaci, M., Vigo, D.: Two-dimensional bin packing problems. In: Paradigms of Combinatorial Optimization: Problems and New Approaches, pp. 107\u2013129 (2014)","DOI":"10.1002\/9781119005353.ch5"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Sbai, I., Krichen, S.: Vehicle routing problems with loading constraints: an overview of variants and solution methods. In: Optimization and Machine Learning: Optimization for Machine Learning and Machine Learning for Optimization, p. 3 (2022)","DOI":"10.1002\/9781119902881.ch1"},{"issue":"2","key":"8_CR20","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9 Taillard","year":"1997","unstructured":"Taillard, \u00c9., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.-Y.: A Tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31(2), 170\u2013186 (1997)","journal-title":"Transp. Sci."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The vehicle routing problem. SIAM (2002)","DOI":"10.1137\/1.9780898718515"},{"issue":"3","key":"8_CR22","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/j.ejor.2017.08.035","volume":"265","author":"L Wei","year":"2018","unstructured":"Wei, L., Zhang, Z., Zhang, D., Leung, S.C.: A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 265(3), 843\u2013859 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"8_CR23","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1016\/j.ejor.2014.12.048","volume":"243","author":"L Wei","year":"2015","unstructured":"Wei, L., Zhang, Z., Zhang, D., Lim, A.: A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 243(3), 798\u2013814 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.ejor.2013.01.040","volume":"228","author":"EE Zachariadis","year":"2013","unstructured":"Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T.: Integrated distribution and loading planning via a compact metaheuristic algorithm. Eur. J. Oper. Res. 228(1), 56\u201371 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR25","unstructured":"Zhang, X.: Exact Algorithms for Vehicle Routing Problems with Two-Dimensional Loading Constraints. Ecole Polytechnique, Montreal (Canada) (2021)"},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ejor.2021.12.050","volume":"302","author":"X Zhang","year":"2022","unstructured":"Zhang, X., Chen, L., Gendreau, M., Langevin, A.: A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 302(1), 259\u2013269 (2022)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"8_CR27","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1287\/ijoc.2021.1110","volume":"34","author":"X Zhang","year":"2022","unstructured":"Zhang, X., Chen, L., Gendreau, M., Langevin, A.: Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints. INFORMS J. Comput. 34(3), 1419\u20131436 (2022)","journal-title":"INFORMS J. Comput."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-20537-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:02:49Z","timestamp":1774908169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20537-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032205360","9783032205377"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20537-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"18 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}