{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T03:50:08Z","timestamp":1768276208838,"version":"3.49.0"},"reference-count":110,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,18]],"date-time":"2014-12-18T00:00:00Z","timestamp":1418860800000},"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":["OR Spectrum"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s00291-014-0386-3","type":"journal-article","created":{"date-parts":[[2014,12,17]],"date-time":"2014-12-17T10:28:39Z","timestamp":1418812119000},"page":"297-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":141,"title":["Vehicle routing problems with loading constraints: state-of-the-art and future directions"],"prefix":"10.1007","volume":"37","author":[{"given":"Hanne","family":"Pollaris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kris","family":"Braekers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Caris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerrit K.","family":"Janssens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabine","family":"Limbourg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,18]]},"reference":[{"issue":"1","key":"386_CR1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/ijoc.1110.0489","volume":"25","author":"M Alba","year":"2011","unstructured":"Alba M, Cordeau J, Dell\u2019Amico M, Iori M (2011) A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks. INFORMS J Comput 25(1):41\u201355","journal-title":"INFORMS J Comput"},{"issue":"2","key":"386_CR2","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1287\/opre.40.2.238","volume":"40","author":"S Amiouny","year":"1992","unstructured":"Amiouny S, Bartholdi J, Zhang J (1992) Balanced loading. Oper Res 40(2):238\u2013246","journal-title":"Oper Res"},{"key":"386_CR3","unstructured":"Aprile D, Egeblad J, Garavelli A, Lisi S, Pisinger D (2007) Logistics optimization: vehicle routing with loading constraints. In: Proceedings of the 19th international conference on production research"},{"key":"386_CR4","unstructured":"Arbib C, Marinelli F, Servillio M (2009) On the pickup and delivery travelling salesman problem with LIFO loading. In: Proceedings of the international network optimisation conference 2009, Pisa, Italy"},{"issue":"1","key":"386_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10852-006-9050-5","volume":"6","author":"A Attanasio","year":"2007","unstructured":"Attanasio A, Fuduli A, Ghiani G, Triki C (2007) Integrated shipment dispatching and packing problems: a case study. J Math Modell Algorithms 6(1):77\u201385","journal-title":"J Math Modell Algorithms"},{"issue":"1","key":"386_CR6","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/S0377-2217(02)00676-8","volume":"152","author":"P Avella","year":"2004","unstructured":"Avella P, Boccia M, Sforza A (2004) Solving a fuel delivery problem by heuristic and exact approaches. Eur J Oper Res 152(1):170\u2013179","journal-title":"Eur J Oper Res"},{"issue":"4","key":"386_CR7","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B Baker","year":"1980","unstructured":"Baker B, Coffman E Jr, Rivest R (1980) Orthogonal packings in two dimensions. SIAM J Comput 9(4):846\u2013855","journal-title":"SIAM J Comput"},{"issue":"11","key":"386_CR8","doi-asserted-by":"crossref","first-page":"3041","DOI":"10.1016\/j.cor.2009.02.008","volume":"36","author":"M Battarra","year":"2009","unstructured":"Battarra M, Monaci M, Vigo D (2009) An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. Comput Oper Res 36(11):3041\u20133050","journal-title":"Comput Oper Res"},{"issue":"4","key":"386_CR9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","volume":"23","author":"E Bischoff","year":"1995","unstructured":"Bischoff E, Ratcliff MSWM (1995) Issues in the development of approaches to container loading. Omega 23(4):377\u2013390","journal-title":"Omega"},{"issue":"9","key":"386_CR10","doi-asserted-by":"crossref","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","journal-title":"Comput Oper Res"},{"issue":"3","key":"386_CR11","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.cor.2012.09.005","volume":"40","author":"A Bortfeldt","year":"2013","unstructured":"Bortfeldt A, Homberger J (2013) Packing first, routing second a heuristic for the vehicle routing and loading problem. Comput Oper Res 40(3):873\u2013885","journal-title":"Comput Oper Res"},{"key":"386_CR12","doi-asserted-by":"crossref","unstructured":"Bortfeldt A, W\u00e4scher G (2013) Constraints in container loading a state-of-the-art review. European J Oper Res 229(1)","DOI":"10.1016\/j.ejor.2012.12.006"},{"key":"386_CR13","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.trb.2014.05.007","volume":"67","author":"K Braekers","year":"2014","unstructured":"Braekers K, Caris A, Janssens G (2014) Exact and metaheuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Trans Res Part B Methodol 67:166\u2013186","journal-title":"Trans Res Part B Methodol"},{"issue":"1","key":"386_CR14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/mnsc.27.1.19","volume":"27","author":"GG Brown","year":"1981","unstructured":"Brown GG, Graves GW (1981) Real-time dispatch of petroleum tank trucks. Manag Sci 27(1):19\u201332","journal-title":"Manag Sci"},{"issue":"4","key":"386_CR15","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1287\/ijoc.1060.0202","volume":"19","author":"F Carrabs","year":"2007","unstructured":"Carrabs F, Cordeau J, Laporte G (2007a) Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J Comput 19(4):618\u2013632","journal-title":"INFORMS J Comput"},{"issue":"4","key":"386_CR16","first-page":"223","volume":"45","author":"F Carrabs","year":"2007","unstructured":"Carrabs F, Cerulli R, Cordeau J (2007b) An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading. INFOR Inf Syst Oper Res 45(4):223\u2013238","journal-title":"INFOR Inf Syst Oper Res"},{"issue":"1","key":"386_CR17","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1002\/net.21468","volume":"61","author":"F Carrabs","year":"2013","unstructured":"Carrabs F, Cerulli R, Speranza MG (2013) A branch-and-bound algorithm for the double travelling salesman problem with two stacks. Networks 61(1):58\u201375","journal-title":"Networks"},{"issue":"4","key":"386_CR18","doi-asserted-by":"crossref","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","journal-title":"Comput Ind Eng"},{"issue":"1","key":"386_CR19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1023067016014","volume":"26","author":"ED Chajakis","year":"2003","unstructured":"Chajakis ED, Guignard M (2003) Scheduling deliveries in vehicles with multiple compartments. J Global Optim 26(1):43\u201378","journal-title":"J Global Optim"},{"issue":"3","key":"386_CR20","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.eswa.2005.09.057","volume":"31","author":"F Chan","year":"2006","unstructured":"Chan F, Bhagwat R, Kumar N, Tiwari M, Lam P (2006) Development of a decision support system for air-cargo pallets loading problem: a case study. Expert Syst Appl 31(3):472\u2013485","journal-title":"Expert Syst Appl"},{"issue":"1","key":"386_CR21","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.ejor.2012.06.019","volume":"223","author":"B Cheang","year":"2012","unstructured":"Cheang B, Gao X, Lim A, Qin H, Zhu W (2012) Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints. Eur J Oper Res 223(1):60\u201375","journal-title":"Eur J Oper Res"},{"key":"386_CR22","doi-asserted-by":"crossref","unstructured":"Cherkesly M, Desaulniers G, Laporte G (2014a) Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading. Trans Sci. doi: 10.1287\/trsc.2014.0535","DOI":"10.1287\/trsc.2014.0535"},{"key":"386_CR23","unstructured":"Cherkesly M, Desaulniers G, Laporte G (2014b) A population-based metaheuristic for the pickup and delivery problem with time windows and lifo loading. Technical report, Les Cahiers du GERAD, G-2014-66, GERAD, Montr\u00e9al"},{"issue":"4","key":"386_CR24","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","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","journal-title":"Oper Res"},{"key":"386_CR25","doi-asserted-by":"crossref","unstructured":"Cordeau J, Laporte G, Savelsbergh MW, Vigo D (2007) Chapter 6 vehicle routing. In: Barnhart C, Laporte G (eds) Transportation, handbooks in operations research and management science, Elsevier 14:367\u2013428","DOI":"10.1016\/S0927-0507(06)14006-2"},{"issue":"1","key":"386_CR26","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1002\/net.20312","volume":"55","author":"J Cordeau","year":"2010","unstructured":"Cordeau J, Iori G, Mand Laporte, Salazar Gonzalez J (2010) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1):46\u201359","journal-title":"Networks"},{"issue":"5","key":"386_CR27","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1016\/j.cor.2009.08.003","volume":"37","author":"J Cordeau","year":"2010","unstructured":"Cordeau J, Dell\u2019 Amico M, Iori M (2010b) Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. Computers & Operations Research 37(5):970\u2013980","journal-title":"Computers & Operations Research"},{"issue":"5","key":"386_CR28","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1057\/palgrave.jors.2602374","volume":"59","author":"F Cornillier","year":"2008","unstructured":"Cornillier F, Boctor FF, Laporte G, Renaud J (2008a) An exact algorithm for the petrol station replenishment problem. J Oper Res Soc 59(5):607\u2013615","journal-title":"J Oper Res Soc"},{"issue":"2","key":"386_CR29","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.ejor.2007.08.016","volume":"191","author":"F Cornillier","year":"2008","unstructured":"Cornillier F, Boctor FF, Laporte G, Renaud J (2008b) A heuristic for the multi-period petrol station replenishment problem. Eur J Oper Res 191(2):295\u2013305","journal-title":"Eur J Oper Res"},{"issue":"3","key":"386_CR30","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/j.cor.2007.11.007","volume":"36","author":"F Cornillier","year":"2009","unstructured":"Cornillier F, Laporte G, Boctor FF, Renaud J (2009) The petrol station replenishment problem with time windows. Comput Oper Res 36(3):919\u2013935","journal-title":"Comput Oper Res"},{"issue":"2","key":"386_CR31","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.ejor.2012.02.007","volume":"220","author":"F Cornillier","year":"2012","unstructured":"Cornillier F, Boctor F, Renaud J (2012) Heuristics for the multi-depot petrol station replenishment problem with time windows. Eur J Oper Res 220(2):361\u2013369","journal-title":"Eur J Oper Res"},{"issue":"1","key":"386_CR32","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.20448","volume":"60","author":"J C\u00f4t\u00e9","year":"2012","unstructured":"C\u00f4t\u00e9 J, Gendreau M, Potvin J (2012a) Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(1):19\u201330","journal-title":"Networks"},{"issue":"4","key":"386_CR33","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1002\/net.21459","volume":"60","author":"J C\u00f4t\u00e9","year":"2012","unstructured":"C\u00f4t\u00e9 J, Archetti C, Speranza M, Gendreau J, Mand Potvin (2012b) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(4):212\u2013226","journal-title":"Networks"},{"issue":"3","key":"386_CR34","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(98)00139-8","volume":"114","author":"A Davies","year":"1999","unstructured":"Davies A, Bischoff E (1999) Weight distribution considerations in container loading. Eur J Oper Res 114(3):509\u2013527","journal-title":"Eur J Oper Res"},{"issue":"4","key":"386_CR35","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1007\/s00291-010-0194-3","volume":"33","author":"U Derigs","year":"2011","unstructured":"Derigs U, Gottlieb J, Kalkoff J, Piesche M, Rothlauf F, Vogel U (2011) Vehicle routing with compartments: applications, modelling and heuristics. OR Spectr 33(4):885\u2013914","journal-title":"OR Spectr"},{"issue":"4","key":"386_CR36","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1002\/net.20179","volume":"49","author":"K Doerner","year":"2007","unstructured":"Doerner K, Fuellerer G, Hartl R, Gronalt M, Iori M (2007) Metaheuristics for the vehicle routing problem with loading constraints. Networks 49(4):294\u2013307","journal-title":"Networks"},{"issue":"3","key":"386_CR37","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1111\/itor.12070","volume":"21","author":"O Dominguez","year":"2014","unstructured":"Dominguez O, Juan AA, Faulin J (2014) A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations. Int Trans Oper Res 21(3):375\u2013398","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"386_CR38","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.compag.2004.12.007","volume":"48","author":"A Dooley","year":"2005","unstructured":"Dooley A, Parker W, Blair H (2005) Modelling of transport costs and logistics for on-farm milk segregation in new zealand dairying. Comput Electron Agric 48(2):75\u201391","journal-title":"Comput Electron Agric"},{"issue":"3","key":"386_CR39","doi-asserted-by":"crossref","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 (2011) A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Comput Oper Res 38(3):617\u2013640","journal-title":"Comput Oper Res"},{"issue":"2","key":"386_CR40","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10107-008-0234-9","volume":"121","author":"I Dumitrescu","year":"2010","unstructured":"Dumitrescu I, Ropke S, Cordeau J, Laporte G (2010) The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Math Program 121(2):269\u2013305","journal-title":"Math Program"},{"issue":"5","key":"386_CR41","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1016\/j.cor.2006.10.006","volume":"35","author":"A Fallahi El","year":"2008","unstructured":"El Fallahi A, Prins C (2008) A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput Oper Res 35(5):1725\u20131741","journal-title":"Comput Oper Res"},{"issue":"6","key":"386_CR42","doi-asserted-by":"crossref","first-page":"1800","DOI":"10.1016\/j.cor.2008.05.005","volume":"36","author":"G Erdogan","year":"2009","unstructured":"Erdogan G, Cordeau J, Laporte G (2009) The pickup and delivery traveling salesman problem with first-in-first-out loading. Comput Oper Res 36(6):1800\u20131808","journal-title":"Comput Oper Res"},{"issue":"7","key":"386_CR43","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1057\/palgrave.jors.2600973","volume":"51","author":"K Fagerholt","year":"2000","unstructured":"Fagerholt K, Christiansen M (2000a) A combined ship scheduling and allocation problem. J Oper Res Soc 51(7):834\u2013842","journal-title":"J Oper Res Soc"},{"issue":"3","key":"386_CR44","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1111\/j.1475-3995.2000.tb00196.x","volume":"7","author":"K Fagerholt","year":"2000","unstructured":"Fagerholt K, Christiansen M (2000b) A travelling salesman problem with allocation, time window and precedence constraints an application to ship scheduling. Int Trans Oper Res 7(3):231\u2013244","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"386_CR45","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10479-011-0888-1","volume":"207","author":"K Fagerholt","year":"2013","unstructured":"Fagerholt K, Hvattum L, Johnsen T, Korsvik J (2013) Routing and scheduling in project shipping. Ann Oper Res 207(1):67\u201381","journal-title":"Ann Oper Res"},{"issue":"5","key":"386_CR46","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1016\/j.cor.2006.10.006","volume":"35","author":"AE Fallahi","year":"2008","unstructured":"Fallahi AE, Prins C (2008) A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput Oper Res 35(5):1725\u20131741","journal-title":"Comput Oper Res"},{"issue":"11","key":"386_CR47","doi-asserted-by":"crossref","first-page":"2983","DOI":"10.1016\/j.cor.2009.01.015","volume":"36","author":"A Felipe","year":"2009","unstructured":"Felipe A, Ortu\u00f1o MT, Tirado G (2009b) The double traveling salesman problem with multiple stacks: a variable neighborhood search approach. Comput Oper Res 36(11):2983\u20132993","journal-title":"Comput Oper Res"},{"issue":"1","key":"386_CR48","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ejor.2010.11.011","volume":"211","author":"A Felipe","year":"2011","unstructured":"Felipe A, Ortu\u00f1o M, Tirado G (2011) Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints. Eur J Oper Res 211(1):66\u201375","journal-title":"Eur J Oper Res"},{"key":"386_CR49","unstructured":"Fok K, Chun A (2004) Optimizing air cargo load planning and analysis. In: Proceedings of the international conference on computing, communications and control technologies 2004, Austin Texas, USA"},{"issue":"3","key":"386_CR50","doi-asserted-by":"crossref","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","journal-title":"Comput Oper Res"},{"issue":"3","key":"386_CR51","doi-asserted-by":"crossref","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","journal-title":"Eur J Oper Res"},{"issue":"5\/6","key":"386_CR52","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1111\/j.1475-3995.1997.tb00095.x","volume":"4","author":"H Gehring","year":"1997","unstructured":"Gehring H, Bortfeldt A (1997) A genetic algorithm for solving the container loading problem. Int Trans Oper Res 4(5\/6):401\u2013418","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"386_CR53","doi-asserted-by":"crossref","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. Trans Sci 40(3):342\u2013350","journal-title":"Trans Sci"},{"issue":"1","key":"386_CR54","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1002\/net.20192","volume":"51","author":"M Gendreau","year":"2008","unstructured":"Gendreau M, Iori M, Laporte G, Martello S (2008) A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1):4\u201318","journal-title":"Networks"},{"key":"386_CR55","doi-asserted-by":"crossref","unstructured":"Golden B, Raghavan S, Wasil E (2008) The vehicle routing problem: latest advances and new challenges. Operations research\/computer science interfaces, 43, Springer, New York","DOI":"10.1007\/978-0-387-77778-8"},{"key":"386_CR56","unstructured":"International Transport Forum (2011) Permissible maximum weights of trucks in europe. http:\/\/www.internationaltransportforum.org\/IntOrg\/road\/pdf\/weights"},{"issue":"1","key":"386_CR57","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M Iori","year":"2010","unstructured":"Iori M, Martello S (2010) Routing problems with loading constraints. TOP 18(1):4\u201327","journal-title":"TOP"},{"issue":"2","key":"386_CR58","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/trsc.1060.0165","volume":"41","author":"M Iori","year":"2007","unstructured":"Iori M, Salazar-Gonz\u00e1lez JJ, Vigo D (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Trans Sci 41(2):253\u2013264","journal-title":"Trans Sci"},{"issue":"1","key":"386_CR59","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.cor.2010.07.017","volume":"39","author":"L Junqueira","year":"2012","unstructured":"Junqueira L, Morabito R (2012) Three-dimensional container loading models with cargo stability and load bearing constraints. Comput Oper Res 39(1):74\u201385","journal-title":"Comput Oper Res"},{"issue":"5","key":"386_CR60","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1111\/j.1475-3995.2012.00872.x","volume":"20","author":"L Junqueira","year":"2013","unstructured":"Junqueira L, Oliveira J, Carravilla M, Morabito R (2013) An optimization model for the vehicle routing problem with practical three-dimensional loading constraints. Int Trans Oper Res 20(5):645\u2013666","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"386_CR61","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10100-011-0204-9","volume":"21","author":"S Khebbache-Hadji","year":"2013","unstructured":"Khebbache-Hadji S, Prins C, Yalaoui A, Reghioui M (2013) Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows. Cent Eur J Oper Res 21(2):307\u2013336","journal-title":"Cent Eur J Oper Res"},{"issue":"4","key":"386_CR62","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1080\/03081068408717261","volume":"8","author":"SP Ladany","year":"1984","unstructured":"Ladany SP, Mehrez A (1984) Optimal routing of a single vehicle with loading and unloading constraints. Trans Plan Technol 8(4):301\u2013306","journal-title":"Trans Plan Technol"},{"issue":"4","key":"386_CR63","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Trans Sci 43(4):408\u2013416","journal-title":"Trans Sci"},{"issue":"1","key":"386_CR64","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.cor.2010.04.013","volume":"38","author":"S Leung","year":"2011","unstructured":"Leung S, Zhou X, Zhang D, Zheng J (2011) Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Comput Oper Res 38(1):205\u2013215","journal-title":"Comput Oper Res"},{"issue":"2","key":"386_CR65","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ejor.2012.09.023","volume":"225","author":"SC Leung","year":"2013","unstructured":"Leung SC, Zhang Z, Zhang D, Hua X, Lim MK (2013) A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints. Eur J Oper Res 225(2):199\u2013210","journal-title":"Eur J Oper Res"},{"issue":"3","key":"386_CR66","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0305-0548(01)00106-X","volume":"30","author":"G Levitin","year":"2003","unstructured":"Levitin G, Abezgaouz R (2003) Optimal routing of multiple-load AGV subject to LIFO loading constraints. Comput Oper Res 30(3):397\u2013410","journal-title":"Comput Oper Res"},{"issue":"3","key":"386_CR67","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.ejor.2011.02.008","volume":"212","author":"Y Li","year":"2011","unstructured":"Li Y, Lim A, Oon W, Qin H, Tu D (2011) The tree representation for the pickup and delivery traveling salesman problem with LIFO loading. Eur J Oper Res 212(3):482\u2013496","journal-title":"Eur J Oper Res"},{"key":"386_CR68","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.ijpe.2013.03.001","volume":"144","author":"A Lim","year":"2013","unstructured":"Lim A, Ma H, Qiu C, Zhu W (2013) The single container loading problem with axle weight constraints. Int J Prod Econ 144:358\u2013369","journal-title":"Int J Prod Econ"},{"issue":"9","key":"386_CR69","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1057\/jors.2011.134","volume":"63","author":"S Limbourg","year":"2012","unstructured":"Limbourg S, Schyns M, Laporte G (2012) Automatic aircraft cargo load planning. J Oper Res Soc 63(9):1271\u20131283","journal-title":"J Oper Res Soc"},{"issue":"4","key":"386_CR70","doi-asserted-by":"crossref","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","journal-title":"INFORMS J Comput"},{"key":"386_CR71","unstructured":"Lurkin V, Schyns M (2013) The airline container loading problem with pickup and delivery. Working paper HEC-University of Li\u00e9ge"},{"issue":"4","key":"386_CR72","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1002\/net.20473","volume":"58","author":"RM Lusby","year":"2011","unstructured":"Lusby RM, Larsen J (2011) Improved exact method for the double TSP with multiple stacks. Networks 58(4):290\u2013300","journal-title":"Networks"},{"issue":"5","key":"386_CR73","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1111\/j.1475-3995.2009.00748.x","volume":"17","author":"RM Lusby","year":"2010","unstructured":"Lusby RM, Larsen J, Ehrgott M, Ryan D (2010) An exact method for the double TSP with multiple stacks. Int Trans Oper Res 17(5):637\u2013652","journal-title":"Int Trans Oper Res"},{"key":"386_CR74","unstructured":"Malapert A, Gu\u00e9ret C, Jussien N, Langevin A, Rousseau L (2008) Two-dimensional pickup and delivery routing problem with loading constraints. In: Proceedings of the 1st CPAIOR workshop on bin packing and placement constraints (BPPC\u201908)"},{"issue":"3","key":"386_CR75","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manag Sci 44(3):388\u2013399","journal-title":"Manag Sci"},{"issue":"2","key":"386_CR76","doi-asserted-by":"crossref","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 (2000) The three-dimensional bin packing problem. Oper Res 48(2):256\u2013267","journal-title":"Oper Res"},{"key":"386_CR77","doi-asserted-by":"crossref","first-page":"1630","DOI":"10.1057\/jors.2012.128","volume":"64","author":"L Martinez","year":"2013","unstructured":"Martinez L, Amaya C (2013) A vehicle routing problem with multi-trips and time windows for circular items. J Oper Res Soc 64:1630\u20131643","journal-title":"J Oper Res Soc"},{"key":"386_CR78","doi-asserted-by":"crossref","unstructured":"Massen F, Deville Y, Van Hentenryck P (2012) Pheromone-based heuristic column generation for vehicle routing problems with black box feasibility. International conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR2012). Springer LNCS, Nantes, France, pp 260\u2013274","DOI":"10.1007\/978-3-642-29828-8_17"},{"issue":"11","key":"386_CR79","doi-asserted-by":"crossref","first-page":"1886","DOI":"10.1016\/j.cor.2009.06.015","volume":"37","author":"JE Mendoza","year":"2010","unstructured":"Mendoza JE, Castanier B, Gu\u00e9ret C, Medaglia AL, Velasco N (2010) A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Comput Oper Res 37(11):1886\u20131898","journal-title":"Comput Oper Res"},{"issue":"1","key":"386_CR80","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1051\/ro\/2012008","volume":"46","author":"L Miao","year":"2012","unstructured":"Miao L, Ruan Q, Woghiren K, Ruo Q (2012) A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints. RAIRO Oper Res 46(1):63\u201382","journal-title":"RAIRO Oper Res"},{"key":"386_CR81","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-8349-9777-7_11","volume-title":"Intelligent Decision Support","author":"A Moura","year":"2008","unstructured":"Moura A (2008) A multi-objective genetic algorithm for the vehicle routing with time windows and loading problem. In: Bortfeldt A, Homberger J, Kopfer H, Pankratz G, Strangmeier R (eds) Intelligent Decision Support. Current Challenges and Approaches, Gabler, pp 187\u2013201"},{"issue":"4","key":"386_CR82","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1007\/s00291-008-0129-4","volume":"31","author":"A Moura","year":"2009","unstructured":"Moura A, Oliveira J (2009) An integrated approach to the vehicle routing and container loading problems. OR Spectr 31(4):775\u2013800","journal-title":"OR Spectr"},{"issue":"9","key":"386_CR83","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1016\/j.cor.2009.12.014","volume":"37","author":"L Muyldermans","year":"2010","unstructured":"Muyldermans L, Pang G (2010) A guided local search procedure for the multi-compartment capacitated arc routing problem. Comput Oper Res 37(9):1662\u20131673","journal-title":"Comput Oper Res"},{"key":"386_CR84","doi-asserted-by":"crossref","unstructured":"\u00d8vsteb\u00f8 B, Hvattum LM, Fagerholt K (2011) Routing and scheduling of roro ships with stowage constraints. Trans Res Part C Emerg Technol 19(6):1225\u20131242","DOI":"10.1016\/j.trc.2011.02.001"},{"key":"386_CR85","doi-asserted-by":"crossref","unstructured":"Paquay C, Schyns M, Limbourg S (2013) A mixed integer programming formulation for the three dimensional bin packing problem deriving from an air cargo application. Int Trans Oper Res (forthcoming). doi: 10.1111\/itor.12111","DOI":"10.1111\/itor.12111"},{"issue":"2","key":"386_CR86","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"S Parragh","year":"2008","unstructured":"Parragh S, Doerner K, Hartl R (2008) A survey on pickup and delivery problems part ii: transportation between pickup and delivery locations. J f\u00fcr Betrieb 58(2):81\u2013117","journal-title":"J f\u00fcr Betrieb"},{"issue":"1","key":"386_CR87","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.ejor.2008.08.009","volume":"198","author":"HL Petersen","year":"2009","unstructured":"Petersen HL, Madsen O (2009) The double travelling salesman problem with multiple stacks formulation and heuristic solution approaches. Eur J Oper Res 198(1):139\u2013147","journal-title":"Eur J Oper Res"},{"issue":"4","key":"386_CR88","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/net.20375","volume":"56","author":"HL Petersen","year":"2010","unstructured":"Petersen HL, Archetti C, Speranza MG (2010) Exact solutions to the double travelling salesman problem with multiple stacks. Networks 56(4):229\u2013243","journal-title":"Networks"},{"key":"386_CR89","unstructured":"Pollaris H, Braekers K, Caris A, Janssens GK (2013) The capacitated vehicle routing problem with loading constraints. In: Bruzzone A, Gronalt M, Merkuryev Y, Piera M (eds) Proceedings of the international conference on harbor maritime and multimodal logistics M & S, 2013. Greece, Athens, pp 7\u201312"},{"key":"386_CR90","doi-asserted-by":"crossref","unstructured":"Pollaris H, Braekers K, Caris A, Janssens GK, Limbourg S (2014) Capacitated vehicle routing problem with sequence based pallet loading and axle weight constraints. EURO J Trans Logist (forthcoming). doi: 10.1007\/s13676-014-0064-2","DOI":"10.1007\/s13676-014-0064-2"},{"issue":"1","key":"386_CR91","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01545534","volume":"20","author":"M Ratcliff","year":"1998","unstructured":"Ratcliff M, Bischoff E (1998) Allowing for weight considerations in container loading. Oper Res Spektr 20(1):65\u201371","journal-title":"Oper Res Spektr"},{"key":"386_CR92","doi-asserted-by":"crossref","unstructured":"Ren J, Tian Y, Sawaragi T (2011) A relaxation method for the three-dimensional loading capacitated vehicle routing problem. In: 2011 IEEE\/SICE international symposium on system integration (SII), pp 750\u2013755","DOI":"10.1109\/SII.2011.6147542"},{"issue":"6","key":"386_CR93","doi-asserted-by":"crossref","first-page":"1579","DOI":"10.1016\/j.cor.2011.11.013","volume":"40","author":"Q Ruan","year":"2013","unstructured":"Ruan Q, Zhang Z, Miao L, Shen H (2013) A hybrid approach for the vehicle routing problem with three-dimensional loading constraints. Comput Oper Res 40(6):1579\u20131589","journal-title":"Comput Oper Res"},{"key":"386_CR94","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/978-3-642-16054-7_12","volume-title":"Hybrid metaheuristics lecture notes in computer science","author":"J Strodl","year":"2010","unstructured":"Strodl J, Doerner K, Tricoire F, Hartl R (2010) On index structures in hybrid metaheuristics for routing problems with hard feasibility checks: an application to the 2-dimensional loading vehicle routing problem. In: Blesa M, Blum C, Raidl G, Roli A, Sampels M (eds) Hybrid metaheuristics lecture notes in computer science, vol 6373. Springer, Berlin, pp 160\u2013173"},{"key":"386_CR95","doi-asserted-by":"crossref","unstructured":"Tao Y, Wang F (2013) An effective tabu search approach with improved loading algorithms for the 3l-cvrp. Comput Oper Res doi: 10.1016\/j.cor.2013.10.017","DOI":"10.1016\/j.cor.2013.10.017"},{"key":"386_CR96","doi-asserted-by":"crossref","unstructured":"Tarantilis C, Zachariadis E, Kiranoudis C (2009) A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Trans Intell Trans Syst 10(2):255\u2013271","DOI":"10.1109\/TITS.2009.2020187"},{"key":"386_CR97","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The vehicle routing problem. Monographs on discrete mathematics and applications","author":"P Toth","year":"2002","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. Monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics, Philadelphia"},{"issue":"4","key":"386_CR98","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1007\/s00291-009-0179-2","volume":"33","author":"F Tricoire","year":"2011","unstructured":"Tricoire F, Doerner K, Hartl R, Iori M (2011) Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR Spectr 33(4):931\u2013959","journal-title":"OR Spectr"},{"key":"386_CR99","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.tre.2013.12.013","volume":"65","author":"W Vancroonenburg","year":"2014","unstructured":"Vancroonenburg W, Verstichel J, Tavernier K (2014) Automatic air cargo selection and weight balancing: a mixed integer programming approach. Trans Res E Logist Trans Rev 65:70\u201383","journal-title":"Trans Res E Logist Trans Rev"},{"issue":"1","key":"386_CR100","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen P, Souffriau W, Van Oudheusden D (2011) The orienteering problem: a survey. Eur J Oper Res 209(1):1\u201310","journal-title":"Eur J Oper Res"},{"issue":"1","key":"386_CR101","doi-asserted-by":"crossref","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 (2013) Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur J Oper Res 231(1):1\u201321","journal-title":"Eur J Oper Res"},{"issue":"3","key":"386_CR102","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher G, Hauner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183(3):1109\u20131130","journal-title":"Eur J Oper Res"},{"issue":"5","key":"386_CR103","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1016\/j.cor.2008.03.004","volume":"36","author":"L Wei","year":"2009","unstructured":"Wei L, Zhang D, Chen Q (2009) A least wasted first heuristic algorithm for the rectangular packing problem. Comput Oper Res 36(5):1608\u20131614","journal-title":"Comput Oper Res"},{"key":"386_CR104","unstructured":"Wisniewski MA, Ritt M, Buriol LS (2012) A tabu search algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Tech. rep., Institute of Informatics at UFRGS, http:\/\/inf.ufrgs.br\/mrpritt\/Publications\/P37-sbpo-2011a"},{"issue":"3","key":"386_CR105","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/trsc.37.3.347.16044","volume":"37","author":"H Xu","year":"2003","unstructured":"Xu H, Chen ZL, Rajagopal S, Arunapuram S (2003) Solving a practical pickup and delivery problem. Trans Sci 37(3):347\u2013364","journal-title":"Trans Sci"},{"issue":"3","key":"386_CR106","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/j.ejor.2007.05.058","volume":"195","author":"E Zachariadis","year":"2009","unstructured":"Zachariadis E, Tarantilis C, Kiranoudis C (2009) A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 195(3):729\u2013743","journal-title":"Eur J Oper Res"},{"issue":"3","key":"386_CR107","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/trsc.1110.0373","volume":"46","author":"E Zachariadis","year":"2012","unstructured":"Zachariadis E, Tarantilis C, Kiranoudis C (2012) The pallet-packing vehicle routing problem. Trans Sci 46(3):341\u2013358","journal-title":"Trans Sci"},{"issue":"2","key":"386_CR108","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.ejor.2013.02.056","volume":"229","author":"E Zachariadis","year":"2013","unstructured":"Zachariadis E, Tarantilis C, Kiranoudis C (2013a) Designing vehicle routes for a mix of different request types, under time windows and loading constraints. Eur J Oper Res 229(2):303\u2013317","journal-title":"Eur J Oper Res"},{"issue":"1","key":"386_CR109","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.ejor.2013.01.040","volume":"228","author":"E Zachariadis","year":"2013","unstructured":"Zachariadis E, Tarantilis C, Kiranoudis C (2013b) Integrated distribution and loading planning via a compact metaheuristic algorithm. Eur J Oper Res 228(1):56\u201371","journal-title":"Eur J Oper Res"},{"issue":"9","key":"386_CR110","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1016\/j.cor.2011.11.001","volume":"39","author":"W Zhu","year":"2012","unstructured":"Zhu W, Qin H, Lim A, Wang L (2012) A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP. Comput Oper Res 39(9):2178\u20132195","journal-title":"Comput Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-014-0386-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-014-0386-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-014-0386-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T00:50:01Z","timestamp":1598575801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-014-0386-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,18]]},"references-count":110,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["386"],"URL":"https:\/\/doi.org\/10.1007\/s00291-014-0386-3","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,18]]}}}