{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T17:24:15Z","timestamp":1775323455753,"version":"3.50.1"},"reference-count":89,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T00:00:00Z","timestamp":1599609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T00:00:00Z","timestamp":1599609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s12351-020-00600-7","type":"journal-article","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T14:02:07Z","timestamp":1599746527000},"page":"2033-2062","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":213,"title":["Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification"],"prefix":"10.1007","volume":"22","author":[{"given":"Grigorios D.","family":"Konstantakopoulos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7524-0215","authenticated-orcid":false,"given":"Sotiris P.","family":"Gayialis","sequence":"additional","affiliation":[]},{"given":"Evripidis P.","family":"Kechagias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,9]]},"reference":[{"key":"600_CR1","doi-asserted-by":"publisher","first-page":"105728","DOI":"10.1016\/j.asoc.2019.105728","volume":"84","author":"AM Altabeeb","year":"2019","unstructured":"Altabeeb AM, Mohsen AM, Ghallab A (2019) An improved hybrid firefly algorithm for capacitated vehicle routing problem. Appl Soft Comput 84:105728. https:\/\/doi.org\/10.1016\/j.asoc.2019.105728","journal-title":"Appl Soft Comput"},{"key":"600_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cor.2019.04.018","volume":"109","author":"J Andelmin","year":"2019","unstructured":"Andelmin J, Bartolini E (2019) A multi-start local search heuristic for the Green Vehicle Routing Problem based on a multigraph reformulation. Comput Oper Res 109:43\u201363. https:\/\/doi.org\/10.1016\/j.cor.2019.04.018","journal-title":"Comput Oper Res"},{"key":"600_CR3","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1016\/j.tre.2011.11.006","volume":"48","author":"M Andres Figliozzi","year":"2012","unstructured":"Andres Figliozzi M (2012) The time dependent vehicle routing problem with time windows: benchmark problems, an efficient solution algorithm, and solution characteristics. Transp Res Part E Logist Transp Rev 48:616\u2013636. https:\/\/doi.org\/10.1016\/j.tre.2011.11.006","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"600_CR4","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.tre.2006.04.003","volume":"44","author":"C Archetti","year":"2008","unstructured":"Archetti C, Savelsbergh MWP, Speranza MG (2008) To split or not to split: that is the question. Transp Res Part E Logist Transp Rev 44:114\u2013123. https:\/\/doi.org\/10.1016\/j.tre.2006.04.003","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"600_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.ejor.2014.04.026","volume":"238","author":"C Archetti","year":"2014","unstructured":"Archetti C, Bianchessi N, Speranza MG (2014) Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur J Oper Res 238:685\u2013698. https:\/\/doi.org\/10.1016\/j.ejor.2014.04.026","journal-title":"Eur J Oper Res"},{"key":"600_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.cie.2015.02.002","volume":"83","author":"M Avci","year":"2015","unstructured":"Avci M, Topaloglu S (2015) An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries. Comput Ind Eng 83:15\u201329. https:\/\/doi.org\/10.1016\/j.cie.2015.02.002","journal-title":"Comput Ind Eng"},{"key":"600_CR7","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2009.06.034","volume":"202","author":"N Azi","year":"2010","unstructured":"Azi N, Gendreau M, Potvin J-Y (2010) An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur J Oper Res 202:756\u2013763. https:\/\/doi.org\/10.1016\/j.ejor.2009.06.034","journal-title":"Eur J Oper Res"},{"key":"600_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/opre.1100.0875","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Bartolini E, Mingozzi A, Valletta A (2011) An exact algorithm for the period routing problem. Oper Res 59:228\u2013241. https:\/\/doi.org\/10.1287\/opre.1100.0875","journal-title":"Oper Res"},{"key":"600_CR9","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1287\/opre.1120.1153","volume":"61","author":"R Baldacci","year":"2013","unstructured":"Baldacci R, Mingozzi A, Roberti R, Calvo RW (2013) An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper Res 61:298\u2013314. https:\/\/doi.org\/10.1287\/opre.1120.1153","journal-title":"Oper Res"},{"key":"600_CR10","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1016\/j.cor.2010.10.011","volume":"38","author":"SR Balseiro","year":"2011","unstructured":"Balseiro SR, Loiseau I, Ramonet J (2011) An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows. Comput Oper Res 38:954\u2013966. https:\/\/doi.org\/10.1016\/j.cor.2010.10.011","journal-title":"Comput Oper Res"},{"key":"600_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cie.2019.03.047","volume":"131","author":"V Baradaran","year":"2019","unstructured":"Baradaran V, Shafaei A, Hosseinian AH (2019) Stochastic vehicle routing problem with heterogeneous vehicles and multiple prioritized time windows: mathematical modeling and solution approach. Comput Ind Eng 131:187\u2013199. https:\/\/doi.org\/10.1016\/j.cie.2019.03.047","journal-title":"Comput Ind Eng"},{"key":"600_CR12","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1016\/j.trb.2011.02.004","volume":"45","author":"T Bektas","year":"2011","unstructured":"Bektas T, Laporte G (2011) The pollution-routing problem. Transp Res Part B Methodol 45:1232\u20131250. https:\/\/doi.org\/10.1016\/j.trb.2011.02.004","journal-title":"Transp Res Part B Methodol"},{"key":"600_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1111\/itor.12379","volume":"26","author":"J Belloso","year":"2019","unstructured":"Belloso J, Juan AA, Faulin J (2019) An iterative biased-randomized heuristic for the fleet size and mix vehicle-routing problem with backhauls. Int Trans Oper Res 26:289\u2013301. https:\/\/doi.org\/10.1111\/itor.12379","journal-title":"Int Trans Oper Res"},{"key":"600_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:775\u2013789. https:\/\/doi.org\/10.1007\/s10845-012-0627-8","journal-title":"J Intell Manuf"},{"key":"600_CR15","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","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","journal-title":"Comput Ind Eng"},{"key":"600_CR16","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1057\/palgrave.jors.2600595","volume":"49","author":"JCS Brand\u00e3o","year":"1998","unstructured":"Brand\u00e3o JCS, Mercer A (1998) The multi-trip vehicle routing problem. J Oper Res Soc 49:799\u2013805. https:\/\/doi.org\/10.1057\/palgrave.jors.2600595","journal-title":"J Oper Res Soc"},{"key":"600_CR17","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.cor.2018.11.005","volume":"103","author":"U Breunig","year":"2019","unstructured":"Breunig U, Baldacci R, Hartl RF, Vidal T (2019) The electric two-echelon vehicle routing problem. Comput Oper Res 103:198\u2013210. https:\/\/doi.org\/10.1016\/j.cor.2018.11.005","journal-title":"Comput Oper Res"},{"key":"600_CR18","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 et al (2014) Rich vehicle routing problem: survey. ACM Comput Surv 47:1\u201328.\u00a0https:\/\/doi.org\/10.1145\/2666003","journal-title":"ACM Comput Surv"},{"key":"600_CR19","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:6809\u20136817. https:\/\/doi.org\/10.1016\/j.eswa.2010.03.045","journal-title":"Expert Syst Appl"},{"key":"600_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10479-008-0487-y","volume":"180","author":"H C\u00e9sar","year":"2010","unstructured":"C\u00e9sar H, De Oliveira B (2010) A hybrid search method for the vehicle routing problem with time windows. Ann Oper Res 180:125\u2013144. https:\/\/doi.org\/10.1007\/s10479-008-0487-y","journal-title":"Ann Oper Res"},{"key":"600_CR21","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1057\/jors.2009.154","volume":"61","author":"S Coene","year":"2010","unstructured":"Coene S, Arnout A, Spieksma FCR (2010) On a periodic vehicle routing problem. J Oper Res Soc 61:1719\u20131728. https:\/\/doi.org\/10.1057\/jors.2009.154","journal-title":"J Oper Res Soc"},{"key":"600_CR22","doi-asserted-by":"publisher","first-page":"5944","DOI":"10.1016\/j.sbspro.2010.04.009","volume":"2","author":"TG Crainic","year":"2010","unstructured":"Crainic TG, Perboli G, Mancini S, Tadei R (2010) Two-echelon vehicle routing problem: a satellite location analysis. Procedia Soc Behav Sci 2:5944\u20135955. https:\/\/doi.org\/10.1016\/j.sbspro.2010.04.009","journal-title":"Procedia Soc Behav Sci"},{"key":"600_CR23","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80\u201391. https:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Manag Sci"},{"key":"600_CR24","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57:1472\u20131483. https:\/\/doi.org\/10.1016\/j.cie.2009.05.009","journal-title":"Comput Ind Eng"},{"key":"600_CR25","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/net.21538","volume":"63","author":"D Feillet","year":"2014","unstructured":"Feillet D, Garaix T, Lehu\u00e9d\u00e9 F et al (2014) A new consistent vehicle routing problem for the transportation of people with disabilities. Networks 63:211\u2013224. https:\/\/doi.org\/10.1002\/net.21538","journal-title":"Networks"},{"key":"600_CR26","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-0-387-71722-7_3","volume-title":"Dynamic fleet management: concepts, systems, algorithms & case studies","author":"T Flatberg","year":"2007","unstructured":"Flatberg T, Hasle G, Kloster O et al (2007) Dynamic and stochastic vehicle routing in practice. In: Zeimpekis V, Tarantilis CD, Giaglis GM, Minis I (eds) Dynamic fleet management: concepts, systems, algorithms & case studies. Springer US, Boston, pp 41\u201363"},{"key":"600_CR27","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2016.04.065","volume":"255","author":"V Fran\u00e7ois","year":"2016","unstructured":"Fran\u00e7ois V, Arda Y, Crama Y, Laporte G (2016) Large neighborhood search for multi-trip vehicle routing. Eur J Oper Res 255:422\u2013441. https:\/\/doi.org\/10.1016\/j.ejor.2016.04.065","journal-title":"Eur J Oper Res"},{"key":"600_CR28","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-95666-4_7","volume-title":"Operational research in the digital era\u2014ICT challenges","author":"SP Gayialis","year":"2019","unstructured":"Gayialis SP, Konstantakopoulos GD, Tatsiopoulos IP (2019) Vehicle routing problem for urban freight transportation: a review of the recent literature. In: Sifaleras A, Petridis K (eds) Operational research in the digital era\u2014ICT challenges. Springer, Cham, pp 89\u2013104"},{"key":"600_CR29","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.asoc.2010.04.001","volume":"10","author":"K Ghoseiri","year":"2010","unstructured":"Ghoseiri K, Ghannadpour SF (2010) Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl Soft Comput 10:1096\u20131107. https:\/\/doi.org\/10.1016\/j.asoc.2010.04.001","journal-title":"Appl Soft Comput"},{"key":"600_CR30","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ejor.2015.01.049","volume":"245","author":"D Goeke","year":"2015","unstructured":"Goeke D, Schneider M (2015) Routing a mixed fleet of electric and conventional vehicles. Eur J Oper Res 245:81\u201399. https:\/\/doi.org\/10.1016\/j.ejor.2015.01.049","journal-title":"Eur J Oper Res"},{"key":"600_CR31","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:39\u201351. https:\/\/doi.org\/10.1016\/0377-2217(89)90057-X","journal-title":"Eur J Oper Res"},{"key":"600_CR32","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.cie.2012.01.005","volume":"65","author":"FP Goksal","year":"2013","unstructured":"Goksal FP, Karaoglan I, Altiparmak F (2013) A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Comput Ind Eng 65:39\u201353. https:\/\/doi.org\/10.1016\/j.cie.2012.01.005","journal-title":"Comput Ind Eng"},{"key":"600_CR33","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.ejor.2016.03.040","volume":"254","author":"P Grangier","year":"2016","unstructured":"Grangier P, Gendreau M, Lehu\u00e9d\u00e9 F, Rousseau L-M (2016) An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Eur J Oper Res 254:80\u201391. https:\/\/doi.org\/10.1016\/j.ejor.2016.03.040","journal-title":"Eur J Oper Res"},{"key":"600_CR34","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1287\/msom.1080.0243","volume":"11","author":"C Gro\u00ebr","year":"2009","unstructured":"Gro\u00ebr C, Golden B, Wasil E (2009) The consistent vehicle routing problem. Manuf Serv Oper Manag 11:630\u2013643. https:\/\/doi.org\/10.1287\/msom.1080.0243","journal-title":"Manuf Serv Oper Manag"},{"key":"600_CR35","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.tre.2016.01.014","volume":"88","author":"AF-W Han","year":"2016","unstructured":"Han AF-W, Chu Y-C (2016) A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts. Transp Res Part E Logist Transp Rev 88:11\u201331. https:\/\/doi.org\/10.1016\/j.tre.2016.01.014","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"600_CR36","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1016\/j.ejor.2016.01.038","volume":"252","author":"G Hiermann","year":"2016","unstructured":"Hiermann G, Puchinger J, Ropke S, Hartl RF (2016) The electric fleet size and mix vehicle routing problem with time windows and recharging stations. Eur J Oper Res 252:995\u20131018. https:\/\/doi.org\/10.1016\/j.ejor.2016.01.038","journal-title":"Eur J Oper Res"},{"key":"600_CR37","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cor.2011.03.006","volume":"39","author":"L Hong","year":"2012","unstructured":"Hong L (2012) An improved LNS algorithm for real-time vehicle routing problem with time windows. Comput Oper Res 39:151\u2013163. https:\/\/doi.org\/10.1016\/j.cor.2011.03.006","journal-title":"Comput Oper Res"},{"key":"600_CR38","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.cor.2018.02.006","volume":"94","author":"C Hu","year":"2018","unstructured":"Hu C, Lu J, Liu X, Zhang G (2018) Robust vehicle routing problem with hard time windows under demand and travel time uncertainty. Comput Oper Res 94:139\u2013153. https:\/\/doi.org\/10.1016\/j.cor.2018.02.006","journal-title":"Comput Oper Res"},{"key":"600_CR39","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1111\/itor.12101","volume":"22","author":"AA Juan","year":"2015","unstructured":"Juan AA, Pascual I, Guimarans D, Barrios B (2015) Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem. Int Trans Oper Res 22:647\u2013667. https:\/\/doi.org\/10.1111\/itor.12101","journal-title":"Int Trans Oper Res"},{"key":"600_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-018-0396-z","author":"Y Kaboudani","year":"2018","unstructured":"Kaboudani Y, Ghodsypour SH, Kia H, Shahmardan A (2018) Vehicle routing and scheduling in cross docks with forward and reverse logistics. Oper Res Int J. https:\/\/doi.org\/10.1007\/s12351-018-0396-z","journal-title":"Oper Res Int J"},{"key":"600_CR41","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/j.asoc.2014.11.005","volume":"27","author":"S Karakati\u010d","year":"2015","unstructured":"Karakati\u010d S, Podgorelec V (2015) A survey of genetic algorithms for solving multi depot vehicle routing problem. Appl Soft Comput 27:519\u2013532. https:\/\/doi.org\/10.1016\/j.asoc.2014.11.005","journal-title":"Appl Soft Comput"},{"key":"600_CR42","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1109\/TITS.2015.2395536","volume":"16","author":"G Kim","year":"2015","unstructured":"Kim G, Ong Y, Heng CK et al (2015) City vehicle routing problem (City VRP): a review. IEEE Trans Intell Transp Syst 16:1654\u20131666. https:\/\/doi.org\/10.1109\/TITS.2015.2395536","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"600_CR43","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cor.2015.05.004","volume":"64","author":"\u00c7 Ko\u00e7","year":"2015","unstructured":"Ko\u00e7 \u00c7, Bekta\u015f T, Jabali O, Laporte G (2015) A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Comput Oper Res 64:11\u201327. https:\/\/doi.org\/10.1016\/j.cor.2015.05.004","journal-title":"Comput Oper Res"},{"key":"600_CR44","doi-asserted-by":"publisher","DOI":"10.1002\/9781119136767","volume-title":"Metaheuristics for vehicle routing problems","author":"N Labadie","year":"2016","unstructured":"Labadie N, Prins C, Prodhon C (2016) Metaheuristics for vehicle routing problems. Wiley, Hoboken"},{"key":"600_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2014.07.048","volume":"241","author":"R Lahyani","year":"2015","unstructured":"Lahyani R, Khemakhem M, Semet F (2015) Rich vehicle routing problems: from a taxonomy to a definition. Eur J Oper Res 241:1\u201314. https:\/\/doi.org\/10.1016\/j.ejor.2014.07.048","journal-title":"Eur J Oper Res"},{"key":"600_CR46","doi-asserted-by":"publisher","first-page":"1775","DOI":"10.1016\/j.cor.2011.02.007","volume":"38","author":"H Lei","year":"2011","unstructured":"Lei H, Laporte G, Guo B (2011) The capacitated vehicle routing problem with stochastic demands and time windows. Comput Oper Res 38:1775\u20131783. https:\/\/doi.org\/10.1016\/j.cor.2011.02.007","journal-title":"Comput Oper Res"},{"key":"600_CR47","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ejor.2012.09.023","volume":"225","author":"SCH Leung","year":"2013","unstructured":"Leung SCH, Zhang Z, Zhang D et al (2013) A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints. Eur J Oper Res 225:199\u2013210. https:\/\/doi.org\/10.1016\/j.ejor.2012.09.023","journal-title":"Eur J Oper Res"},{"key":"600_CR48","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.eswa.2009.06.077","volume":"37","author":"S-W Lin","year":"2010","unstructured":"Lin S-W, Yu VF, Chou S-Y (2010) A note on the truck and trailer routing problem. Expert Syst Appl 37:899\u2013903. https:\/\/doi.org\/10.1016\/j.eswa.2009.06.077","journal-title":"Expert Syst Appl"},{"key":"600_CR49","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1016\/j.eswa.2013.07.107","volume":"41","author":"C Lin","year":"2014","unstructured":"Lin C, Choy KL, Ho GTS et al (2014) Survey of green vehicle routing problem: past and future trends. Expert Syst Appl 41:1118\u20131138","journal-title":"Expert Syst Appl"},{"key":"600_CR50","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.ejor.2013.08.032","volume":"236","author":"J Lysgaard","year":"2014","unstructured":"Lysgaard J, W\u00f8hlk S (2014) A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. Eur J Oper Res 236:800\u2013810. https:\/\/doi.org\/10.1016\/j.ejor.2013.08.032","journal-title":"Eur J Oper Res"},{"key":"600_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trc.2017.02.004","volume":"78","author":"S Mancini","year":"2017","unstructured":"Mancini S (2017) The hybrid vehicle routing problem. Transp Res Part C Emerg Technol 78:1\u201312. https:\/\/doi.org\/10.1016\/j.trc.2017.02.004","journal-title":"Transp Res Part C Emerg Technol"},{"key":"600_CR52","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-319-19369-4_60","volume-title":"Artificial intelligence and soft computing","author":"J Ma\u0144dziuk","year":"2015","unstructured":"Ma\u0144dziuk J, Nejman C (2015) UCT-based approach to capacitated vehicle routing problem. In: Rutkowski L, Korytkowski M, Scherer R et al (eds) Artificial intelligence and soft computing. Springer, Cham, pp 679\u2013690"},{"key":"600_CR53","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF02941184","volume":"7","author":"Y Marinakis","year":"2007","unstructured":"Marinakis Y, Migdalas A (2007) Annotated bibliography in vehicle routing. Oper Res\u00a0Int J 7:27\u201346. https:\/\/doi.org\/10.1007\/BF02941184","journal-title":"Oper Res\u00a0Int J"},{"key":"600_CR54","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ins.2014.10.002","volume":"294","author":"M Mavrovouniotis","year":"2015","unstructured":"Mavrovouniotis M, Yang S (2015) Ant algorithms with immigrants schemes for the dynamic vehicle routing problem. Inf Sci (NY) 294:456\u2013477. https:\/\/doi.org\/10.1016\/j.ins.2014.10.002","journal-title":"Inf Sci (NY)"},{"key":"600_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00529-6","author":"K Mekamcha","year":"2019","unstructured":"Mekamcha K, Souier M, Bessenouci HN, Bennekrouf M (2019) Two metaheuristics approaches for solving the traveling salesman problem: an Algerian waste collection case. Oper Res\u00a0Int J. https:\/\/doi.org\/10.1007\/s12351-019-00529-6","journal-title":"Oper Res\u00a0Int J"},{"key":"600_CR56","doi-asserted-by":"publisher","first-page":"11547","DOI":"10.1016\/j.eswa.2011.03.032","volume":"38","author":"SA MirHassani","year":"2011","unstructured":"MirHassani SA, Abolghasemi N (2011) A particle swarm optimization algorithm for open vehicle routing problem. Expert Syst Appl 38:11547\u201311551. https:\/\/doi.org\/10.1016\/j.eswa.2011.03.032","journal-title":"Expert Syst Appl"},{"key":"600_CR57","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.cor.2004.07.009","volume":"33","author":"FAT Montan\u00e9","year":"2006","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:595\u2013619. https:\/\/doi.org\/10.1016\/j.cor.2004.07.009","journal-title":"Comput Oper Res"},{"key":"600_CR58","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1007\/s00500-015-1642-4","volume":"20","author":"J Nalepa","year":"2016","unstructured":"Nalepa J, Blocho M (2016) Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput 20:2309\u20132327. https:\/\/doi.org\/10.1007\/s00500-015-1642-4","journal-title":"Soft Comput"},{"key":"600_CR59","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-017-2642-9","volume":"273","author":"PHV Penna","year":"2019","unstructured":"Penna PHV, Subramanian A, Ochi LS et al (2019) A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Ann Oper Res 273:5\u201374. https:\/\/doi.org\/10.1007\/s10479-017-2642-9","journal-title":"Ann Oper Res"},{"key":"600_CR60","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.trc.2019.01.006","volume":"99","author":"G Perboli","year":"2019","unstructured":"Perboli G, Rosano M (2019) Parcel delivery in urban areas: opportunities and threats for the mix of traditional and green business models. Transp Res Part C Emerg Technol 99:19\u201336. https:\/\/doi.org\/10.1016\/j.trc.2019.01.006","journal-title":"Transp Res Part C Emerg Technol"},{"key":"600_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac V, Gendreau M, Gu\u00e9ret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225:1\u201311. https:\/\/doi.org\/10.1016\/j.ejor.2012.08.015","journal-title":"Eur J Oper Res"},{"key":"600_CR62","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1016\/j.engappai.2008.10.006","volume":"22","author":"C Prins","year":"2009","unstructured":"Prins C (2009) Two memetic algorithms for heterogeneous fleet vehicle routing problems. Eng Appl Artif Intell 22:916\u2013928. https:\/\/doi.org\/10.1016\/j.engappai.2008.10.006","journal-title":"Eng Appl Artif Intell"},{"key":"600_CR63","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1287\/trsc.1080.0235","volume":"43","author":"HJ Quak","year":"2009","unstructured":"Quak HJ, de Koster MBM (2009) Delivering goods in urban areas: how to deal with urban policy restrictions and the environment. Transp Sci 43:211\u2013227. https:\/\/doi.org\/10.1287\/trsc.1080.0235","journal-title":"Transp Sci"},{"key":"600_CR64","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00521-0","author":"B Rabbouch","year":"2019","unstructured":"Rabbouch B, Sa\u00e2daoui F, Mraihi R (2019) Efficient implementation of the genetic algorithm to solve rich vehicle routing problems. Oper Res Int J. https:\/\/doi.org\/10.1007\/s12351-019-00521-0","journal-title":"Oper Res Int J"},{"key":"600_CR65","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00452-w","author":"M Rajabi-Bahaabadi","year":"2019","unstructured":"Rajabi-Bahaabadi M, Shariat-Mohaymany A, Babaei M, Vigo D (2019) Reliable vehicle routing problem in stochastic networks with correlated travel times. Oper Res\u00a0Int J. https:\/\/doi.org\/10.1007\/s12351-019-00452-w","journal-title":"Oper Res\u00a0Int J"},{"key":"600_CR66","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","volume":"23","author":"J Renaud","year":"1996","unstructured":"Renaud J, Laporte G, Boctor FF (1996) A tabu search heuristic for the multi-depot vehicle routing problem. Comput Oper Res 23:229\u2013235. https:\/\/doi.org\/10.1016\/0305-0548(95)O0026-P","journal-title":"Comput Oper Res"},{"key":"600_CR67","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.cor.2008.11.003","volume":"37","author":"PP Repoussis","year":"2010","unstructured":"Repoussis PP, Tarantilis CD, Br\u00e4ysy O, Ioannou G (2010) A hybrid evolution strategy for the open vehicle routing problem. Comput Oper Res 37:443\u2013455. https:\/\/doi.org\/10.1016\/j.cor.2008.11.003","journal-title":"Comput Oper Res"},{"key":"600_CR68","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1287\/trsc.2018.0855","volume":"53","author":"A-K Rothenb\u00e4cher","year":"2019","unstructured":"Rothenb\u00e4cher A-K (2019) Branch-and-price-and-cut for the periodic vehicle routing problem with flexible schedule structures. Transp Sci 53:850\u2013866. https:\/\/doi.org\/10.1287\/trsc.2018.0855","journal-title":"Transp Sci"},{"key":"600_CR69","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1287\/trsc.2017.0765","volume":"52","author":"A-K Rothenb\u00e4cher","year":"2018","unstructured":"Rothenb\u00e4cher A-K, Drexl M, Irnich S (2018) Branch-and-price-and-cut for the truck-and-trailer routing problem with time windows. Transp Sci 52:1174\u20131190. https:\/\/doi.org\/10.1287\/trsc.2017.0765","journal-title":"Transp Sci"},{"key":"600_CR70","doi-asserted-by":"publisher","first-page":"2106","DOI":"10.1016\/j.cor.2010.02.010","volume":"37","author":"M Salari","year":"2010","unstructured":"Salari M, Toth P, Tramontani A (2010) An ILP improvement procedure for the open vehicle routing problem. Comput Oper Res 37:2106\u20132120. https:\/\/doi.org\/10.1016\/j.cor.2010.02.010","journal-title":"Comput Oper Res"},{"key":"600_CR71","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/trsc.2013.0490","volume":"48","author":"M Schneider","year":"2014","unstructured":"Schneider M, Stenger A, Goeke D (2014) The electric vehicle-routing problem with time windows and recharging stations. Transp Sci 48:500\u2013520. https:\/\/doi.org\/10.1287\/trsc.2013.0490","journal-title":"Transp Sci"},{"key":"600_CR72","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"171","author":"G Schrimpf","year":"2000","unstructured":"Schrimpf G, Schneider J, Stamm-wilbrandt H, Dueck G (2000) Record breaking optimization results using the ruin and recreate principle. J Comput Phys 171:139\u2013171. https:\/\/doi.org\/10.1006\/jcph.1999.6413","journal-title":"J Comput Phys"},{"key":"600_CR73","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.cor.2014.08.005","volume":"53","author":"MM Silva","year":"2015","unstructured":"Silva MM, Subramanian A, Ochi LS (2015) An iterated local search heuristic for the split delivery vehicle routing problem. Comput Oper Res 53:234\u2013249. https:\/\/doi.org\/10.1016\/j.cor.2014.08.005","journal-title":"Comput Oper Res"},{"key":"600_CR74","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-05353-0_25","volume-title":"Recent advances in automation, robotics and measuring techniques","author":"P Sitek","year":"2014","unstructured":"Sitek P (2014) A hybrid approach to the two-echelon capacitated vehicle routing problem (2E-CVRP). In: Szewczyk R, Zieli\u0144ski C, Kaliczy\u0144ska M (eds) Recent advances in automation, robotics and measuring techniques. Springer, Cham, pp 251\u2013263"},{"key":"600_CR89","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.ejor.2012.03.016","volume":"221","author":"A Subramanian","year":"2012","unstructured":"Subramanian A, Penna PHV, Uchoa E, Ochi LS (2012) A hybrid algorithm for the heterogeneous fleet vehicle routing problem. Eur J Oper Res 221:285\u2013295. https:\/\/doi.org\/10.1016\/j.ejor.2012.03.016","journal-title":"Eur J Oper Res"},{"key":"600_CR75","doi-asserted-by":"publisher","first-page":"4233","DOI":"10.1016\/j.eswa.2011.09.111","volume":"39","author":"CD Tarantilis","year":"2012","unstructured":"Tarantilis CD, Stavropoulou F, Repoussis PP (2012) A template-based tabu search algorithm for the consistent vehicle routing problem. Expert Syst Appl 39:4233\u20134239. https:\/\/doi.org\/10.1016\/j.eswa.2011.09.111","journal-title":"Expert Syst Appl"},{"key":"600_CR76","doi-asserted-by":"publisher","first-page":"3206","DOI":"10.1016\/j.cor.2011.10.014","volume":"40","author":"FL Usberti","year":"2013","unstructured":"Usberti FL, Fran\u00e7a PM, Fran\u00e7a ALM (2013) GRASP with evolutionary path-relinking for the capacitated arc routing problem. Comput Oper Res 40:3206\u20133217. https:\/\/doi.org\/10.1016\/j.cor.2011.10.014","journal-title":"Comput Oper Res"},{"key":"600_CR77","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal T, Crainic TG, Gendreau M, Prins C (2013) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput Oper Res 40:475\u2013489. https:\/\/doi.org\/10.1016\/j.cor.2012.07.018","journal-title":"Comput Oper Res"},{"key":"600_CR78","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\u2013delivery and time windows. Comput Ind Eng 83:111\u2013122. https:\/\/doi.org\/10.1016\/j.cie.2015.02.005","journal-title":"Comput Ind Eng"},{"key":"600_CR79","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.jclepro.2017.01.001","volume":"144","author":"Y Wang","year":"2017","unstructured":"Wang Y, Ma X, Li Z et al (2017) Profit distribution in collaborative multiple centers vehicle routing problem. J Clean Prod 144:203\u2013219. https:\/\/doi.org\/10.1016\/j.jclepro.2017.01.001","journal-title":"J Clean Prod"},{"key":"600_CR80","doi-asserted-by":"publisher","first-page":"112910","DOI":"10.1016\/j.eswa.2019.112910","volume":"140","author":"Y Wang","year":"2020","unstructured":"Wang Y, Zhang S, Guan X et al (2020) Collaborative multi-depot logistics network design with time window assignment. Expert Syst Appl 140:112910. https:\/\/doi.org\/10.1016\/j.eswa.2019.112910","journal-title":"Expert Syst Appl"},{"key":"600_CR81","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.eswa.2018.07.007","volume":"113","author":"Z Xu","year":"2018","unstructured":"Xu Z, Cai Y (2018) Variable neighborhood search for consistent vehicle routing problem. Expert Syst Appl 113:66\u201376. https:\/\/doi.org\/10.1016\/j.eswa.2018.07.007","journal-title":"Expert Syst Appl"},{"key":"600_CR82","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.ins.2015.07.009","volume":"325","author":"ET Yassen","year":"2015","unstructured":"Yassen ET, Ayob M, Nazri MZA, Sabar NR (2015) Meta-harmony search algorithm for the vehicle routing problem with time windows. Inf Sci (NY) 325:140\u2013158. https:\/\/doi.org\/10.1016\/j.ins.2015.07.009","journal-title":"Inf Sci (NY)"},{"key":"600_CR83","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tre.2010.09.010","volume":"47","author":"B Yu","year":"2011","unstructured":"Yu B, Yang ZZ (2011) An ant colony optimization model: the period vehicle routing problem with time windows. Transp Res Part E Logist Transp Rev 47:166\u2013181. https:\/\/doi.org\/10.1016\/j.tre.2010.09.010","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"600_CR84","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1007\/s12351-017-0314-9","volume":"19","author":"G Yu","year":"2019","unstructured":"Yu G, Yang Y (2019) Dynamic routing with real-time traffic information. Oper Res\u00a0Int J 19:1033\u20131058. https:\/\/doi.org\/10.1007\/s12351-017-0314-9","journal-title":"Oper Res\u00a0Int J"},{"key":"600_CR85","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1057\/jors.2009.161","volume":"62","author":"B Yu","year":"2011","unstructured":"Yu B, Yang ZZ, Xie JX (2011) A parallel improved ant colony optimization for multi-depot vehicle routing problem. J Oper Res Soc 62:183\u2013188. https:\/\/doi.org\/10.1057\/jors.2009.161","journal-title":"J Oper Res Soc"},{"key":"600_CR86","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.asoc.2016.10.006","volume":"52","author":"VF Yu","year":"2017","unstructured":"Yu VF, Redi AANP, Yang C-L et al (2017) Symbiotic organisms search and two solution representations for solving the capacitated vehicle routing problem. Appl Soft Comput 52:657\u2013672. https:\/\/doi.org\/10.1016\/j.asoc.2016.10.006","journal-title":"Appl Soft Comput"},{"key":"600_CR87","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1016\/j.cor.2009.06.021","volume":"37","author":"EE Zachariadis","year":"2010","unstructured":"Zachariadis EE, Kiranoudis CT (2010) An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Comput Oper Res 37:712\u2013723. https:\/\/doi.org\/10.1016\/j.cor.2009.06.021","journal-title":"Comput Oper Res"},{"key":"600_CR88","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:369\u2013386. https:\/\/doi.org\/10.1016\/j.ejor.2015.11.018","journal-title":"Eur J Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00600-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-020-00600-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00600-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T07:21:32Z","timestamp":1655536892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-020-00600-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,9]]},"references-count":89,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["600"],"URL":"https:\/\/doi.org\/10.1007\/s12351-020-00600-7","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,9]]},"assertion":[{"value":"25 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}