{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T00:02:31Z","timestamp":1769040151845,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T00:00:00Z","timestamp":1628640000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T00:00:00Z","timestamp":1628640000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012320","name":"Otto-von-Guericke-Universit\u00e4t Magdeburg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012320","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Given automated order systems, detailed characteristics of items and vehicles enable the detailed planning of deliveries including more efficient and safer loading of distribution vehicles. Many vehicle routing approaches ignore complex loading constraints. This paper focuses on the comprehensive evaluation of loading constraints in the context of combined Capacitated Vehicle Routing Problem and 3D Loading (3L-CVRP) and its extension with time windows (3L-VRPTW). To the best of our knowledge, this paper considers the currently largest number of loading constraints meeting real-world requirements and reducing unnecessary loading efforts for both problem variants. We introduce an approach for the load bearing strength of items ensuring a realistic load distribution between items. Moreover, we provide a new variant for the robust stability constraint enabling better performance and higher stability. In addition, we consider axle weights of vehicles to prevent overloaded axles for the first time for the 3L-VRPTW. Additionally, the reachability of items, balanced loading and manual unloading of items are taken into account. All loading constraints are implemented in a deepest-bottom-left-fill algorithm, which is embedded in an outer adaptive large neighbourhood search tackling the Vehicle Routing Problem. A new set of 600 instances is created, published and used to evaluate all loading constraints in terms of solution quality and performance. The efficiency of the hybrid algorithm is evaluated by three well-known instance sets. We outperform the benchmarks for most instance sets from the literature. Detailed results and the implementation of loading constraints are published online.<\/jats:p>","DOI":"10.1007\/s00291-021-00645-w","type":"journal-article","created":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T07:02:42Z","timestamp":1628665362000},"page":"835-875","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Advanced loading constraints for 3D vehicle routing problems"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3417-6832","authenticated-orcid":false,"given":"Corinna","family":"Krebs","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8474-7483","authenticated-orcid":false,"given":"Jan Fabian","family":"Ehmke","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5372-1456","authenticated-orcid":false,"given":"Henriette","family":"Koch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"issue":"4","key":"645_CR1","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B Baker","year":"1980","unstructured":"Baker B, Coffman E, Rivest R (1980) Orthogonal packings in two dimensions. SIAM J Comput 9(4):846\u2013855. https:\/\/doi.org\/10.1137\/0209064","journal-title":"SIAM J Comput"},{"key":"645_CR2","volume-title":"Dealing with load bearing strength consideration in container loading problems european business management school","author":"EE Bischoff","year":"2003","unstructured":"Bischoff EE (2003) Dealing with load bearing strength consideration in container loading problems\neuropean business management school. University of Wales, Swansea"},{"issue":"4","key":"645_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","volume":"23","author":"EE Bischoff","year":"1995","unstructured":"Bischoff EE, Ratcliff MSW (1995) Issues in the development of approaches to container loading. Omega 23(4):377\u2013390. https:\/\/doi.org\/10.1016\/0305-0483(95)00015-G","journal-title":"Omega"},{"issue":"9","key":"645_CR4","doi-asserted-by":"publisher","first-page":"2248","DOI":"10.1016\/j.cor.2011.11.008","volume":"39","author":"A Bortfeldt","year":"2012","unstructured":"Bortfeldt A (2012) A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Comput Oper Res 39(9):2248\u20132257. https:\/\/doi.org\/10.1016\/j.cor.2011.11.008","journal-title":"Comput Oper Res"},{"issue":"4","key":"645_CR5","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1016\/j.cie.2013.07.025","volume":"66","author":"S Ceschia","year":"2013","unstructured":"Ceschia S, Schaerf A, St\u00fctzle T (2013) Local search techniques for a routing-packing problem. Comput Ind Eng 66(4):1138\u20131149. https:\/\/doi.org\/10.1016\/j.cie.2013.07.025","journal-title":"Comput Ind Eng"},{"key":"645_CR6","doi-asserted-by":"crossref","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581, URL http:\/\/www.jstor.org\/stable\/167703","DOI":"10.1287\/opre.12.4.568"},{"issue":"3","key":"645_CR7","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 KF, Hartl RF, Iori M (2009) Ant colony optimization for the two-dimensional loading vehicle routing problem. Comput Oper Res 36(3):655\u2013673. https:\/\/doi.org\/10.1016\/j.cor.2007.10.021","journal-title":"Comput Oper Res"},{"issue":"3","key":"645_CR8","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/j.ejor.2009.03.046","volume":"201","author":"G Fuellerer","year":"2010","unstructured":"Fuellerer G, Doerner KF, Hartl RF, Iori M (2010) Metaheuristics for vehicle routing problems with three-dimensional loading constraints. Eur J Oper Res 201(3):751\u2013759. https:\/\/doi.org\/10.1016\/j.ejor.2009.03.046","journal-title":"Eur J Oper Res"},{"issue":"3","key":"645_CR9","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/trsc.1050.0145","volume":"40","author":"M Gendreau","year":"2006","unstructured":"Gendreau M, Iori M, Laporte G, Martello S (2006) A Tabu Search Algorithm for a Routing and Container Loading Problem. Transp Sc 40(3):342\u2013350. https:\/\/doi.org\/10.1287\/trsc.1050.0145","journal-title":"Transp Sc"},{"key":"645_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-1-4614-4469-5","volume-title":"Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints","author":"L Junqueira","year":"2013","unstructured":"Junqueira L, Morabito R, Yamashita DS, Yanasse HH (2013) Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints. Springer, NY, pp 271\u2013293. https:\/\/doi.org\/10.1007\/978-1-4614-4469-5"},{"key":"645_CR11","first-page":"441","volume-title":"Advances in Information Systems","author":"K Karabulut","year":"2005","unstructured":"Karabulut K, \u0130nceo\u011flu MM (2005) A hybrid genetic algorithm for packing in 3d with deepest bottom left with fill method. In: Yakhno T (ed) Advances in Information Systems. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 441\u2013450"},{"issue":"4598","key":"645_CR12","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u201380","journal-title":"Science"},{"issue":"4","key":"645_CR13","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1007\/s00291-018-0506-6","volume":"40","author":"H Koch","year":"2018","unstructured":"Koch H, Bortfeldt A, W\u00e4scher G (2018) A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints. OR Spect 40(4):1029\u20131075. https:\/\/doi.org\/10.1007\/s00291-018-0506-6","journal-title":"OR Spect"},{"key":"645_CR14","doi-asserted-by":"publisher","first-page":"100043","DOI":"10.1016\/j.ejtl.2021.100043","volume":"10","author":"C Krebs","year":"2021","unstructured":"Krebs C, Ehmke JF (2021) Axle weights in combined vehicle routing and container loading problems. EURO J Transp Logist 10:100043. https:\/\/doi.org\/10.1016\/j.ejtl.2021.100043","journal-title":"EURO J Transp Logist"},{"issue":"4","key":"645_CR15","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 (1999) Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems. INFORMS J Comput 11(4):345\u2013357. https:\/\/doi.org\/10.1287\/ijoc.11.4.345","journal-title":"INFORMS J Comput"},{"key":"645_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-55914-8","volume-title":"Data and Decision Sciences in Action","author":"V Mak-Hau","year":"2018","unstructured":"Mak-Hau V, Moser I, Aleti A (2018) An exact algorithm for the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints. In: Sarker R, Abbass HA, Dunstall S, Kilby P, Davis R, Young L (eds) Data and Decision Sciences in Action. Springer International Publishing, Cham, pp 91\u2013101. https:\/\/doi.org\/10.1007\/978-3-319-55914-8"},{"key":"645_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-8349-9777-7","volume-title":"A Multi-Objective Genetic Algorithm for the Vehicle Routing with Time Windows and Loading Problem","author":"A Moura","year":"2008","unstructured":"Moura A (2008) A Multi-Objective Genetic Algorithm for the Vehicle Routing with Time Windows and Loading Problem. Gabler, Wiesbaden, pp 187\u2013201. https:\/\/doi.org\/10.1007\/978-3-8349-9777-7"},{"issue":"4","key":"645_CR18","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s00291-008-0129-4","volume":"31","author":"A Moura","year":"2009","unstructured":"Moura A, Oliveira JF (2009) An integrated approach to the vehicle routing and container loading problems. OR Spect 31(4):775\u2013800. https:\/\/doi.org\/10.1007\/s00291-008-0129-4","journal-title":"OR Spect"},{"key":"645_CR19","doi-asserted-by":"publisher","unstructured":"Pace S, Turky A, Moser I, Aleti A (2015) Distributing fibre boards: A practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints. Procedia Computer Science 51:2257\u20132266. https:\/\/doi.org\/10.1016\/j.procs.2015.05.382, URL http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050915011904, international Conference On Computational Science, ICCS 2015","DOI":"10.1016\/j.procs.2015.05.382"},{"key":"645_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s002910050053","volume":"20","author":"SMW Ratcliff","year":"1998","unstructured":"Ratcliff SMW, Bischoff EE (1998) Allowing for weight considerations in container loading. OR Spectrum 20:65\u201371. https:\/\/doi.org\/10.1007\/s002910050053","journal-title":"OR Spectrum"},{"key":"645_CR21","doi-asserted-by":"publisher","unstructured":"Reil S, Bortfeldt A, M\u00f6nch L (2018) Heuristics for vehicle routing problems with backhauls, time windows, and 3d loading constraints. European Journal of Operational Research 266(3):877\u2013894. https:\/\/doi.org\/10.1016\/j.ejor.2017.10.029, URL http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221717309426","DOI":"10.1016\/j.ejor.2017.10.029"},{"key":"645_CR22","doi-asserted-by":"publisher","unstructured":"Ropke S, Pisinger D (2006) A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research 171(3):750\u2013775, https:\/\/doi.org\/10.1016\/j.ejor.2004.09.004, URL http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221704005831, feature Cluster: Heuristic and Stochastic Methods in Optimization Feature Cluster: New Opportunities for Operations Research","DOI":"10.1016\/j.ejor.2004.09.004"},{"issue":"2","key":"645_CR23","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265. https:\/\/doi.org\/10.1287\/opre.35.2.254","journal-title":"Oper Res"},{"issue":"2","key":"645_CR24","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1109\/TITS.2009.2020187","volume":"10","author":"CD Tarantilis","year":"2009","unstructured":"Tarantilis CD, Zachariadis EE, Kiranoudis CT (2009) A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Trans Intell Transp Syst 10(2):255\u2013271. https:\/\/doi.org\/10.1109\/TITS.2009.2020187","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"4","key":"645_CR25","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MCI.2014.2350933","volume":"9","author":"L Wei","year":"2014","unstructured":"Wei L, Zhang Z, Lim A (2014) An adaptive variable neighborhood search for a heterogeneous fleet vehicle routing problem with three-dimensional loading constraints. IEEE Comput Intell Magaz 9(4):18\u201330. https:\/\/doi.org\/10.1109\/MCI.2014.2350933","journal-title":"IEEE Comput Intell Magaz"},{"key":"645_CR26","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ins.2017.02.028","volume":"394\u2013395","author":"D Zhang","year":"2017","unstructured":"Zhang D, Cai S, Ye F, Si YW, Nguyen TT (2017) A hybrid algorithm for a vehicle routing problem with realistic constraints. Inf Sci 394\u2013395:167\u2013182. https:\/\/doi.org\/10.1016\/j.ins.2017.02.028","journal-title":"Inf Sci"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00645-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-021-00645-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00645-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T18:04:14Z","timestamp":1635357854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-021-00645-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,11]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["645"],"URL":"https:\/\/doi.org\/10.1007\/s00291-021-00645-w","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,11]]},"assertion":[{"value":"24 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}