Abstract
The scheduling of deliveries and the routing of vehicles are of great importance for supply chain operations, as both determine to a great extent the distribution costs, as well as customer satisfaction. The fact that the distribution of goods is being affected by multiple factors, stemming from the demands of transportation companies, customers, and the external environment, has made the vehicle routing problem (VRP) among the most studied topics in operational research. These factors are transformed either to constraints or variables of the problem and finally lead to the creation of different variants of the VRP, formulated and studied by researchers. Moreover, the management of logistics and supply chain operations is being enhanced by the use of algorithms, integrated into information systems, enabling the optimization of real-life distribution cases. This paper presents a methodology for classifying the multiple VRP variants related to freight transportation, that most logistics and distribution companies face in their daily operations, as well as the algorithms solving the various problems. The application of the research methodology concluded to 334 papers, which were further sorted to 263 papers on the subject of freight transportation, aiming to identify the trends of the VRP variants and the applied algorithms, during the last decade. The correlation between the VRP variants and the applied algorithms is also identified. Finally, the paper presents the quantitative and qualitative results of the literature review and discusses the scientific publications with a significant impact on the research community.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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
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–63. https://doi.org/10.1016/j.cor.2019.04.018
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–636. https://doi.org/10.1016/j.tre.2011.11.006
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–123. https://doi.org/10.1016/j.tre.2006.04.003
Archetti C, Bianchessi N, Speranza MG (2014) Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur J Oper Res 238:685–698. https://doi.org/10.1016/j.ejor.2014.04.026
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–29. https://doi.org/10.1016/j.cie.2015.02.002
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–763. https://doi.org/10.1016/j.ejor.2009.06.034
Baldacci R, Bartolini E, Mingozzi A, Valletta A (2011) An exact algorithm for the period routing problem. Oper Res 59:228–241. https://doi.org/10.1287/opre.1100.0875
Baldacci R, Mingozzi A, Roberti R, Calvo RW (2013) An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper Res 61:298–314. https://doi.org/10.1287/opre.1120.1153
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–966. https://doi.org/10.1016/j.cor.2010.10.011
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–199. https://doi.org/10.1016/j.cie.2019.03.047
Bektas T, Laporte G (2011) The pollution-routing problem. Transp Res Part B Methodol 45:1232–1250. https://doi.org/10.1016/j.trb.2011.02.004
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–301. https://doi.org/10.1111/itor.12379
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–789. https://doi.org/10.1007/s10845-012-0627-8
Braekers K, Ramaekers K, Van Nieuwenhuyse I (2016) The vehicle routing problem: state of the art classification and review. Comput Ind Eng 99:300–313. https://doi.org/10.1016/j.cie.2015.12.007
Brandão JCS, Mercer A (1998) The multi-trip vehicle routing problem. J Oper Res Soc 49:799–805. https://doi.org/10.1057/palgrave.jors.2600595
Breunig U, Baldacci R, Hartl RF, Vidal T (2019) The electric two-echelon vehicle routing problem. Comput Oper Res 103:198–210. https://doi.org/10.1016/j.cor.2018.11.005
Caceres Cruz J, Arias P, Guimarans D et al (2014) Rich vehicle routing problem: survey. ACM Comput Surv 47:1–28. https://doi.org/10.1145/2666003
Çatay B (2010) A new saving-based ant algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Syst Appl 37:6809–6817. https://doi.org/10.1016/j.eswa.2010.03.045
César H, De Oliveira B (2010) A hybrid search method for the vehicle routing problem with time windows. Ann Oper Res 180:125–144. https://doi.org/10.1007/s10479-008-0487-y
Coene S, Arnout A, Spieksma FCR (2010) On a periodic vehicle routing problem. J Oper Res Soc 61:1719–1728. https://doi.org/10.1057/jors.2009.154
Crainic TG, Perboli G, Mancini S, Tadei R (2010) Two-echelon vehicle routing problem: a satellite location analysis. Procedia Soc Behav Sci 2:5944–5955. https://doi.org/10.1016/j.sbspro.2010.04.009
Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80–91. https://doi.org/10.1287/mnsc.6.1.80
Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57:1472–1483. https://doi.org/10.1016/j.cie.2009.05.009
Feillet D, Garaix T, Lehuédé F et al (2014) A new consistent vehicle routing problem for the transportation of people with disabilities. Networks 63:211–224. https://doi.org/10.1002/net.21538
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–63
François V, Arda Y, Crama Y, Laporte G (2016) Large neighborhood search for multi-trip vehicle routing. Eur J Oper Res 255:422–441. https://doi.org/10.1016/j.ejor.2016.04.065
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—ICT challenges. Springer, Cham, pp 89–104
Ghoseiri K, Ghannadpour SF (2010) Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl Soft Comput 10:1096–1107. https://doi.org/10.1016/j.asoc.2010.04.001
Goeke D, Schneider M (2015) Routing a mixed fleet of electric and conventional vehicles. Eur J Oper Res 245:81–99. https://doi.org/10.1016/j.ejor.2015.01.049
Goetschalckx M, Jacobs-Blecha C (1989) The vehicle routing problem with backhauls. Eur J Oper Res 42:39–51. https://doi.org/10.1016/0377-2217(89)90057-X
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–53. https://doi.org/10.1016/j.cie.2012.01.005
Grangier P, Gendreau M, Lehuédé 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–91. https://doi.org/10.1016/j.ejor.2016.03.040
Groër C, Golden B, Wasil E (2009) The consistent vehicle routing problem. Manuf Serv Oper Manag 11:630–643. https://doi.org/10.1287/msom.1080.0243
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–31. https://doi.org/10.1016/j.tre.2016.01.014
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–1018. https://doi.org/10.1016/j.ejor.2016.01.038
Hong L (2012) An improved LNS algorithm for real-time vehicle routing problem with time windows. Comput Oper Res 39:151–163. https://doi.org/10.1016/j.cor.2011.03.006
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–153. https://doi.org/10.1016/j.cor.2018.02.006
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–667. https://doi.org/10.1111/itor.12101
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
Karakatič S, Podgorelec V (2015) A survey of genetic algorithms for solving multi depot vehicle routing problem. Appl Soft Comput 27:519–532. https://doi.org/10.1016/j.asoc.2014.11.005
Kim G, Ong Y, Heng CK et al (2015) City vehicle routing problem (City VRP): a review. IEEE Trans Intell Transp Syst 16:1654–1666. https://doi.org/10.1109/TITS.2015.2395536
Koç Ç, Bektaş T, Jabali O, Laporte G (2015) A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Comput Oper Res 64:11–27. https://doi.org/10.1016/j.cor.2015.05.004
Labadie N, Prins C, Prodhon C (2016) Metaheuristics for vehicle routing problems. Wiley, Hoboken
Lahyani R, Khemakhem M, Semet F (2015) Rich vehicle routing problems: from a taxonomy to a definition. Eur J Oper Res 241:1–14. https://doi.org/10.1016/j.ejor.2014.07.048
Lei H, Laporte G, Guo B (2011) The capacitated vehicle routing problem with stochastic demands and time windows. Comput Oper Res 38:1775–1783. https://doi.org/10.1016/j.cor.2011.02.007
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–210. https://doi.org/10.1016/j.ejor.2012.09.023
Lin S-W, Yu VF, Chou S-Y (2010) A note on the truck and trailer routing problem. Expert Syst Appl 37:899–903. https://doi.org/10.1016/j.eswa.2009.06.077
Lin C, Choy KL, Ho GTS et al (2014) Survey of green vehicle routing problem: past and future trends. Expert Syst Appl 41:1118–1138
Lysgaard J, Wøhlk S (2014) A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. Eur J Oper Res 236:800–810. https://doi.org/10.1016/j.ejor.2013.08.032
Mancini S (2017) The hybrid vehicle routing problem. Transp Res Part C Emerg Technol 78:1–12. https://doi.org/10.1016/j.trc.2017.02.004
Mańdziuk 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–690
Marinakis Y, Migdalas A (2007) Annotated bibliography in vehicle routing. Oper Res Int J 7:27–46. https://doi.org/10.1007/BF02941184
Mavrovouniotis M, Yang S (2015) Ant algorithms with immigrants schemes for the dynamic vehicle routing problem. Inf Sci (NY) 294:456–477. https://doi.org/10.1016/j.ins.2014.10.002
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 Int J. https://doi.org/10.1007/s12351-019-00529-6
MirHassani SA, Abolghasemi N (2011) A particle swarm optimization algorithm for open vehicle routing problem. Expert Syst Appl 38:11547–11551. https://doi.org/10.1016/j.eswa.2011.03.032
Montané FAT, Galvão RD (2006) A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput Oper Res 33:595–619. https://doi.org/10.1016/j.cor.2004.07.009
Nalepa J, Blocho M (2016) Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput 20:2309–2327. https://doi.org/10.1007/s00500-015-1642-4
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–74. https://doi.org/10.1007/s10479-017-2642-9
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–36. https://doi.org/10.1016/j.trc.2019.01.006
Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225:1–11. https://doi.org/10.1016/j.ejor.2012.08.015
Prins C (2009) Two memetic algorithms for heterogeneous fleet vehicle routing problems. Eng Appl Artif Intell 22:916–928. https://doi.org/10.1016/j.engappai.2008.10.006
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–227. https://doi.org/10.1287/trsc.1080.0235
Rabbouch B, Saâdaoui 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
Rajabi-Bahaabadi M, Shariat-Mohaymany A, Babaei M, Vigo D (2019) Reliable vehicle routing problem in stochastic networks with correlated travel times. Oper Res Int J. https://doi.org/10.1007/s12351-019-00452-w
Renaud J, Laporte G, Boctor FF (1996) A tabu search heuristic for the multi-depot vehicle routing problem. Comput Oper Res 23:229–235. https://doi.org/10.1016/0305-0548(95)O0026-P
Repoussis PP, Tarantilis CD, Bräysy O, Ioannou G (2010) A hybrid evolution strategy for the open vehicle routing problem. Comput Oper Res 37:443–455. https://doi.org/10.1016/j.cor.2008.11.003
Rothenbächer A-K (2019) Branch-and-price-and-cut for the periodic vehicle routing problem with flexible schedule structures. Transp Sci 53:850–866. https://doi.org/10.1287/trsc.2018.0855
Rothenbächer 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–1190. https://doi.org/10.1287/trsc.2017.0765
Salari M, Toth P, Tramontani A (2010) An ILP improvement procedure for the open vehicle routing problem. Comput Oper Res 37:2106–2120. https://doi.org/10.1016/j.cor.2010.02.010
Schneider M, Stenger A, Goeke D (2014) The electric vehicle-routing problem with time windows and recharging stations. Transp Sci 48:500–520. https://doi.org/10.1287/trsc.2013.0490
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–171. https://doi.org/10.1006/jcph.1999.6413
Silva MM, Subramanian A, Ochi LS (2015) An iterated local search heuristic for the split delivery vehicle routing problem. Comput Oper Res 53:234–249. https://doi.org/10.1016/j.cor.2014.08.005
Sitek P (2014) A hybrid approach to the two-echelon capacitated vehicle routing problem (2E-CVRP). In: Szewczyk R, Zieliński C, Kaliczyńska M (eds) Recent advances in automation, robotics and measuring techniques. Springer, Cham, pp 251–263
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–295. https://doi.org/10.1016/j.ejor.2012.03.016
Tarantilis CD, Stavropoulou F, Repoussis PP (2012) A template-based tabu search algorithm for the consistent vehicle routing problem. Expert Syst Appl 39:4233–4239. https://doi.org/10.1016/j.eswa.2011.09.111
Usberti FL, França PM, França ALM (2013) GRASP with evolutionary path-relinking for the capacitated arc routing problem. Comput Oper Res 40:3206–3217. https://doi.org/10.1016/j.cor.2011.10.014
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–489. https://doi.org/10.1016/j.cor.2012.07.018
Wang C, Mu D, Zhao F, Sutherland JW (2015) A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup–delivery and time windows. Comput Ind Eng 83:111–122. https://doi.org/10.1016/j.cie.2015.02.005
Wang Y, Ma X, Li Z et al (2017) Profit distribution in collaborative multiple centers vehicle routing problem. J Clean Prod 144:203–219. https://doi.org/10.1016/j.jclepro.2017.01.001
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
Xu Z, Cai Y (2018) Variable neighborhood search for consistent vehicle routing problem. Expert Syst Appl 113:66–76. https://doi.org/10.1016/j.eswa.2018.07.007
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–158. https://doi.org/10.1016/j.ins.2015.07.009
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–181. https://doi.org/10.1016/j.tre.2010.09.010
Yu G, Yang Y (2019) Dynamic routing with real-time traffic information. Oper Res Int J 19:1033–1058. https://doi.org/10.1007/s12351-017-0314-9
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–188. https://doi.org/10.1057/jors.2009.161
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–672. https://doi.org/10.1016/j.asoc.2016.10.006
Zachariadis EE, Kiranoudis CT (2010) An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Comput Oper Res 37:712–723. https://doi.org/10.1016/j.cor.2009.06.021
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–386. https://doi.org/10.1016/j.ejor.2015.11.018
Acknowledgements
The present work is co-funded by the European Union and Greek national funds through the Operational Program “Competitiveness, Entrepreneurship and Innovation” (EPAnEK), under the call “RESEARCH-CREATE-INNOVATE” (project code: T1ΕDK-00527 and Acronym: SMARTRANS).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Konstantakopoulos, G.D., Gayialis, S.P. & Kechagias, E.P. Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification. Oper Res Int J 22, 2033–2062 (2022). https://doi.org/10.1007/s12351-020-00600-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12351-020-00600-7