{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T21:52:41Z","timestamp":1767909161494,"version":"3.49.0"},"reference-count":157,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T00:00:00Z","timestamp":1574121600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T00:00:00Z","timestamp":1574121600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["POCI-01-0145-FEDER-016733"],"award-info":[{"award-number":["POCI-01-0145-FEDER-016733"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["TOP"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s11750-019-00534-0","type":"journal-article","created":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T22:01:31Z","timestamp":1574200891000},"page":"358-401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["The vehicle routing problem with backhauls towards a sustainability perspective: a review"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8989-8157","authenticated-orcid":false,"given":"Maria Jo\u00e3o","family":"Santos","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Amorim","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Marques","sequence":"additional","affiliation":[]},{"given":"Ana","family":"Carvalho","sequence":"additional","affiliation":[]},{"given":"Ana","family":"P\u00f3voa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,19]]},"reference":[{"issue":"2","key":"534_CR1","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1287\/trsc.2014.0581","volume":"50","author":"Y Adulyasak","year":"2016","unstructured":"Adulyasak Y, Jaillet P (2016) Models and algorithms for stochastic and robust vehicle routing with deadlines. Transp Sci 50(2):608\u2013626. https:\/\/doi.org\/10.1287\/trsc.2014.0581","journal-title":"Transp Sci"},{"key":"534_CR2","doi-asserted-by":"publisher","unstructured":"Anbuudayasankar S, Ganesh K, Koh SL, Ducq Y (2012) Modified savings heuristics and genetic algorithm for bi-objective vehicle routing problem with forced backhauls. Expert Syst Appl 39(3):2296\u20132305. https:\/\/doi.org\/10.1016\/j.eswa.2011.08.009.\nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417411011201","DOI":"10.1016\/j.eswa.2011.08.009."},{"key":"534_CR3","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, Heidelberg, pp 249\u2013267"},{"key":"534_CR4","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1002\/(SICI)1520-6750(199604)43:3<415::AID-NAV7>3.0.CO;2-C","volume":"43","author":"S Anily","year":"1996","unstructured":"Anily S (1996) The vehicle-routing problem with delivery and back-haul options. Nav Res Logist 43:415\u2013434","journal-title":"Nav Res Logist"},{"key":"534_CR5","doi-asserted-by":"publisher","unstructured":"Ashtineh H, Pishvaee MS (2019) Alternative fuel vehicle-routing problem: a life cycle analysis of transportation fuels. J Clean Prod 219:166\u2013182. https:\/\/doi.org\/10.1016\/j.jclepro.2019.01.343. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0959652619303798","DOI":"10.1016\/j.jclepro.2019.01.343"},{"issue":"5","key":"534_CR6","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1111\/j.1475-3995.2010.00799.x","volume":"19","author":"JF Audy","year":"2012","unstructured":"Audy JF, Lehoux N, D\u2019Amours S, R\u00f6nnqvist M (2012) A framework for an efficient implementation of logistics collaborations. Int Trans Oper Res 19(5):633\u2013657. https:\/\/doi.org\/10.1111\/j.1475-3995.2010.00799.x","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"534_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/PL00011424","volume":"90","author":"I Averbakh","year":"2001","unstructured":"Averbakh I (2001) On the complexity of a class of combinatorial optimization problems with uncertainty. Math Program 90(2):263\u2013272. https:\/\/doi.org\/10.1007\/PL00011424","journal-title":"Math Program"},{"issue":"1","key":"534_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.3141\/2224-07","volume":"2224","author":"E Bailey","year":"2011","unstructured":"Bailey E, Unnikrishnan A, Lin DY (2011) Models for minimizing backhaul costs through freight collaboration. Transp Res Rec J Transp Res Board 2224(1):51\u201360. https:\/\/doi.org\/10.3141\/2224-07","journal-title":"Transp Res Rec J Transp Res Board"},{"issue":"7","key":"534_CR9","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1057\/jors.2009.51","volume":"61","author":"R Baldacci","year":"2010","unstructured":"Baldacci R, Bartolini E, Laporte G (2010) Some applications of the generalized vehicle routing problem. J Oper Res Soc 61(7):1072\u20131077. https:\/\/doi.org\/10.1057\/jors.2009.51","journal-title":"J Oper Res Soc"},{"key":"534_CR10","doi-asserted-by":"publisher","unstructured":"Bekta\u015f T, Laporte G, (2011) The pollution-routing problem. Transp Res Part B Methodol 45(8):1232\u20131250. https:\/\/doi.org\/10.1016\/j.trb.2011.02.004. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S019126151100018X","DOI":"10.1016\/j.trb.2011.02.004"},{"key":"534_CR11","first-page":"15","volume":"7","author":"J Belloso","year":"2015","unstructured":"Belloso J, Juan AA, Faulin J, Serrano A (2015) Using multi-start biased randomization of heuristics to solve the vehicle routing problem with clustered backhauls. Lecture Notes Manag Sci 7:15\u201320","journal-title":"Lecture Notes Manag Sci"},{"issue":"1","key":"534_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1111\/itor.12379","volume":"26","author":"J Belloso","year":"2017","unstructured":"Belloso J, Juan AA, Faulin J (2017a) An iterative biased-randomized heuristic for the fleet size and mix vehicle-routing problem with backhauls. Int Trans Oper Res 26(1):289\u2013301. https:\/\/doi.org\/10.1111\/itor.12379","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"534_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/net.21734","volume":"69","author":"J Belloso","year":"2017","unstructured":"Belloso J, Juan AA, Martinez E, Faulin J (2017b) A biased-randomized metaheuristic for the vehicle routing problem with clustered and mixed backhauls. Networks 69(3):241\u2013255. https:\/\/doi.org\/10.1002\/net.21734","journal-title":"Networks"},{"issue":"4","key":"534_CR14","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s10845-012-0627-8","volume":"24","author":"F Belmecheri","year":"2013","unstructured":"Belmecheri F, Prins C, Yalaoui F, Amodeo L (2013) Particle swarm optimization algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls, and time windows. J Intell Manuf 24(4):775\u2013789. https:\/\/doi.org\/10.1007\/s10845-012-0627-8","journal-title":"J Intell Manuf"},{"issue":"4","key":"534_CR15","doi-asserted-by":"publisher","first-page":"18","DOI":"10.4018\/IJAMC.2016100102","volume":"7","author":"M Berghida","year":"2016","unstructured":"Berghida M, Boukra A (2016) Quantum inspired algorithm for a VRP with heterogeneous fleet mixed backhauls and time windows. Int J Appl Metaheuristic Comput 7(4):18\u201338. https:\/\/doi.org\/10.4018\/IJAMC.2016100102","journal-title":"Int J Appl Metaheuristic Comput"},{"key":"534_CR16","doi-asserted-by":"publisher","unstructured":"Bianchessi N, Righini G (2007) Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput Oper Res 34(2):578\u2013594. https:\/\/doi.org\/10.1016\/j.cor.2005.03.014. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054805001097(reverse Logistics)","DOI":"10.1016\/j.cor.2005.03.014"},{"key":"534_CR17","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.ejor.2014.12.001. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221714009837","DOI":"10.1016\/j.ejor.2014.12.001"},{"key":"534_CR18","doi-asserted-by":"publisher","unstructured":"Braekers K, Ramaekers K, Van Nieuwenhuyse I (2016) The vehicle routing problem: state of the art classification and review. Comput Ind Eng 99:300\u2013313. https:\/\/doi.org\/10.1016\/j.cie.2015.12.007. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835215004775","DOI":"10.1016\/j.cie.2015.12.007"},{"key":"534_CR19","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.ejor.2005.01.042. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221705001918","DOI":"10.1016\/j.ejor.2005.01.042"},{"issue":"2","key":"534_CR20","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s11750-015-0404-x","volume":"24","author":"J Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o J (2016) A deterministic iterated local search algorithm for the vehicle routing problem with backhauls. TOP 24(2):445\u2013465. https:\/\/doi.org\/10.1007\/s11750-015-0404-x","journal-title":"TOP"},{"key":"534_CR21","doi-asserted-by":"publisher","unstructured":"Bruglieri M, Mancini S, Pisacane O (2019) The green vehicle routing problem with capacitated alternative fuel stations. Comput Oper Res 112:104759. https:\/\/doi.org\/10.1016\/j.cor.2019.07.017. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054819301935","DOI":"10.1016\/j.cor.2019.07.017"},{"issue":"2","key":"534_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2666003","volume":"47","author":"J Caceres-Cruz","year":"2014","unstructured":"Caceres-Cruz J, Arias P, Guimarans D, Riera D, Juan AA (2014) Rich vehicle routing problem. ACM Comput Surv 47(2):1\u201328. https:\/\/doi.org\/10.1145\/2666003","journal-title":"ACM Comput Surv"},{"key":"534_CR23","first-page":"127","volume-title":"Vehicle routing: methods and studies","author":"DO Casco","year":"1988","unstructured":"Casco DO, Golden BL, Wasil EA (1988) Vehicle routing with backhauls: models, algorithms, and case studies. In: Golden B, Assad AA (eds) Vehicle routing: methods and studies, 16th edn. North-Holland, Amsterdam, pp 127\u2013147","edition":"16"},{"key":"534_CR24","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.eswa.2010.03.045. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417410002265","DOI":"10.1016\/j.eswa.2010.03.045"},{"key":"534_CR25","unstructured":"Catherine Early (2011) Delivering greener logistics. https:\/\/transform.iema.net\/article\/delivering-greener-logistics"},{"key":"534_CR26","doi-asserted-by":"publisher","unstructured":"Chardy M, Klopfenstein O (2012) Handling uncertainties in vehicle routing problems through data preprocessing. Transp Res Part E Logist Transp Rev 48(3):667\u2013683. https:\/\/doi.org\/10.1016\/j.tre.2011.12.001. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1366554511001438","DOI":"10.1016\/j.tre.2011.12.001"},{"key":"534_CR27","doi-asserted-by":"publisher","unstructured":"Ch\u00e1vez JJS, Escobar JW, Echeverri MG (2016) A multi-objective pareto ant colony algorithm for the multi-depot vehicle routing problem with backhauls. Int J Ind Eng Comput 7(1):35\u201348. https:\/\/doi.org\/10.5267\/j.ijiec.2015.8.003. http:\/\/www.growingscience.com\/ijiec\/Vol7\/IJIEC_2015_31.pdf","DOI":"10.5267\/j.ijiec.2015.8.003"},{"issue":"5","key":"534_CR28","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1057\/palgrave.jors.2602028","volume":"57","author":"JF Chen","year":"2006","unstructured":"Chen JF, Wu TH (2006) Vehicle routing problem with simultaneous deliveries and pickups. J Oper Res Soc 57(5):579\u2013587. https:\/\/doi.org\/10.1057\/palgrave.jors.2602028","journal-title":"J Oper Res Soc"},{"key":"534_CR29","doi-asserted-by":"publisher","unstructured":"Chen L, Gendreau M, H\u00e0 MH, Langevin A (2016) A robust optimization approach for the road network daily maintenance routing problem with uncertain service time. Transp Res Part E Logist Transp Rev 85:40\u201351. https:\/\/doi.org\/10.1016\/j.tre.2015.11.006. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1366554515002094","DOI":"10.1016\/j.tre.2015.11.006"},{"issue":"3","key":"534_CR30","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1080\/07408170304371","volume":"35","author":"RK Cheung","year":"2003","unstructured":"Cheung RK, Hang DD (2003) Multi-attribute label matching algorithms for vehicle routing problems with time windows and backhauls. IIE Trans 35(3):191\u2013205. https:\/\/doi.org\/10.1080\/07408170304371","journal-title":"IIE Trans"},{"key":"534_CR31","first-page":"3022","volume":"6","author":"YJ Cho","year":"2005","unstructured":"Cho YJ, Wang SD (2005) A threshold accepting meta-heuristic for the vehicle routing problem with backhauls and time windows. J East Asia Soc Transp Stud 6:3022\u20133037","journal-title":"J East Asia Soc Transp Stud"},{"issue":"4","key":"534_CR32","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. https:\/\/doi.org\/10.1287\/opre.12.4.568","journal-title":"Oper Res"},{"key":"534_CR33","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:1296\u20131302. https:\/\/doi.org\/10.1057\/palgrave.jors.2601935","journal-title":"J Oper Res Soc"},{"key":"534_CR34","doi-asserted-by":"publisher","unstructured":"Cuervo DP, Goos P, S\u00f6rensen K, Arr\u00e1iz E (2014) An iterated local search algorithm for the vehicle routing problem with backhauls. Eur J Oper Res 237(2):454\u2013464. https:\/\/doi.org\/10.1016\/j.ejor.2014.02.011. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722171400126X","DOI":"10.1016\/j.ejor.2014.02.011"},{"key":"534_CR35","doi-asserted-by":"publisher","unstructured":"Davis LB, Sengul I, Ivy JS, Brock LG, Miles L (2014) Scheduling food bank collections and deliveries to ensure food safety and improve access. Socio Econ Plan Sci 48(3):175\u2013188. https:\/\/doi.org\/10.1016\/j.seps.2014.04.001. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0038012114000172","DOI":"10.1016\/j.seps.2014.04.001"},{"key":"534_CR36","unstructured":"Deif I, Bodin L (1984) Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling. In: Kidder A (ed) Proceedings of the Babson College conference on software uses in transportation and logistic management, Babson Park, MA, pp 75\u201396"},{"issue":"2","key":"534_CR37","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. https:\/\/doi.org\/10.1287\/trsc.1050.0118","journal-title":"Transp Sci"},{"key":"534_CR38","doi-asserted-by":"publisher","unstructured":"Demir E, Bekta\u015f T, Laporte G (2014) The bi-objective pollution-routing problem. Eur J Oper Res 232(3):464\u2013478. https:\/\/doi.org\/10.1016\/j.ejor.2013.08.002. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221713006486","DOI":"10.1016\/j.ejor.2013.08.002"},{"key":"534_CR39","doi-asserted-by":"publisher","unstructured":"Demir E, Huang Y, Scholts S, Van Woensel T (2015) A selected review on the negative externalities of the freight transportation: modeling and pricing. Transp Res Part E Logist Transp Rev 77:95\u2013114. https:\/\/doi.org\/10.1016\/j.tre.2015.02.020. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1366554515000605","DOI":"10.1016\/j.tre.2015.02.020"},{"issue":"2","key":"534_CR40","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF01720353","volume":"14","author":"U Derigs","year":"1992","unstructured":"Derigs U, Metz A (1992) A matching-based approach for solving a delivery\/pick-up vehicle routing problem with time constraints. Oper Res Spektrum 14(2):91\u2013106. https:\/\/doi.org\/10.1007\/BF01720353","journal-title":"Oper Res Spektrum"},{"issue":"1","key":"534_CR41","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. https:\/\/doi.org\/10.1007\/PL00013346","journal-title":"OR Spektrum"},{"issue":"1","key":"534_CR42","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1057\/palgrave.jors.2601263","volume":"53","author":"J Dethloff","year":"2002","unstructured":"Dethloff J (2002) Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls. J Oper Res Soc 53(1):115\u2013118. https:\/\/doi.org\/10.1057\/palgrave.jors.2601263","journal-title":"J Oper Res Soc"},{"key":"534_CR43","doi-asserted-by":"publisher","unstructured":"Dominguez O, Guimarans D, Juan AA, de la Nuez I (2016) A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls. Eur J Oper Res 255(2):442\u2013462. https:\/\/doi.org\/10.1016\/j.ejor.2016.05.002. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417415001682\nhttps:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221716303046","DOI":"10.1016\/j.ejor.2016.05.002"},{"issue":"1","key":"534_CR44","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G Dueck","year":"1990","unstructured":"Dueck G, Scheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90(1):161\u2013175. https:\/\/doi.org\/10.1016\/0021-9991(90)90201-B","journal-title":"J Comput Phys"},{"issue":"1","key":"534_CR45","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1287\/trsc.31.1.49","volume":"31","author":"C Duhamel","year":"1997","unstructured":"Duhamel C, Potvin JY, Rousseau JM (1997) A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transp Sci 31(1):49\u201359. https:\/\/doi.org\/10.1287\/trsc.31.1.49","journal-title":"Transp Sci"},{"key":"534_CR46","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-32081-1_10","volume-title":"Environmental issues in vehicle routing problems","author":"I Eguia","year":"2013","unstructured":"Eguia I, Racero J, Molina JC, Guerrero F (2013) Environmental issues in vehicle routing problems. Springer, Berlin, pp 215\u2013241. https:\/\/doi.org\/10.1007\/978-3-642-32081-1_10"},{"key":"534_CR47","doi-asserted-by":"publisher","unstructured":"Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57(4):1472\u20131483. https:\/\/doi.org\/10.1016\/j.cie.2009.05.009. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835209001405. arXiv:1011.1669v3","DOI":"10.1016\/j.cie.2009.05.009"},{"key":"534_CR48","doi-asserted-by":"publisher","unstructured":"Erdo\u011fan S, Miller-Hooks E (2012) A green vehicle routing problem. Transp Res Part E Logist Transp Rev 48(1):100\u2013114. https:\/\/doi.org\/10.1016\/j.tre.2011.08.001. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1366554511001062","DOI":"10.1016\/j.tre.2011.08.001"},{"key":"534_CR49","doi-asserted-by":"publisher","unstructured":"Evangelista P, Colicchia C, Creazza A (2017) Is environmental sustainability a strategic priority for logistics service providers? J Environ Manag 198:353\u2013362. https:\/\/doi.org\/10.1016\/j.jenvman.2017.04.096. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0301479717304541","DOI":"10.1016\/j.jenvman.2017.04.096"},{"issue":"1","key":"534_CR50","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01585701","volume":"53","author":"M Fischetti","year":"1992","unstructured":"Fischetti M, Toth P (1992) An additive bounding procedure for the asymmetric travelling salesman problem. Math Program 53(1):173\u2013197. https:\/\/doi.org\/10.1007\/BF01585701","journal-title":"Math Program"},{"issue":"2","key":"534_CR51","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"ML Fisher","year":"1981","unstructured":"Fisher ML, Jaikumar R (1981) A generalized assignment heuristic for vehicle routing. Networks 11(2):109\u2013124. https:\/\/doi.org\/10.1002\/net.3230110205","journal-title":"Networks"},{"key":"534_CR52","doi-asserted-by":"publisher","unstructured":"Gajpal Y, Abad P (2009) Multi-ant colony system (MACS) for a vehicle routing problem with backhauls. Eur J Oper Res 196(1):102\u2013117. https:\/\/doi.org\/10.1016\/j.ejor.2008.02.025. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221708002300","DOI":"10.1016\/j.ejor.2008.02.025"},{"key":"534_CR53","doi-asserted-by":"publisher","unstructured":"Ganesh K, Narendran T (2007) CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up. Eur J Oper Res 178(3):699\u2013717. https:\/\/doi.org\/10.1016\/j.ejor.2006.01.037. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221706001214","DOI":"10.1016\/j.ejor.2006.01.037"},{"key":"534_CR54","doi-asserted-by":"publisher","unstructured":"Gansterer M, Hartl RF (2018) Collaborative vehicle routing: a survey. Eur J Oper Res 268(1):1\u201312. https:\/\/doi.org\/10.1016\/j.ejor.2017.10.023. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221717309360. arXiv:1706.05254","DOI":"10.1016\/j.ejor.2017.10.023"},{"key":"534_CR55","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.cie.2014.12.029. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835214004586","DOI":"10.1016\/j.cie.2014.12.029"},{"issue":"1","key":"534_CR56","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. https:\/\/doi.org\/10.1007\/BF02098283","journal-title":"Ann Oper Res"},{"issue":"2","key":"534_CR57","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0360-8352(02)00179-1","volume":"44","author":"H Ghaziri","year":"2003","unstructured":"Ghaziri H, Osman IH (2003) A neural network algorithm for the traveling salesman problem with backhauls. Comput Ind Eng 44(2):267\u2013281. https:\/\/doi.org\/10.1016\/S0360-8352(02)00179-1","journal-title":"Comput Ind Eng"},{"issue":"2","key":"534_CR58","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10951-006-6774-z","volume":"9","author":"H Ghaziri","year":"2006","unstructured":"Ghaziri H, Osman IH (2006) Self-organizing feature maps for the vehicle routing problem with backhauls. J Sched 9(2):97\u2013114. https:\/\/doi.org\/10.1007\/s10951-006-6774-z","journal-title":"J Sched"},{"issue":"1","key":"534_CR59","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. https:\/\/doi.org\/10.1016\/0377-2217(89)90057-X","journal-title":"Eur J Oper Res"},{"key":"534_CR60","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The vehicle routing problem: latest advances and new challenges. Operations research\/computer science interfaces series","author":"BL Golden","year":"2008","unstructured":"Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges. Operations research\/computer science interfaces series, vol 43. Springer, New York"},{"key":"534_CR61","doi-asserted-by":"publisher","unstructured":"Granada-Echeverri M, Toro EM, Santa JJ (2019) A mixed integer linear programming formulation for the vehicle routing problem with backhauls. Int J Ind Eng Comput 10:295\u2013308. https:\/\/doi.org\/10.5267\/j.ijiec.2018.6.003. http:\/\/www.growingscience.com\/ijiec\/Vol10\/IJIEC_2018_12.pdf","DOI":"10.5267\/j.ijiec.2018.6.003"},{"key":"534_CR62","unstructured":"Gribkovskaia I, Halskau Myklebost K (2001) Models for pick-up and deliveries from depots with lasso solutions. In: Stefansson G, Tilanus B (eds) Proceedings of the 13th annual conference on logistics research NOFOMA 2001, Chalmers University of Technology, G\u00f6teborg, pp 279\u2013293"},{"key":"534_CR63","doi-asserted-by":"publisher","unstructured":"Gribkovskaia I, Laporte G, Shyshou A (2008) The single vehicle routing problem with deliveries and selective pickups. Comput Oper Res 35(9):2908\u20132924. https:\/\/doi.org\/10.1016\/j.cor.2007.01.007. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054807000111","DOI":"10.1016\/j.cor.2007.01.007"},{"key":"534_CR64","doi-asserted-by":"publisher","unstructured":"Grossmann IE, Apap RM, Calfa BA, Garc\u00eda-Herreros P, Zhang Q (2016) Recent advances in mathematical programming techniques for the optimization of process systems under uncertainty. Comput Chem Eng 91:3\u201314. https:\/\/doi.org\/10.1016\/j.compchemeng.2016.03.002. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0098135416300540","DOI":"10.1016\/j.compchemeng.2016.03.002"},{"key":"534_CR65","doi-asserted-by":"publisher","unstructured":"Guti\u00e9rrez-Jarpa G, Desaulniers G, Laporte G, Marianov V (2010) A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows. Eur J Oper Res 206(2):341\u2013349. https:\/\/doi.org\/10.1016\/j.ejor.2010.02.037. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221710001700","DOI":"10.1016\/j.ejor.2010.02.037"},{"issue":"3","key":"534_CR66","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1287\/trsc.2013.0476","volume":"48","author":"J Han","year":"2014","unstructured":"Han J, Lee C, Park S (2014) A robust scenario approach for the vehicle routing problem with uncertain travel times. Transp Sci 48(3):373\u2013390. https:\/\/doi.org\/10.1287\/trsc.2013.0476","journal-title":"Transp Sci"},{"issue":"2","key":"534_CR67","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0377-2217(02)00823-8","volume":"151","author":"A Hertz","year":"2003","unstructured":"Hertz A, Widmer M (2003) Guidelines for the use of meta-heuristics in combinatorial optimization. Eur J Oper Res 151(2):247\u2013252. https:\/\/doi.org\/10.1016\/S0377-2217(02)00823-8","journal-title":"Eur J Oper Res"},{"key":"534_CR68","doi-asserted-by":"publisher","unstructured":"Hoff A, Gribkovskaia I, Laporte G, L\u00f8kketangen A (2009) Lasso solution strategies for the vehicle routing problem with pickups and deliveries. Eur J Oper Res 192(3):755\u2013766. https:\/\/doi.org\/10.1016\/j.ejor.2007.10.021. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221707010235","DOI":"10.1016\/j.ejor.2007.10.021"},{"key":"534_CR69","doi-asserted-by":"publisher","unstructured":"Juan AA, Faulin J, P\u00e9rez-Bernabeu E, Jozefowiez N (2014) Horizontal cooperation in vehicle routing problems with backhauling and environmental criteria. Proced Soc Behav Sci 111:1133\u20131141. https:\/\/doi.org\/10.1016\/j.sbspro.2014.01.148. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877042814001499","DOI":"10.1016\/j.sbspro.2014.01.148"},{"key":"534_CR70","doi-asserted-by":"publisher","unstructured":"Kara Kara BY, Yetis MK (2007) Energy minimizing vehicle routing problem. In: Combinatorial optimization and applications. Springer, Berlin, pp 62\u201371. https:\/\/doi.org\/10.1007\/978-3-540-73556-4_9. http:\/\/www.mendeley.com\/research\/lecture-notes-computer-science-2\/","DOI":"10.1007\/978-3-540-73556-4_9"},{"key":"534_CR71","doi-asserted-by":"publisher","unstructured":"Katoh N, Yano T (2006) An approximation algorithm for the pickup and delivery vehicle routing problem on trees. Discrete Appl Math 154(16):2335\u20132349. https:\/\/doi.org\/10.1016\/j.dam.2006.04.028. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X06001892(discrete Algorithms and Optimization, in Honor of Professor Toshihide Ibaraki at His Retirement from Kyoto University)","DOI":"10.1016\/j.dam.2006.04.028"},{"key":"534_CR72","doi-asserted-by":"publisher","unstructured":"Ko\u00e7 \u00c7, Laporte G (2018) Vehicle routing with backhauls: review and research perspectives. Comput Oper Res 91:79\u201391. https:\/\/doi.org\/10.1016\/j.cor.2017.11.003. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054817302794","DOI":"10.1016\/j.cor.2017.11.003"},{"issue":"1","key":"534_CR73","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","volume":"7","author":"G Kontoravdis","year":"1995","unstructured":"Kontoravdis G, Bard JF (1995) A grasp for the vehicle routing problem with time windows. ORSA J Comput 7(1):10\u201323. https:\/\/doi.org\/10.1287\/ijoc.7.1.10","journal-title":"ORSA J Comput"},{"issue":"8","key":"534_CR74","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1002\/atr.1237","volume":"48","author":"N K\u00fc\u00e7\u00fcko\u011flu \u00d6zt\u00fcrk","year":"2014","unstructured":"K\u00fc\u00e7\u00fcko\u011flu \u00d6zt\u00fcrk N (2014) A differential evolution approach for the vehicle routing problem with backhauls and time windows. J Adv Transp 48(8):942\u2013956. https:\/\/doi.org\/10.1002\/atr.1237","journal-title":"J Adv Transp"},{"key":"534_CR75","doi-asserted-by":"publisher","unstructured":"K\u00fc\u00e7\u00fcko\u011flu, \u00d6zt\u00fcrk N (2015) An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows. Comput Ind Eng 86:60\u201368. https:\/\/doi.org\/10.1016\/j.cie.2014.10.014. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835214003453","DOI":"10.1016\/j.cie.2014.10.014"},{"issue":"1","key":"534_CR76","doi-asserted-by":"publisher","first-page":"92","DOI":"10.3141\/2263-11","volume":"2263","author":"R Kumar","year":"2011","unstructured":"Kumar R, Unnikrishnan A, Waller ST (2011) Capacitated-vehicle routing problem with backhauls on trees. Transp Res Rec J Transp Res Board 2263(1):92\u2013102. https:\/\/doi.org\/10.3141\/2263-11","journal-title":"Transp Res Rec J Transp Res Board"},{"issue":"4","key":"534_CR77","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1287\/opre.39.4.616","volume":"39","author":"M Labb\u00e9","year":"1991","unstructured":"Labb\u00e9 M, Laporte G, Mercure H (1991) Capacitated vehicle routing on trees. Oper Res 39(4):616\u2013622. https:\/\/doi.org\/10.1287\/opre.39.4.616","journal-title":"Oper Res"},{"key":"534_CR78","doi-asserted-by":"publisher","unstructured":"Lai M, Crainic TG, Di Francesco M, Zuddas P (2013) An heuristic search for the routing of heterogeneous trucks with single and double container loads. Transp Res Part E Logist Transp Rev 56:108\u2013118. https:\/\/doi.org\/10.1016\/j.tre.2013.06.001. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1366554513001154","DOI":"10.1016\/j.tre.2013.06.001"},{"issue":"7","key":"534_CR79","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1057\/jors.2014.123","volume":"66","author":"M Lai","year":"2015","unstructured":"Lai M, Battarra M, Di Francesco M, Zuddas P (2015) An adaptive guidance meta-heuristic for the vehicle routing problem with splits and clustered backhauls. J Oper Res Soc 66(7):1222\u20131235. https:\/\/doi.org\/10.1057\/jors.2014.123","journal-title":"J Oper Res Soc"},{"issue":"9","key":"534_CR80","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1057\/jors.2011.136","volume":"63","author":"C Lee","year":"2012","unstructured":"Lee C, Lee K, Park S (2012) Robust vehicle routing problem with deadlines and travel time\/demand uncertainty. J Oper Res Soc 63(9):1294\u20131306. https:\/\/doi.org\/10.1057\/jors.2011.136","journal-title":"J Oper Res Soc"},{"key":"534_CR81","doi-asserted-by":"publisher","unstructured":"Li X, Tian P, Leung SC (2010) Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int J Prod Econ 125(1):137\u2013145. https:\/\/doi.org\/10.1016\/j.ijpe.2010.01.013. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S092552731000023X","DOI":"10.1016\/j.ijpe.2010.01.013"},{"key":"534_CR82","doi-asserted-by":"publisher","unstructured":"Lin C, Choy K, Ho G, Chung S, Lam H (2014) Survey of green vehicle routing problem: past and future trends. Expert Syst Appl 41(4):1118\u20131138. https:\/\/doi.org\/10.1016\/j.eswa.2013.07.107. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S095741741300609X","DOI":"10.1016\/j.eswa.2013.07.107"},{"key":"534_CR83","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.trc.2017.01.005","volume":"76","author":"S Lin","year":"2017","unstructured":"Lin S, Bard JF, Jarrah AI, Zhang X, Novoa LJ (2017) Route design for last-in, first-out deliveries with backhauling. Transp Res Part C Emerg Technol 76:90\u2013117. https:\/\/doi.org\/10.1016\/j.trc.2017.01.005","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"1","key":"534_CR84","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10845-008-0101-9","volume":"20","author":"SC Liu","year":"2009","unstructured":"Liu SC, Chung CH (2009) A heuristic method for the vehicle routing problem with backhauls and inventory. J Intell Manuf 20(1):29\u201342. https:\/\/doi.org\/10.1007\/s10845-008-0101-9","journal-title":"J Intell Manuf"},{"key":"534_CR85","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.eswa.2018.10.031","volume":"118","author":"EHC Lu","year":"2019","unstructured":"Lu EHC, Yang YW (2019) A hybrid route planning approach for logistics with pickup and delivery. Expert Syst Appl 118:482\u2013492. https:\/\/doi.org\/10.1016\/j.eswa.2018.10.031","journal-title":"Expert Syst Appl"},{"key":"534_CR86","doi-asserted-by":"publisher","unstructured":"Mancini S (2016) A real-life multi depot multi period vehicle routing problem with a heterogeneous fleet: formulation and adaptive large neighborhood search based matheuristic. Transp Res Part C Emerg Technol 70:100\u2013112. https:\/\/doi.org\/10.1016\/j.trc.2015.06.016. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0968090X15002314","DOI":"10.1016\/j.trc.2015.06.016"},{"issue":"5","key":"534_CR87","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. https:\/\/doi.org\/10.1016\/0191-2607(89)90085-X","journal-title":"Transp Res Part A Gen"},{"issue":"3","key":"534_CR88","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1287\/trsc.33.3.315","volume":"33","author":"A Mingozzi","year":"1999","unstructured":"Mingozzi A, Giorgi S, Baldacci R (1999) An exact method for the vehicle routing problem with backhauls. Transp Sci 33(3):315\u2013329. https:\/\/doi.org\/10.1287\/trsc.33.3.315","journal-title":"Transp Sci"},{"key":"534_CR89","doi-asserted-by":"publisher","unstructured":"Montan\u00e9 FAT, 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. https:\/\/doi.org\/10.1016\/j.cor.2004.07.009. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054804001741","DOI":"10.1016\/j.cor.2004.07.009"},{"issue":"2","key":"534_CR90","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0377-2217(94)90360-3","volume":"79","author":"G Mosheiov","year":"1994","unstructured":"Mosheiov G (1994) The travelling salesman problem with pick-up and delivery. Eur J Oper Res 79(2):299\u2013310. https:\/\/doi.org\/10.1016\/0377-2217(94)90360-3","journal-title":"Eur J Oper Res"},{"issue":"3","key":"534_CR91","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/S0360-8352(97)00275-1","volume":"34","author":"G Mosheiov","year":"1998","unstructured":"Mosheiov G (1998) Vehicle routing with pick-up and delivery: tour-partitioning heuristics. Comput Ind Eng 34(3):669\u2013684. https:\/\/doi.org\/10.1016\/S0360-8352(97)00275-1","journal-title":"Comput Ind Eng"},{"key":"534_CR92","doi-asserted-by":"publisher","unstructured":"Naderipour M, Alinaghian M (2016) Measurement, evaluation and minimization of CO2, NOx, and CO emissions in the open time dependent vehicle routing problem. Measurement 90:443\u2013452. https:\/\/doi.org\/10.1016\/j.measurement.2016.04.043. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0263224116301105","DOI":"10.1016\/j.measurement.2016.04.043"},{"key":"534_CR93","doi-asserted-by":"publisher","unstructured":"Nagy G, Salhi S (2005) Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur J Oper Res 162(1):126\u2013141. https:\/\/doi.org\/10.1016\/j.ejor.2002.11.003. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221703008361(logistics: From Theory to Application)","DOI":"10.1016\/j.ejor.2002.11.003"},{"issue":"2","key":"534_CR94","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1287\/trsc.2013.0501","volume":"49","author":"G Nagy","year":"2013","unstructured":"Nagy G, Wassan NA, Speranza MG, Archetti C (2013) The vehicle routing problem with divisible deliveries and pickups. Transp Sci 49(2):271\u2013294. https:\/\/doi.org\/10.1287\/trsc.2013.0501","journal-title":"Transp Sci"},{"issue":"2","key":"534_CR95","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/s10479-015-2001-7","volume":"253","author":"PK Nguyen","year":"2016","unstructured":"Nguyen PK, Crainic TG, Toulouse M (2016) Multi-trip pickup and delivery problem with time windows and synchronization. Ann Oper Res 253(2):899\u2013934. https:\/\/doi.org\/10.1007\/s10479-015-2001-7","journal-title":"Ann Oper Res"},{"key":"534_CR96","doi-asserted-by":"publisher","unstructured":"Nikolakopoulos A (2015) A metaheuristic reconstruction algorithm for solving bi-level vehicle routing problems with backhauls for army rapid fielding. In: Zeimpekis V, Kaimakamis G, Daras NJ (eds) Military logistics. Operations research\/computer science interfaces series, vol\u00a056, Springer International Publishing, pp 141\u2013157. https:\/\/doi.org\/10.1007\/978-3-319-12075-1_8. http:\/\/link.springer.com\/10.1007\/978-3-319-12075-1","DOI":"10.1007\/978-3-319-12075-1_8"},{"issue":"4","key":"534_CR97","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1002\/bse.1769","volume":"23","author":"P Oberhofer","year":"2014","unstructured":"Oberhofer P, Dieplinger M (2014) Sustainability in the transport and logistics sector: lacking environmental measures. Bus Strategy Environ 23(4):236\u2013253. https:\/\/doi.org\/10.1002\/bse.1769","journal-title":"Bus Strategy Environ"},{"key":"534_CR98","doi-asserted-by":"publisher","unstructured":"Oesterle J, Bauernhansl T (2016) Exact method for the vehicle routing problem with mixed linehaul and backhaul customers, heterogeneous fleet, time window and manufacturing capacity. Proced CIRP 41:573\u2013578. https:\/\/doi.org\/10.1016\/j.procir.2015.12.040. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2212827115011191","DOI":"10.1016\/j.procir.2015.12.040"},{"issue":"4","key":"534_CR99","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. https:\/\/doi.org\/10.1002\/jos.122","journal-title":"J Sched"},{"key":"534_CR100","doi-asserted-by":"publisher","unstructured":"Paraphantakul C, Miller-Hooks E, Opasanon S (2012) Scheduling deliveries with backhauls in Thailand\u2019s cement industry. Transp Res Rec 2269(1):73\u201382. https:\/\/doi.org\/10.3141\/2269-09. arXiv:1011.1669v3","DOI":"10.3141\/2269-09"},{"issue":"1","key":"534_CR101","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 (2008a) A survey on pickup and delivery problems, part I: transportation between customers and depot. J Betriebswirtschaft 58(1):21\u201351. https:\/\/doi.org\/10.1007\/s11301-008-0033-7","journal-title":"J Betriebswirtschaft"},{"key":"534_CR102","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh SN, Doerner KF, Hartl RF (2008b) A survey on pickup and delivery problems, part II: transportation between pickup and delivery locations. J Betriebswirtschaft 58:81\u2013117. https:\/\/doi.org\/10.1007\/s11301-008-0036-4","journal-title":"J Betriebswirtschaft"},{"issue":"4","key":"534_CR103","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. https:\/\/doi.org\/10.1007\/BF00132738","journal-title":"Appl Intell"},{"key":"534_CR104","doi-asserted-by":"publisher","unstructured":"Pradenas L, Oportus B, Parada V (2013) Mitigation of greenhouse gas emissions in vehicle routing problems with backhauling. Expert Syst Appl 40(8):2985\u20132991. https:\/\/doi.org\/10.1016\/j.eswa.2012.12.014. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417412012559","DOI":"10.1016\/j.eswa.2012.12.014"},{"issue":"9","key":"534_CR105","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1057\/palgrave.jors.2602087","volume":"57","author":"J Priv\u00e9","year":"2006","unstructured":"Priv\u00e9 J, Renaud J, Boctor F, Laporte G (2006) Solving a vehicle-routing problem arising in soft-drink distribution. J Oper Res Soc 57(9):1045\u20131052. https:\/\/doi.org\/10.1057\/palgrave.jors.2602087","journal-title":"J Oper Res Soc"},{"key":"534_CR106","doi-asserted-by":"publisher","unstructured":"Rahimi M, Baboli A, Rekik Y (2016) Sustainable inventory routing problem for perishable products by considering reverse logistic. IFAC Pap Online 49(12):949\u2013954. https:\/\/doi.org\/10.1016\/j.ifacol.2016.07.898. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2405896316311843","DOI":"10.1016\/j.ifacol.2016.07.898"},{"key":"534_CR107","doi-asserted-by":"publisher","unstructured":"Ramos TRP, Gomes MI, Barbosa-P\u00f3voa AP (2014) Planning a sustainable reverse logistics system: balancing costs with environmental and social concerns. Omega 48:60\u201374. https:\/\/doi.org\/10.1016\/j.omega.2013.11.006. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305048313001175(NIHMS150003)","DOI":"10.1016\/j.omega.2013.11.006"},{"issue":"3","key":"534_CR108","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/j.ejor.2017.10.029","volume":"266","author":"S Reil","year":"2018","unstructured":"Reil S, Bortfeldt A, M\u00f6nch L (2018) Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints. Eur J Oper Res 266(3):877\u2013894. https:\/\/doi.org\/10.1016\/j.ejor.2017.10.029","journal-title":"Eur J Oper Res"},{"issue":"2","key":"534_CR109","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10100-006-0163-8","volume":"14","author":"M Reimann","year":"2006","unstructured":"Reimann M, Ulrich H (2006) Comparing backhauling strategies in vehicle routing using ant colony optimization. Cent Eur J Oper Res 14(2):105\u2013123. https:\/\/doi.org\/10.1007\/s10100-006-0163-8","journal-title":"Cent Eur J Oper Res"},{"key":"534_CR110","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45724-0_12","volume-title":"Ant Algorithms","author":"M 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. Springer, Heidelberg, pp 135\u2013148"},{"issue":"1","key":"534_CR111","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/00207543.2015.1043403","volume":"54","author":"U Ritzinger","year":"2016","unstructured":"Ritzinger U, Puchinger J, Hartl RF (2016) A survey on dynamic and stochastic vehicle routing problems. Int J Prod Res 54(1):215\u2013231. https:\/\/doi.org\/10.1080\/00207543.2015.1043403","journal-title":"Int J Prod Res"},{"key":"534_CR112","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.ejor.2004.09.004. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221704005831","DOI":"10.1016\/j.ejor.2004.09.004"},{"issue":"10","key":"534_CR113","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1057\/palgrave.jors.2600808","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\u20131042. https:\/\/doi.org\/10.1057\/palgrave.jors.2600808","journal-title":"J Oper Res Soc"},{"key":"534_CR114","doi-asserted-by":"publisher","unstructured":"Salhi S, Wassan N, Hajarat M (2013) The fleet size and mix vehicle routing problem with backhauls: formulation and set partitioning-based heuristics. Transp Res Part E Logist Transp Rev 56:22\u201335. https:\/\/doi.org\/10.1016\/j.tre.2013.05.005. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1366554513001142","DOI":"10.1016\/j.tre.2013.05.005"},{"issue":"4","key":"534_CR115","first-page":"206","volume":"4","author":"A Saremi","year":"2007","unstructured":"Saremi A, Elmekkawy TY, Wang GG (2007) Tuning the parameters of a memetic algorithm to solve vehicle routing problem with backhauls using design of experiments. Int J Oper Res 4(4):206\u2013219","journal-title":"Int J Oper Res"},{"key":"534_CR116","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-7908-1636-1_7","volume-title":"Conducting a literature review\u2013the example of sustainability in supply chains. Research methodologies in supply chain management","author":"S Seuring","year":"2005","unstructured":"Seuring S, M\u00fcller M, Westhaus M, Morana R (2005) Conducting a literature review\u2013the example of sustainability in supply chains. Research methodologies in supply chain management. Physica-Verlag, Heidelberg, pp 91\u2013106. https:\/\/doi.org\/10.1007\/3-7908-1636-1_7"},{"key":"534_CR117","doi-asserted-by":"crossref","unstructured":"Shapley LS (1953) A value for n-person games. Ann Math Stud 28:307\u2013318. https:\/\/www.cambridge.org\/core\/product\/identifier\/CBO9780511528446A008\/type\/book_part","DOI":"10.1515\/9781400881970-018"},{"key":"534_CR118","unstructured":"Smith DS (2017) Tesco food waste case study. https:\/\/www.dssmith.com\/recycling\/insights\/case-studies\/tesco-food-waste-case-study"},{"key":"534_CR119","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-46004-7_16","volume-title":"Applications of evolutionary computing","author":"D Sofge","year":"2002","unstructured":"Sofge D, Schultz A, De Jong K (2002) Evolutionary computational approaches to solving the multiple traveling salesman problem using a neighborhood attractor schema. In: Cagnoni S, Gottlieb J, Hart E, Middendorf M, Raidl GR (eds) Applications of evolutionary computing, vol 2279. Springer, Berlin, pp 153\u2013162"},{"key":"534_CR120","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.jclepro.2017.10.124","volume":"172","author":"H Soleimani","year":"2018","unstructured":"Soleimani H, Chaharlang Y, Ghaderi H (2018) Collection and distribution of returned-remanufactured products in a vehicle routing problem with pickup and delivery considering sustainable and green criteria. J Clean Prod 172:960\u2013970. https:\/\/doi.org\/10.1016\/j.jclepro.2017.10.124","journal-title":"J Clean Prod"},{"issue":"2","key":"534_CR121","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"},{"key":"534_CR122","doi-asserted-by":"publisher","unstructured":"Subramanian A, Drummond L, Bentes C, Ochi L, Farias R (2010) A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 37(11):1899\u20131911. https:\/\/doi.org\/10.1016\/j.cor.2009.10.011. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054809002779(metaheuristics for Logistics and Vehicle Routing)","DOI":"10.1016\/j.cor.2009.10.011"},{"key":"534_CR123","doi-asserted-by":"publisher","unstructured":"Subramanian A, Uchoa E, Pessoa AA, Ochi LS (2011) Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Oper Res Lett 39(5):338\u2013341. https:\/\/doi.org\/10.1016\/j.orl.2011.06.012. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167637711000666","DOI":"10.1016\/j.orl.2011.06.012"},{"issue":"7","key":"534_CR124","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1007\/s11590-012-0570-9","volume":"7","author":"A Subramanian","year":"2012","unstructured":"Subramanian A, Uchoa E, Pessoa AA, Ochi LS (2012) Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery. Optim Lett 7(7):1569\u20131581. https:\/\/doi.org\/10.1007\/s11590-012-0570-9","journal-title":"Optim Lett"},{"key":"534_CR125","doi-asserted-by":"publisher","unstructured":"Subramanian A, Uchoa E, Ochi LS (2013) A hybrid algorithm for a class of vehicle routing problems. Comput Oper Res 40(10):2519\u20132531. https:\/\/doi.org\/10.1016\/j.cor.2013.01.013. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S030505481300021X","DOI":"10.1016\/j.cor.2013.01.013"},{"issue":"3","key":"534_CR126","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1002\/net.10067","volume":"41","author":"H S\u00fcral","year":"2003","unstructured":"S\u00fcral H, Bookbinder JH (2003) The single-vehicle routing problem with unrestricted backhauls. Networks 41(3):127\u2013136. https:\/\/doi.org\/10.1002\/net.10067","journal-title":"Networks"},{"issue":"3","key":"534_CR127","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1287\/trsc.1120.0439","volume":"47","author":"CD Tarantilis","year":"2013","unstructured":"Tarantilis CD, Anagnostopoulou AK, Repoussis PP (2013) Adaptive path relinking for vehicle routing and scheduling problems with product returns. Transp Sci 47(3):356\u2013379. https:\/\/doi.org\/10.1287\/trsc.1120.0439","journal-title":"Transp Sci"},{"key":"534_CR128","doi-asserted-by":"publisher","unstructured":"Tavakkoli-Moghaddam R, Saremi A, Ziaee M (2006) A memetic algorithm for a vehicle routing problem with backhauls. Appl Math Comput 181(2):1049\u20131060. https:\/\/doi.org\/10.1016\/j.amc.2006.01.059. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300306001883","DOI":"10.1016\/j.amc.2006.01.059"},{"issue":"11","key":"534_CR129","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1016\/0305-0548(96)00018-4","volume":"23","author":"SR Thangiah","year":"1996","unstructured":"Thangiah SR, Potvin JY, Sun T (1996) Heuristic approaches to vehicle routing with backhauls and time windows. Comput Oper Res 23(11):1043\u20131057. https:\/\/doi.org\/10.1016\/0305-0548(96)00018-4","journal-title":"Comput Oper Res"},{"key":"534_CR130","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, Heidelberg, pp 585\u2013608"},{"issue":"4","key":"534_CR131","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. https:\/\/doi.org\/10.1287\/trsc.31.4.372","journal-title":"Transp Sci"},{"issue":"3","key":"534_CR132","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(98)00086-1","volume":"113","author":"P Toth","year":"1999","unstructured":"Toth P, Vigo D (1999) A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. Eur J Oper Res 113(3):528\u2013543. https:\/\/doi.org\/10.1016\/S0377-2217(98)00086-1","journal-title":"Eur J Oper Res"},{"key":"534_CR133","doi-asserted-by":"publisher","unstructured":"Toth P, Vigo D (2002a) 8. VRP with backhauls. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM, Philadelphia, vol\u00a09, pp 195\u2013224. https:\/\/doi.org\/10.1137\/1.9780898718515.ch8","DOI":"10.1137\/1.9780898718515.ch8"},{"key":"534_CR134","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2002b) The vehicle routing problem. SIAM monographs on discrete mathematics and applications, Philadelphia: Society for Industrial and Applied Mathematics, DOI 10(1137\/1):9780898718515","DOI":"10.1137\/1.9780898718515"},{"key":"534_CR135","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (eds) (2014) Vehicle routing: problems, methods, and applications, 2nd edition. No.\u00a018 in MOS-SIAM Series on Optimization, SIAM, Philadelphia","DOI":"10.1137\/1.9781611973594"},{"key":"534_CR136","doi-asserted-by":"publisher","unstructured":"Turkensteen M, Hasle G (2017) Combining pickups and deliveries in vehicle routing\u2014an assessment of carbon emission effects. Transp Res Part C Emerg Technol 80:117\u2013132. https:\/\/doi.org\/10.1016\/j.trc.2017.04.006. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0968090X17301122","DOI":"10.1016\/j.trc.2017.04.006"},{"key":"534_CR137","doi-asserted-by":"publisher","unstructured":"T\u00fct\u00fcnc\u00fc GY (2010) An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls. Eur J Oper Res 201(2):593\u2013600. https:\/\/doi.org\/10.1016\/j.ejor.2009.03.044. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221709001957","DOI":"10.1016\/j.ejor.2009.03.044"},{"key":"534_CR138","doi-asserted-by":"publisher","unstructured":"T\u00fct\u00fcnc\u00fc GY, Carreto C, Baker B (2009) A visual interactive approach to classical and mixed vehicle routing problems with backhauls. Omega 37(1):138\u2013154. https:\/\/doi.org\/10.1016\/j.omega.2006.11.001. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305048306001356","DOI":"10.1016\/j.omega.2006.11.001"},{"key":"534_CR139","doi-asserted-by":"publisher","unstructured":"Ubeda S, Arcelus F, Faulin J (2011) Green logistics at Eroski: a case study. Int J Prod Econ 131(1):44\u201351. https:\/\/doi.org\/10.1016\/j.ijpe.2010.04.041. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S092552731000174X","DOI":"10.1016\/j.ijpe.2010.04.041"},{"key":"534_CR140","doi-asserted-by":"publisher","unstructured":"Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur J Oper Res 234(3):658\u2013673. https:\/\/doi.org\/10.1016\/j.ejor.2013.09.045. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722171300800X","DOI":"10.1016\/j.ejor.2013.09.045"},{"key":"534_CR141","doi-asserted-by":"publisher","unstructured":"Wade A, Salhi S (2002) An investigation into a new class of vehicle routing problem with backhauls. Omega 30(6):479\u2013487. https:\/\/doi.org\/10.1016\/S0305-0483(02)00056-7. http:\/\/kar.kent.ac.uk\/5274\/","DOI":"10.1016\/S0305-0483(02)00056-7"},{"key":"534_CR142","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-1-4757-4137-7_33","volume-title":"An ant system algorithm for the mixed vehicle routing problem with backhauls","author":"A Wade","year":"2004","unstructured":"Wade A, Salhi S (2004) An ant system algorithm for the mixed vehicle routing problem with backhauls. Springer, Boston, pp 699\u2013719. https:\/\/doi.org\/10.1007\/978-1-4757-4137-7_33"},{"key":"534_CR143","doi-asserted-by":"publisher","unstructured":"Wang Z, Wang Z (2009) A novel two-phase heuristic method for vehicle routing problem with backhauls. Comput Math Appl 57(11\u201312):1923\u20131928. https:\/\/doi.org\/10.1016\/j.camwa.2008.10.045. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0898122108005312","DOI":"10.1016\/j.camwa.2008.10.045"},{"issue":"12","key":"534_CR144","doi-asserted-by":"publisher","first-page":"1630","DOI":"10.1057\/palgrave.jors.2602313","volume":"58","author":"N Wassan","year":"2007","unstructured":"Wassan N (2007) Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls. J Oper Res Soc 58(12):1630\u20131641. https:\/\/doi.org\/10.1057\/palgrave.jors.2602313","journal-title":"J Oper Res Soc"},{"key":"534_CR145","doi-asserted-by":"publisher","unstructured":"Wassan N, Wassan N, Nagy G, Salhi S (2017) The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search. Comput Oper Res 78:454\u2013467. https:\/\/doi.org\/10.1016\/j.cor.2015.12.017. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054815003032","DOI":"10.1016\/j.cor.2015.12.017"},{"issue":"2","key":"534_CR146","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 (2008a) A heuristic method for the vehicle routing problem with mixed deliveries and pickups. J Sched 11(2):149\u2013161. https:\/\/doi.org\/10.1007\/s10951-008-0055-y","journal-title":"J Sched"},{"issue":"4","key":"534_CR147","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 (2008b) A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J Comb Optim 15(4):368\u2013386. https:\/\/doi.org\/10.1007\/s10878-007-9090-4","journal-title":"J Comb Optim"},{"key":"534_CR148","doi-asserted-by":"publisher","unstructured":"Wu W, Tian Y, Jin T (2016) A label based ant colony algorithm for heterogeneous vehicle routing with mixed backhaul. Appl Soft Comput 47:224\u2013234. https:\/\/doi.org\/10.1016\/j.asoc.2016.05.011. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494616302125","DOI":"10.1016\/j.asoc.2016.05.011"},{"key":"534_CR149","doi-asserted-by":"publisher","unstructured":"Yalc\u0131n GD, Erginel N (2015) Fuzzy multi-objective programming algorithm for vehicle routing problems with backhauls. Expert Syst Appl 42(13):5632\u20135644. https:\/\/doi.org\/10.1016\/j.eswa.2015.02.060. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417415001682","DOI":"10.1016\/j.eswa.2015.02.060"},{"key":"534_CR150","doi-asserted-by":"crossref","unstructured":"Yano CA, Chan TJ, Richter LK, Cutler T, Murty KG, McGettigan D (1987) Vehicle routing at quality stores. Interfaces 17(2):52\u201363. http:\/\/www.jstor.org\/stable\/25060942","DOI":"10.1287\/inte.17.2.52"},{"key":"534_CR151","doi-asserted-by":"publisher","unstructured":"Yu M, Qi X (2014) A vehicle routing problem with multiple overlapped batches. Transp Res Part E Logist Transp Rev 61:40\u201355. https:\/\/doi.org\/10.1016\/j.tre.2013.10.004. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1366554513001701","DOI":"10.1016\/j.tre.2013.10.004"},{"key":"534_CR152","doi-asserted-by":"publisher","unstructured":"Zachariadis EE, Kiranoudis CT (2012) An effective local search approach for the vehicle routing problem with backhauls. Expert Syst Appl 39(3):3174\u20133184. https:\/\/doi.org\/10.1016\/j.eswa.2011.09.004. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417411013133","DOI":"10.1016\/j.eswa.2011.09.004"},{"key":"534_CR153","doi-asserted-by":"publisher","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, Part 1):1070\u20131081. https:\/\/doi.org\/10.1016\/j.eswa.2007.11.005. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S095741740700526X","DOI":"10.1016\/j.eswa.2007.11.005"},{"key":"534_CR154","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.ejor.2009.05.015. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221709003476","DOI":"10.1016\/j.ejor.2009.05.015"},{"issue":"1","key":"534_CR155","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s12351-015-0218-5","volume":"17","author":"EE Zachariadis","year":"2015","unstructured":"Zachariadis EE, Tarantilis CD, Kiranoudis CT (2015) Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints. Oper Res 17(1):115\u2013143. https:\/\/doi.org\/10.1007\/s12351-015-0218-5","journal-title":"Oper Res"},{"key":"534_CR156","doi-asserted-by":"publisher","unstructured":"Zhong Y, Cole MH (2005) A vehicle routing problem with backhauls and time windows: a guided local search solution. Transp Res Part E Logist Transp Rev 41(2):131\u2013144. https:\/\/doi.org\/10.1016\/j.tre.2003.12.003. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S136655450400016X","DOI":"10.1016\/j.tre.2003.12.003"},{"key":"534_CR157","doi-asserted-by":"publisher","unstructured":"Zhu Z, Chu F, Sun L (2010) The capacitated plant location problem with customers and suppliers matching. Transp Res Part E Logist Transp Rev 46(3):469\u2013480. https:\/\/doi.org\/10.1016\/j.tre.2009.09.002. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1366554509001227","DOI":"10.1016\/j.tre.2009.09.002"}],"container-title":["TOP"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11750-019-00534-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11750-019-00534-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11750-019-00534-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T04:14:36Z","timestamp":1605672876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11750-019-00534-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,19]]},"references-count":157,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["534"],"URL":"https:\/\/doi.org\/10.1007\/s11750-019-00534-0","relation":{},"ISSN":["1134-5764","1863-8279"],"issn-type":[{"value":"1134-5764","type":"print"},{"value":"1863-8279","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,19]]},"assertion":[{"value":"8 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}