{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T17:52:14Z","timestamp":1769017934301,"version":"3.49.0"},"reference-count":88,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"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":[[2018,10]]},"DOI":"10.1007\/s00291-018-0506-6","type":"journal-article","created":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T04:38:04Z","timestamp":1517459884000},"page":"1029-1075","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5372-1456","authenticated-orcid":false,"given":"Henriette","family":"Koch","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Bortfeldt","sequence":"additional","affiliation":[]},{"given":"Gerhard","family":"W\u00e4scher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,1]]},"reference":[{"key":"506_CR1","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-56183-2_15","volume-title":"Quantitative approaches to distribution logistics and supply chain management","author":"E Angelelli","year":"2002","unstructured":"Angelelli E, Mansini R (2002) The vehicle routing problem with time windows and simultaneous pick-up and delivery. In: Klose A, Speranza MG, van Wassenhove LN (eds) Quantitative approaches to distribution logistics and supply chain management. Springer, Berlin, pp 249\u2013267. \n                    https:\/\/doi.org\/10.1007\/978-3-642-56183-2_15"},{"key":"506_CR2","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.eswa.2016.01.038","volume":"53","author":"M Avci","year":"2016","unstructured":"Avci M, Topaloglu S (2016) A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery. Expert Syst Appl 53:160\u2013171. \n                    https:\/\/doi.org\/10.1016\/j.eswa.2016.01.038","journal-title":"Expert Syst Appl"},{"issue":"4","key":"506_CR3","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"BS Baker","year":"1980","unstructured":"Baker BS, Coffman EG Jr, Rivest RL (1980) Orthogonal packings in two dimensions. SIAM J Comput 9(4):846\u2013855. \n                    https:\/\/doi.org\/10.1137\/0209064","journal-title":"SIAM J Comput"},{"issue":"5","key":"506_CR4","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 59(5):1269\u20131283. \n                    https:\/\/doi.org\/10.1287\/opre.1110.0975","journal-title":"Oper Res"},{"issue":"1","key":"506_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.14232\/actacyb.20.1.2011.3","volume":"20","author":"T Bart\u00f3k","year":"2011","unstructured":"Bart\u00f3k T, Imreh C (2011) Pickup and delivery vehicle routing with multidimensional loading constraints. Acta Cybern 20(1):17\u201333. \n                    https:\/\/doi.org\/10.14232\/actacyb.20.1.2011.3","journal-title":"Acta Cybern"},{"issue":"4","key":"506_CR6","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 M (1995) Issues in the development of approaches to container loading. Omega 23(4):377\u2013390. \n                    https:\/\/doi.org\/10.1016\/0305-0483(95)00015-G","journal-title":"Omega"},{"issue":"9","key":"506_CR7","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. \n                    https:\/\/doi.org\/10.1016\/j.cor.2011.11.008","journal-title":"Comput Oper Res"},{"issue":"1","key":"506_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ejor.2014.12.001","volume":"243","author":"A Bortfeldt","year":"2015","unstructured":"Bortfeldt A, Hahn T, M\u00e4nnel D, M\u00f6nch L (2015) Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints. Eur J Oper Res 243(1):82\u201396. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2014.12.001","journal-title":"Eur J Oper Res"},{"issue":"2","key":"506_CR9","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1016\/j.ejor.2005.01.042","volume":"173","author":"J Brand\u00e3o","year":"2006","unstructured":"Brand\u00e3o J (2006) A new tabu search algorithm for the vehicle routing problem with backhauls. Eur J Oper Res 173(2):540\u2013555. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2005.01.042","journal-title":"Eur J Oper Res"},{"issue":"10","key":"506_CR10","doi-asserted-by":"publisher","first-page":"6809","DOI":"10.1016\/j.eswa.2010.03.045","volume":"37","author":"B \u00c7atay","year":"2010","unstructured":"\u00c7atay B (2010) A new saving-based ant algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Syst Appl 37(10):6809\u20136817. \n                    https:\/\/doi.org\/10.1016\/j.eswa.2010.03.045","journal-title":"Expert Syst Appl"},{"issue":"10","key":"506_CR11","doi-asserted-by":"publisher","first-page":"2972","DOI":"10.1016\/j.cor.2005.02.029","volume":"33","author":"A Chabrier","year":"2006","unstructured":"Chabrier A (2006) Vehicle routing problem with elementary shortest path based column generation. Comput Oper Res 33(10):2972\u20132990. \n                    https:\/\/doi.org\/10.1016\/j.cor.2005.02.029","journal-title":"Comput Oper Res"},{"issue":"4","key":"506_CR12","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 JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581. \n                    http:\/\/www.jstor.org\/stable\/167703","journal-title":"Operations Research"},{"key":"506_CR13","unstructured":"Cook W, Rich JL (1999) A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Computational and Applied Mathematics Department, Rice University, Houston, TX, Technical Report"},{"issue":"11","key":"506_CR14","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1057\/palgrave.jors.2601935","volume":"56","author":"J Crispim","year":"2005","unstructured":"Crispim J, Brand\u00e3o J (2005) Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. J Oper Res Soc 56(11):1296\u20131302. \n                    http:\/\/www.jstor.org\/stable\/4102082","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"506_CR15","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/S0377-2217(98)00139-8","volume":"114","author":"A Davies","year":"1999","unstructured":"Davies A, Bischoff EE (1999) Weight distribution considerations in container loading. Eur J Oper Res 114(3):509\u2013527. \n                    https:\/\/doi.org\/10.1016\/S0377-2217(98)00139-8","journal-title":"Eur J Oper Res"},{"issue":"2","key":"506_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1287\/trsc.1050.0118","volume":"40","author":"M Dell\u2019Amico","year":"2006","unstructured":"Dell\u2019Amico M, Righini G, Salani M (2006) A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transp Sci 40(2):235\u2013247. \n                    https:\/\/doi.org\/10.1287\/trsc.1050.0118","journal-title":"Transp Sci"},{"issue":"2","key":"506_CR17","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.ejor.2012.06.044","volume":"223","author":"E Demir","year":"2012","unstructured":"Demir E, Bekta\u015f T, Laporte G (2012) An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur J Oper Res 223(2):346\u2013359. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2012.06.044","journal-title":"Eur J Oper Res"},{"issue":"3","key":"506_CR18","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/trsc.1070.0223","volume":"42","author":"G Desaulniers","year":"2008","unstructured":"Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k -path inequalities for the vehicle routing problem with time windows. Transp Sci 42(3):387\u2013404. \n                    https:\/\/doi.org\/10.1287\/trsc.1070.0223","journal-title":"Transp Sci"},{"issue":"1","key":"506_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/PL00013346","volume":"23","author":"J Dethloff","year":"2001","unstructured":"Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum 23(1):79\u201396. \n                    https:\/\/doi.org\/10.1007\/PL00013346","journal-title":"OR Spektrum"},{"key":"506_CR20","unstructured":"Dominguez O, Guimarans D, Juan AA (2015) A hybrid heuristic for the 2L-VRP with clustered backhauls. In: Proceedings of the XVI Conferencia de la Asociaci\u00f3n Espa\u00f1ola para la Inteligencia Artificial (CAEPIA)"},{"key":"506_CR21","doi-asserted-by":"publisher","first-page":"5284","DOI":"10.1016\/j.proeng.2011.08.979","volume":"15","author":"J Fan","year":"2011","unstructured":"Fan J (2011) The vehicle routing problem with simultaneous pickup and delivery based on customer satisfaction. Procedia Eng 15:5284\u20135289. \n                    https:\/\/doi.org\/10.1016\/j.proeng.2011.08.979","journal-title":"Procedia Eng"},{"issue":"3","key":"506_CR22","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. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2009.03.046","journal-title":"Eur J Oper Res"},{"issue":"1","key":"506_CR23","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.ejor.2008.02.025","volume":"196","author":"Y Gajpal","year":"2009","unstructured":"Gajpal Y, Abad PL (2009) Multi-ant colony system (MACS) for a vehicle routing problem with backhauls. Eur J Oper Res 196(1):102\u2013117. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2008.02.025","journal-title":"Eur J Oper Res"},{"key":"506_CR24","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.cie.2014.12.029","volume":"81","author":"A Garc\u00eda-N\u00e1jera","year":"2015","unstructured":"Garc\u00eda-N\u00e1jera A, Bullinaria JA, Guti\u00e9rrez-Andrade MA (2015) An evolutionary approach for multi-objective vehicle routing problems with backhauls. Comput Ind Eng 81:90\u2013108. \n                    https:\/\/doi.org\/10.1016\/j.cie.2014.12.029","journal-title":"Comput Ind Eng"},{"issue":"1","key":"506_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02098283","volume":"61","author":"S G\u00e9linas","year":"1995","unstructured":"G\u00e9linas S, Desrochers M, Desrosiers J, Solomon MM (1995) A new branching strategy for time constrained routing problems with application to backhauling. Ann Oper Res 61(1):91\u2013109. \n                    https:\/\/doi.org\/10.1007\/BF02098283","journal-title":"Ann Oper Res"},{"issue":"3","key":"506_CR26","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 Sci 40(3):342\u2013350. \n                    https:\/\/doi.org\/10.1287\/trsc.1050.0145","journal-title":"Transp Sci"},{"issue":"1","key":"506_CR27","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0377-2217(89)90057-X","volume":"42","author":"M Goetschalckx","year":"1989","unstructured":"Goetschalckx M, Jacobs-Blecha C (1989) The vehicle routing problem with backhauls. Eur J Oper Res 42(1):39\u201351. \n                    https:\/\/doi.org\/10.1016\/0377-2217(89)90057-X","journal-title":"Eur J Oper Res"},{"issue":"2","key":"506_CR28","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.cor.2011.03.009","volume":"39","author":"JF Gon\u00e7alves","year":"2012","unstructured":"Gon\u00e7alves JF, Resende MG (2012) A parallel multi-population biased random-key genetic algorithm for a container loading problem. Comput Oper Res 39(2):179\u2013190. \n                    https:\/\/doi.org\/10.1016\/j.cor.2011.03.009","journal-title":"Comput Oper Res"},{"key":"506_CR29","unstructured":"Halse K (1992) Modeling and solving complex vehicle routing problems. Ph.D. Thesis, Technical University of Denmark, Lyngby"},{"key":"506_CR30","unstructured":"Hopper E (2000) Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. Ph.D. Thesis, University of Wales. Cardiff"},{"issue":"1","key":"506_CR31","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 (2010) Routing problems with loading constraints. TOP 18(1):4\u201327. \n                    https:\/\/doi.org\/10.1007\/s11750-010-0144-x","journal-title":"TOP"},{"issue":"3","key":"506_CR32","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/ijoc.1040.0117","volume":"18","author":"S Irnich","year":"2006","unstructured":"Irnich S, Villeneuve D (2006) The shortest-path problem with resource constraints and k -cycle elimination for k \n                    \n                      \n                    \n                    $$\\ge $$\n                    \n                      \n                        \u2265\n                      \n                    \n                   3. INFORMS J Comput 18(3):391\u2013406. \n                    https:\/\/doi.org\/10.1287\/ijoc.1040.0117","journal-title":"INFORMS J Comput"},{"key":"506_CR33","first-page":"1","volume-title":"Vehicle routing, MOS-SIAM series on optimization","author":"S Irnich","year":"2014","unstructured":"Irnich S, Toth P, Vigo D (2014) The family of vehicle routing problems. In: Toth P, Vigo D (eds) Vehicle routing, MOS-SIAM series on optimization. SIAM, Philadelphia, pp 1\u201333"},{"issue":"1","key":"506_CR34","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S Jakobs","year":"1996","unstructured":"Jakobs S (1996) On genetic algorithms for the packing of polygons. Eur J Oper Res 88(1):165\u2013181. \n                    https:\/\/doi.org\/10.1016\/0377-2217(94)00166-9","journal-title":"Eur J Oper Res"},{"issue":"2","key":"506_CR35","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M Jepsen","year":"2008","unstructured":"Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper Res 56(2):497\u2013511. \n                    https:\/\/doi.org\/10.1287\/opre.1070.0449","journal-title":"Oper Res"},{"issue":"5","key":"506_CR36","doi-asserted-by":"publisher","first-page":"5641","DOI":"10.1016\/j.eswa.2011.11.053","volume":"39","author":"Y Jun","year":"2012","unstructured":"Jun Y, Kim BI (2012) New best solutions to VRPSPD benchmark problems by a perturbation based algorithm. Expert Syst Appl 39(5):5641\u20135648. \n                    https:\/\/doi.org\/10.1016\/j.eswa.2011.11.053","journal-title":"Expert Syst Appl"},{"key":"506_CR37","unstructured":"Kallehauge B, Larsen J, Madsen OB (2000) Lagrangian duality and non-differentiable optimization applied on routing with time windows-experimental results. Relat\u00f3rio interno IMM-REP-2000-8, Department of Mathematical Modeling, Technical University of Denmark, Lyngby, Dinamarca"},{"key":"506_CR38","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-540-30198-1_45","volume-title":"Advances in information systems. Lecture Notes in Computer Science","author":"K Karabulut","year":"2005","unstructured":"Karabulut K, Inceoglu 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. Lecture Notes in Computer Science, vol 3261. Springer, Berlin, pp 441\u2013450. \n                    https:\/\/doi.org\/10.1007\/978-3-540-30198-1_45"},{"issue":"1","key":"506_CR39","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/trsc.33.1.101","volume":"33","author":"N Kohl","year":"1999","unstructured":"Kohl N, Desrosiers J, Madsen OBG, Solomon MM, Soumis F (1999) 2-Path cuts for the vehicle routing problem with time windows. Transp Sci 33(1):101\u2013116. \n                    https:\/\/doi.org\/10.1287\/trsc.33.1.101","journal-title":"Transp Sci"},{"key":"506_CR40","unstructured":"Larsen J (1999) Parallelization of the vehicle routing problem with time windows. Ph.D. Thesis, Technical University of Denmark, Department of Informatics and Mathematical Modeling"},{"issue":"2","key":"506_CR41","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0377-2217(97)00437-2","volume":"112","author":"D Liu","year":"1999","unstructured":"Liu D, Teng H (1999) An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. Eur J Oper Res 112(2):413\u2013420. \n                    https:\/\/doi.org\/10.1016\/S0377-2217(97)00437-2","journal-title":"Eur J Oper Res"},{"issue":"4","key":"506_CR42","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. \n                    https:\/\/doi.org\/10.1287\/ijoc.11.4.345","journal-title":"INFORMS J Comput"},{"key":"506_CR43","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-642-18129-0_94","volume-title":"Intelligent computing and information science, communications in computer and information science","author":"Hw Ma","year":"2011","unstructured":"Ma Hw, Zhu W, Xu S (2011) Research on the algorithm for 3L-CVRP with considering the utilization rate of vehicles. In: Chen R (ed) Intelligent computing and information science, communications in computer and information science, vol 134. Springer, Berlin, pp 621\u2013629. \n                    https:\/\/doi.org\/10.1007\/978-3-642-18129-0_94"},{"issue":"3","key":"506_CR44","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.ejor.2016.04.016","volume":"254","author":"D M\u00e4nnel","year":"2016","unstructured":"M\u00e4nnel D, Bortfeldt A (2016) A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints. Eur J Oper Res 254(3):840\u2013858. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2016.04.016","journal-title":"Eur J Oper Res"},{"key":"506_CR45","doi-asserted-by":"publisher","unstructured":"Maquera G, Laguna M, Gandelman DA, Sant\u2019Anna AP (2012) Scatter search applied to the vehicle routing problem with simultaneous delivery and pickup. In: Yin PY (ed) Trends in developing metaheuristics, algorithms, and optimization approaches. IGI Global, pp 149\u2013168. \n                    https:\/\/doi.org\/10.4018\/978-1-4666-2145-9.ch010","DOI":"10.4018\/978-1-4666-2145-9.ch010"},{"issue":"2","key":"506_CR46","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.eswa.2005.12.014","volume":"32","author":"D Mester","year":"2007","unstructured":"Mester D, Br\u00e4ysy O, Dullaert W (2007) A multi-parametric evolution strategies algorithm for vehicle routing problems. Expert Syst Appl 32(2):508\u2013517. \n                    https:\/\/doi.org\/10.1016\/j.eswa.2005.12.014","journal-title":"Expert Syst Appl"},{"issue":"1","key":"506_CR47","doi-asserted-by":"publisher","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. \n                    https:\/\/doi.org\/10.1051\/ro\/2012008","journal-title":"RAIRO Oper Res"},{"issue":"5","key":"506_CR48","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0191-2607(89)90085-X","volume":"23","author":"H Min","year":"1989","unstructured":"Min H (1989) The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transp Res Part A Gen 23(5):377\u2013386. \n                    https:\/\/doi.org\/10.1016\/0191-2607(89)90085-X","journal-title":"Transp Res Part A Gen"},{"key":"506_CR49","doi-asserted-by":"publisher","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, Gabler Edition Wissenschaft, Betriebswirtschaftlicher Verlag Dr. Th. Gabler\/GWV Fachverlage GmbH Wiesbaden, Wiesbaden, pp 187\u2013201. \n                    https:\/\/doi.org\/10.1007\/978-3-8349-9777-7_11","DOI":"10.1007\/978-3-8349-9777-7_11"},{"issue":"4","key":"506_CR50","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 Spectr 31(4):775\u2013800. \n                    https:\/\/doi.org\/10.1007\/s00291-008-0129-4","journal-title":"OR Spectr"},{"issue":"4","key":"506_CR51","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/jos.122","volume":"5","author":"IH Osman","year":"2002","unstructured":"Osman IH, Wassan NA (2002) A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls. J Sched 5(4):263\u2013285. \n                    https:\/\/doi.org\/10.1002\/jos.122","journal-title":"J Sched"},{"issue":"1","key":"506_CR52","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery problems. Journal f\u00fcr Betriebswirtschaft 58(1):21\u201351. \n                    https:\/\/doi.org\/10.1007\/s11301-008-0033-7","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"4","key":"506_CR53","doi-asserted-by":"publisher","first-page":"311","DOI":"10.5937\/fmet1504311P","volume":"43","author":"T Pinto","year":"2015","unstructured":"Pinto T, Alves C, De C, Moura A (2015) An insertion heuristic for the capacitated vehicle routing problem with loading constraints and mixed linehauls and backhauls. FME Trans 43(4):311\u2013318. \n                    https:\/\/doi.org\/10.5937\/fmet1504311P","journal-title":"FME Trans"},{"issue":"2","key":"506_CR54","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ejor.2014.10.010","volume":"242","author":"O Polat","year":"2015","unstructured":"Polat O, Kalayci CB, Kulak O, G\u00fcnther HO (2015) A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit. Eur J Oper Res 242(2):369\u2013382. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2014.10.010","journal-title":"Eur J Oper Res"},{"issue":"2","key":"506_CR55","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00291-014-0386-3","volume":"37","author":"H Pollaris","year":"2015","unstructured":"Pollaris H, Braekers K, Caris A, Janssens GK, Limbourg S (2015) Vehicle routing problems with loading constraints: state-of-the-art and future directions. OR Spectr 37(2):297\u2013330. \n                    https:\/\/doi.org\/10.1007\/s00291-014-0386-3","journal-title":"OR Spectr"},{"issue":"4","key":"506_CR56","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00132738","volume":"6","author":"JY Potvin","year":"1996","unstructured":"Potvin JY, Duhamel C, Guertin F (1996) A genetic algorithm for vehicle routing with backhauling. Appl Intell 6(4):345\u2013355. \n                    https:\/\/doi.org\/10.1007\/BF00132738","journal-title":"Appl Intell"},{"key":"506_CR57","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45724-0_12","volume-title":"Ant Algorithms","author":"Marc Reimann","year":"2002","unstructured":"Reimann M, Doerner K, Hartl RF (2002) Insertion based ants for vehicle routing problems with backhauls and time windows. In: Dorigo M, Di Caro G, Sampels M (eds) Ant algorithms: third international workshop, ANTS 2002 Brussels, Belgium, September 12\u201314, 2002 Proceedings, Springer, Berlin, pp 135\u2013148. \n                    https:\/\/doi.org\/10.1007\/3-540-45724-0_12"},{"issue":"1","key":"506_CR58","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF03342743","volume":"6","author":"J Rieck","year":"2013","unstructured":"Rieck J, Zimmermann J (2013) Exact solutions to the symmetric and asymmetric vehicle routing problem with simultaneous delivery and pick-up. Bus Res 6(1):77\u201392. \n                    https:\/\/doi.org\/10.1007\/BF03342743","journal-title":"Bus Res"},{"issue":"3","key":"506_CR59","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.ejor.2004.09.004","volume":"171","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) A unified heuristic for a large class of vehicle routing problems with backhauls. Eur J Oper Res 171(3):750\u2013775. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2004.09.004","journal-title":"Eur J Oper Res"},{"issue":"4","key":"506_CR60","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455\u2013472. \n                    https:\/\/doi.org\/10.1287\/trsc.1050.0135","journal-title":"Transp Sci"},{"key":"506_CR61","unstructured":"Salani M (2006) Branch-and-price algorithms for vehicle routing problems. Ph.D. Thesis, Universit\u00e0 degli studi di Milano"},{"issue":"10","key":"506_CR62","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.2307\/3009928","volume":"50","author":"S Salhi","year":"1999","unstructured":"Salhi S, Nagy G (1999) A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J Oper Res Soc 50(10):1034. \n                    https:\/\/doi.org\/10.2307\/3009928","journal-title":"J Oper Res Soc"},{"key":"506_CR63","unstructured":"Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems"},{"key":"506_CR64","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and practice of constraint programming\u2014CP98. Lecture Notes in Computer Science","author":"P Shaw","year":"1998","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M, Puget JF (eds) Principles and practice of constraint programming\u2014CP98. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, pp 417\u2013431. \n                    https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"issue":"2","key":"506_CR65","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","journal-title":"Oper Res"},{"issue":"11","key":"506_CR66","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A Subramanian","year":"2010","unstructured":"Subramanian A, Drummond L, Bentes C, Ochi LS, Farias R (2010) A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 37(11):1899\u20131911. \n                    https:\/\/doi.org\/10.1016\/j.cor.2009.10.011","journal-title":"Comput Oper Res"},{"key":"506_CR67","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-13193-6_24","volume-title":"Experimental algorithms. Lecture Notes in Computer Science","author":"A Subramanian","year":"2010","unstructured":"Subramanian A, Uchoa E, Ochi LS (2010) New lower bounds for the vehicle routing problem with simultaneous pickup and delivery. In: Festa P (ed) Experimental algorithms. Lecture Notes in Computer Science, vol 6049. Springer, Berlin, pp 276\u2013287. \n                    https:\/\/doi.org\/10.1007\/978-3-642-13193-6_24"},{"issue":"7","key":"506_CR68","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1007\/s11590-012-0570-9","volume":"7","author":"A Subramanian","year":"2013","unstructured":"Subramanian A, Uchoa E, Pessoa AA, Ochi LS (2013) Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery. Optim Lett 7(7):1569\u20131581. \n                    https:\/\/doi.org\/10.1007\/s11590-012-0570-9","journal-title":"Optim Lett"},{"issue":"3","key":"506_CR69","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.cor.2004.07.009","volume":"33","author":"FA Tang Montan\u00e9","year":"2006","unstructured":"Tang Montan\u00e9 FA, Galv\u00e3o RD (2006) A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput Oper Res 33(3):595\u2013619. \n                    https:\/\/doi.org\/10.1016\/j.cor.2004.07.009","journal-title":"Comput Oper Res"},{"key":"506_CR70","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.cor.2013.10.017","volume":"55","author":"Y Tao","year":"2015","unstructured":"Tao Y, Wang F (2015) An effective tabu search approach with improved loading algorithms for the 3L-CVRP. Comput Oper Res 55:127\u2013140. \n                    https:\/\/doi.org\/10.1016\/j.cor.2013.10.017","journal-title":"Comput Oper Res"},{"issue":"2","key":"506_CR71","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. \n                    https:\/\/doi.org\/10.1109\/TITS.2009.2020187","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"506_CR72","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.cie.2011.11.025","volume":"62","author":"AS Tasan","year":"2012","unstructured":"Tasan AS, Gen M (2012) A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Comput Ind Eng 62(3):755\u2013761. \n                    https:\/\/doi.org\/10.1016\/j.cie.2011.11.025","journal-title":"Comput Ind Eng"},{"key":"506_CR73","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-85256-5_26","volume-title":"Advanced methods in transportation analysis","author":"P Toth","year":"1996","unstructured":"Toth P, Vigo D (1996) A heuristic algorithm for the vehicle routing problem with backhauls. In: Bianco L, Toth P (eds) Advanced methods in transportation analysis. Springer, Berlin, pp 585\u2013608. \n                    https:\/\/doi.org\/10.1007\/978-3-642-85256-5_26"},{"issue":"4","key":"506_CR74","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1287\/trsc.31.4.372","volume":"31","author":"P Toth","year":"1997","unstructured":"Toth P, Vigo D (1997) An exact algorithm for the vehicle routing problem with backhauls. Transp Sci 31(4):372\u2013385. \n                    https:\/\/doi.org\/10.1287\/trsc.31.4.372","journal-title":"Transp Sci"},{"key":"506_CR75","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cie.2015.02.005","volume":"83","author":"C Wang","year":"2015","unstructured":"Wang C, Mu D, Zhao F, Sutherland JW (2015) A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows. Comput Ind Eng 83:111\u2013122. \n                    https:\/\/doi.org\/10.1016\/j.cie.2015.02.005","journal-title":"Comput Ind Eng"},{"issue":"1","key":"506_CR76","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cie.2011.08.018","volume":"62","author":"HF Wang","year":"2012","unstructured":"Wang HF, Chen YY (2012) A genetic algorithm for the simultaneous delivery and pickup problems with time window. Comput Ind Eng 62(1):84\u201395. \n                    https:\/\/doi.org\/10.1016\/j.cie.2011.08.018","journal-title":"Comput Ind Eng"},{"key":"506_CR77","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-15246-7_25","volume-title":"PRICAI 2010: trends in artificial intelligence. Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence","author":"L Wang","year":"2010","unstructured":"Wang L, Guo S, Chen S, Zhu W, Lim A (2010) Two natural heuristics for 3D packing with practical loading constraints. In: Zhang BT, Orgun MA (eds) PRICAI 2010: trends in artificial intelligence. Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence, vol 6230. Springer, Berlin, pp 256\u2013267. \n                    https:\/\/doi.org\/10.1007\/978-3-642-15246-7_25"},{"issue":"2","key":"506_CR78","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10951-008-0055-y","volume":"11","author":"NA Wassan","year":"2008","unstructured":"Wassan NA, Nagy G, Ahmadi S (2008) A heuristic method for the vehicle routing problem with mixed deliveries and pickups. J Sched 11(2):149\u2013161. \n                    https:\/\/doi.org\/10.1007\/s10951-008-0055-y","journal-title":"J Sched"},{"issue":"4","key":"506_CR79","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s10878-007-9090-4","volume":"15","author":"NA Wassan","year":"2008","unstructured":"Wassan NA, Wassan AH, Nagy G (2008) A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J Comb Optim 15(4):368\u2013386. \n                    https:\/\/doi.org\/10.1007\/s10878-007-9090-4","journal-title":"J Comb Optim"},{"issue":"4","key":"506_CR80","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 Mag 9(4):18\u201330. \n                    https:\/\/doi.org\/10.1109\/MCI.2014.2350933","journal-title":"IEEE Comput Intell Mag"},{"key":"506_CR81","unstructured":"Wisniewski MA, Ritt M, Buriol LS (2011) A tabu search algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. In: XLIII Simposio Brasilero de Pesquisa Operacional"},{"issue":"2","key":"506_CR82","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1016\/j.eswa.2007.11.005","volume":"36","author":"EE Zachariadis","year":"2009","unstructured":"Zachariadis EE, Tarantilis CD, Kiranoudis CT (2009) A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. Expert Syst Appl 36(2):1070\u20131081. \n                    https:\/\/doi.org\/10.1016\/j.eswa.2007.11.005","journal-title":"Expert Syst Appl"},{"issue":"2","key":"506_CR83","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2009.05.015","volume":"202","author":"EE Zachariadis","year":"2010","unstructured":"Zachariadis EE, Tarantilis CD, Kiranoudis CT (2010) An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries. Eur J Oper Res 202(2):401\u2013411. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2009.05.015","journal-title":"Eur J Oper Res"},{"issue":"2","key":"506_CR84","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ejor.2015.11.018","volume":"251","author":"EE Zachariadis","year":"2016","unstructured":"Zachariadis EE, Tarantilis CD, Kiranoudis CT (2016) The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints. Eur J Oper Res 251(2):369\u2013386. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2015.11.018","journal-title":"Eur J Oper Res"},{"issue":"10","key":"506_CR85","doi-asserted-by":"publisher","first-page":"2277","DOI":"10.1016\/j.cor.2011.11.021","volume":"39","author":"T Zhang","year":"2012","unstructured":"Zhang T, Chaovalitwongse WA, Zhang Y (2012) Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries. Comput Oper Res 39(10):2277\u20132290. \n                    https:\/\/doi.org\/10.1016\/j.cor.2011.11.021","journal-title":"Comput Oper Res"},{"issue":"1","key":"506_CR86","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/s10878-014-9741-1","volume":"28","author":"T Zhang","year":"2014","unstructured":"Zhang T, Chaovalitwongse WA, Zhang Y (2014) Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery. J Comb Optim 28(1):288\u2013309. \n                    https:\/\/doi.org\/10.1007\/s10878-014-9741-1","journal-title":"J Comb Optim"},{"key":"506_CR87","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.trb.2015.10.001","volume":"82","author":"Z Zhang","year":"2015","unstructured":"Zhang Z, Wei L, Lim A (2015) An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints. Transp Res Part B Methodol 82:20\u201335. \n                    https:\/\/doi.org\/10.1016\/j.trb.2015.10.001","journal-title":"Transp Res Part B Methodol"},{"issue":"9","key":"506_CR88","doi-asserted-by":"publisher","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. \n                    https:\/\/doi.org\/10.1016\/j.cor.2011.11.001","journal-title":"Comput Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-018-0506-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0506-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0506-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T21:37:19Z","timestamp":1548970639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-018-0506-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,1]]},"references-count":88,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["506"],"URL":"https:\/\/doi.org\/10.1007\/s00291-018-0506-6","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,1]]},"assertion":[{"value":"24 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}