Skip to main content
SpringerLink
Log in

Review of Vehicle Routing Problems: Models, Classification and Solving Algorithms

  • Original Paper
  • Published:
Archives of Computational Methods in Engineering Aims and scope Submit manuscript

Abstract

With the rapid development of logistics industry, vehicle scheduling is the key to the optimization of transportation links. Vehicle transportation route planning is becoming more and more important to reduce logistics costs. In recent decades, the research on VRP and related derivative problems has become more and more extensive. Based on the basic VRP, this paper classifies VRP according to its characteristics and practical application. It focuses on the analysis of VRP with capacity constraint, VRP with time window, VRP with demand splitting and dynamic VRP, and gives the unified description and mathematical model of each type of problem, and then analyzes the solution methods of each type of VRP Finally, combined with other types of VRP, the future research and development trend of VRP are given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Raff S (1983) Routing and scheduling of vehicles and crews: the state of the art. Comput Oper Res 10(2):63–67

    Article  MathSciNet  Google Scholar 

  2. Solomon MDJ (1988) Time window constrained routing and scheduling problems: a survey. Transp Sci 22(1):1–11

    Article  MATH  Google Scholar 

  3. Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):231–247

    Article  MATH  Google Scholar 

  4. El-Sherbeny NA (2010) Vehicle routing with time windows: an overview of exact, heuristic and metaheuristic methods. J King Saud Univ Sci 22(3):123–131

    Article  Google Scholar 

  5. Psaraftis HN, Wen M, Kontovas CA (2016) Dynamic vehicle routing problems: three decades and counting. Wiley-Interscience 67(1):3–31

    MathSciNet  Google Scholar 

  6. Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6(1):80–91

    Article  MathSciNet  MATH  Google Scholar 

  7. Fisher (1995) Vehicle routing. In: Handbooks in operations research & management science

  8. Dorigo MMV, Colorni A (1996) Ant system: optimization by a colony of cooperative agents. IEEE Trans Syst Man Cybern 26(1):29–41

    Article  Google Scholar 

  9. Bullnheimer BHRF, Strauss C (1998) Applying the ant system to the vehicle routing problem. Paper presented at the advances and trends in local search paradigms for optimization, Boston

  10. Bullnheimer B, Hartl RF, Strauss C (1999) An improved ant system algorithm for thevehicle routing problem. Ann Oper Res 89:319–328

    Article  MathSciNet  MATH  Google Scholar 

  11. Belf JE, Mcmullen PR (2004) Ant colony optimization techniques for the vehicle routing problem. Adv Eng Inform 18(1):41–48

    Article  Google Scholar 

  12. Gajpal Y, Abad PL (2009) Multi-ant colony system (MACS) for a vehicle routing problem with backhauls. Eur J Oper Res 196(1):102–117

    Article  MATH  Google Scholar 

  13. Chen C, Ting C (2006) An improved ant colony system algorithm for the vehicle routing problem. J Chin Inst Ind Eng 23(2):115–126

    Google Scholar 

  14. Yu B, Yang ZZ, Yao B (2009) An improved ant colony optimization for vehicle routing problem. Eur J Oper Res 196(1):171–176

    Article  MATH  Google Scholar 

  15. Juan AA, Faulin J, Ruiz R, Barrios B, Caballé S (2010) The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem. Appl Soft Comput 10(1):215–224

    Article  Google Scholar 

  16. Korayem L, Khorsid M, Kassem SS (2015) Using grey wolf algorithm to solve the capacitated vehicle routing problem. IOP Conf Ser Mater Sci Eng 83(1):012–014. https://doi.org/10.1088/1757-899x/83/1/012014

    Article  Google Scholar 

  17. Ng KKH, Lee CKM, Zhang SZ, Wu K, Ho W (2017) A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion. Comput Ind Eng 109:151–168. https://doi.org/10.1016/j.cie.2017.05.004

    Article  Google Scholar 

  18. Wei L, Zhang Z, Zhang D, Lim A (2015) A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 243(3):798–814

    Article  MATH  Google Scholar 

  19. Wei L, Zhang Z, Zhang D, Leung SCH (2017) A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 265(3):843–859

    Article  MathSciNet  MATH  Google Scholar 

  20. Tao Y, Wang F (2015) An effective tabu search approach with improved loading algorithms for the 3L-CVRP. Comput Oper Res 55:127–140

    Article  MathSciNet  MATH  Google Scholar 

  21. Zhang Z, Wei L, Lim A (2015) An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints. Transp Res B Methodol 82:20–35. https://doi.org/10.1016/j.trb.2015.10.001

    Article  Google Scholar 

  22. Akpinar S (2016) Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem. Expert Syst Appl 61:28–38

    Article  Google Scholar 

  23. Sze JF, Salhi S, Wassan N (2017) The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: an effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search. Transp Res B Methodol 101:162–184. https://doi.org/10.1016/j.trb.2017.04.003

    Article  Google Scholar 

  24. Akhand MAH, Peya ZJ (2017) Capacitated vehicle routing problem solving using adaptive sweep and velocity tentative PSO. Int J Adv Comput Sci Appl 8(12):288–295

    Google Scholar 

  25. Hannan MA, Akhtar M, Begum RA et al (2018) Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm. Waste Manag 71:31–41

    Article  Google Scholar 

  26. Solomon MM (1987) Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper Res 32(2):254–265

    Article  MathSciNet  MATH  Google Scholar 

  27. Savelsbergh MWP (1985) Local search in routing problems with time windows. Ann Oper Res 4(1):285–305

    Article  MathSciNet  Google Scholar 

  28. Thangiah S et al. (1991) A genetic algorithm system for vehicle routing with time windows. Paper presented at the proceedings of the seventh conference on artificial intelligence applications Miami, Florida

  29. Blanton JL, Wainwright RL (1993) Multiple vehicle routing with time and capacity constraints using genetic algorithms. In: International conference on genetic algorithms.

  30. Koskosidis YA, Powell WB, Solomon MM (1992) An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transp Sci 26

  31. Balakrishnan N (1993) Simple heuristics for the vehicle routeing problem with soft time windows. J Oper Res Soc 44(3):279–287

    Article  MATH  Google Scholar 

  32. Taillard RD, Badeau P, Gendreau M, Guertin F, Potvin J-Y (1997) A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transp Sci 31(2):170–186

    Article  MATH  Google Scholar 

  33. Guertin F, Potvin J-Y, Taillard É (1999) Parallel Tabu search for real-time vehicle routing and dispatching. Transp Sci 33(4):381–390

    Article  MATH  Google Scholar 

  34. Kjetil F (2000) Evaluating the trade-off between the level of customer service and transportation costs in a ship scheduling problem. Marit Policy Manag 27(2):145–153

    Article  Google Scholar 

  35. Fagerholt K (2001) Ship scheduling with soft time windows: an optimisation based approach. Eur J Oper Res 131(3):559–571

    Article  MathSciNet  MATH  Google Scholar 

  36. Hashimoto H, Ibaraki T, Imahori S, Yagiura M (2006) The vehicle routing problem with flexible time windows and traveling times. Discret Appl Math 154(16):2271–2290

    Article  MathSciNet  MATH  Google Scholar 

  37. Fu Z, Eglese R, Li LYO (2008) A unified tabu search algorithm for vehicle routing problems with soft time windows. J Oper Res Soc 59(5):663–673

    Article  MATH  Google Scholar 

  38. Iqbal S, Kaykobad M, Rahman MS (2015) Solving the multi-objective vehicle routing problem with soft time windows with the help of bees. Swarm Evol Comput 24:50–64

    Article  Google Scholar 

  39. 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–775. https://doi.org/10.1016/j.ejor.2004.09.004

    Article  MathSciNet  MATH  Google Scholar 

  40. Ropkes S, Pisingerd D (2006) A unified heuristic for vehicle routing problems with backhauls. Eur J Oper Res 171(3):750–775

    Article  MathSciNet  Google Scholar 

  41. Gambardella LM, Taillard É, Agazzi G (1999) MACS-VRPTW: a multiple colony system for vehicle routing problems with time windows [M].

  42. Wang Y, Wang L, Peng Z, et al (2019) A multi ant system based hybrid heuristic algorithm for vehicle routing problem with service time customization. Swarm Evolut Comput 50

  43. Zhang H, Zhang Q, Ma L et al (2019) A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows. Inf Sci 490:166–190

    Article  MathSciNet  MATH  Google Scholar 

  44. Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts—towards memetic algorithms. Caltech Concurrent Computation Program

  45. Nagata Y, Bräysy O, Dullaert W (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput Oper Res 37(4):724–737

    Article  MATH  Google Scholar 

  46. Qi Y, Hou Z, Li H, Huang J, Li X (2015) A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows. Comput Oper Res 62:61–77

    Article  MathSciNet  MATH  Google Scholar 

  47. Nalepa J, Blocho M (2016) Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput 20(6):1–19

    Article  Google Scholar 

  48. Molina JC, Salmeron JL, Eguia I (2020) An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows. Expert Syst Appl. https://doi.org/10.1016/j.eswa.2020.113379

    Article  Google Scholar 

  49. Calvete HI, Galé C, Oliveros MJ, Sánchez-Valverde B (2007) A goal programming approach to vehicle routing problems with soft time windows. Eur J Oper Res 177(3):1720–1733

    Article  MathSciNet  MATH  Google Scholar 

  50. Tas D, Dellaert N, Van Woensel T, De Kok T (2014) The time-dependent vehicle routing problem with soft time windows and stochastic travel times. Transp Res C Emerg Technol 48:66–83

    Article  MATH  Google Scholar 

  51. Niu Y, He J, Wang Z, Xiao J (2014) A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows. Math Probl Eng 2014:1–11

    MathSciNet  MATH  Google Scholar 

  52. Xu SH, Liu JP, Zhang FH, Liang W, Sun LJ (2015) A combination of genetic algorithm and particle swarm optimization for vehicle routing problem with time windows. Sensors 15(9):21033–21053

    Article  Google Scholar 

  53. Spliet R, Dabia S, Van Woensel T (2018) The time window assignment vehicle routing problem with time-dependent travel times. Transp Sci 52(2):261–276

    Article  Google Scholar 

  54. Min H (1989) The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transp Res A General 23(5):377–386

    Article  Google Scholar 

  55. Angelelli E, Mansini R (2002) The vehicle routing problem with time windows and simultaneous pick-up and delivery. Springer

  56. Wang HF, Chen YY (2012) A genetic algorithm for the simultaneous delivery and pickup problems with time window. Comput Ind Eng 62(1):84–95

    Article  Google Scholar 

  57. Wang Y, Ma X, Lao Y, Wang Y, Mao H (2018) Vehicle routing problem: simultaneous deliveries and pickups with split loads and time windows. J Transp Res Board. https://doi.org/10.3141/2378-13

    Article  Google Scholar 

  58. Neira DA, Aguayo MM, Fuente RDl, Klapp MA (2020) New compact integer programming formulations for the multi-trip vehicle routing problem with time windows. Comput Ind Eng 144

  59. Li H, Xu Z, Zhou F (2012) A study on vehicle routing problem with fuzzy demands based on improved Tabu search. In: International conference on computational & information sciences

  60. Zulvia FE, Kuo RJ (2012) Solving CVRP with time window, fuzzy travel time and demand via a hybrid ant colony optimization and genetic algorithm. In: WCCI 2012 IEEE world congress on computational intelligence, Brisbane, Australia, vol 6, pp 10–15

  61. Chen JQ, Li WL, Murata T (2013) Particle swarm optimization for vehicle routing problem with uncertain demand. In: IEEE international conference on software engineering & service science

  62. Cao E, Lai M (2009) A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands. J Comput Appl Math 231(1):302–310

    Article  MathSciNet  MATH  Google Scholar 

  63. Kuo Z (2017) Hybrid genetic ant colony optimization algorithm for capacitated vehicle routing problem with fuzzy demand—a case study on garbage collection system. Paper presented at the 4th international conference on industrial engineering and applications

  64. Lei H, Laporte G, Guo B (2011) The capacitated vehicle routing problem with stochastic demands and time windows. Comput Oper Res

  65. Zhang J, Lam WHK, Chen BY (2016) On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows. Eur J Oper Res 249(1):144–154

    Article  MathSciNet  MATH  Google Scholar 

  66. Gutierrez A, Dieulle L, Labadie N, Velasco N (2018) A Hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands. Comput Oper Res 99:135–147

    Article  MathSciNet  MATH  Google Scholar 

  67. Salavatikhoshghalb M, Gendreau M, Jabali O et al (2019) A hybrid recourse policy for the vehicle routing problem with stochastic demands. EURO J Transp Logist 8(3):269–298

    Article  Google Scholar 

  68. Wang Y, Wang L, Chen G, Cai Z, Zhou Y, Xing L (2020) An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evol Comput. https://doi.org/10.1016/j.swevo.2020.100675

    Article  Google Scholar 

  69. Wang J, Weng T, Zhang Q (2018) A two-stage multiobjective evolutionary algorithm for multiobjective multidepot vehicle routing problem with time windows. IEEE Trans Cybern 1–12

  70. Zhen L, Ma C, a KW, Xiao L, Zhang W (2020) Multi-depot multi-trip vehicle routing problem with time windows and release dates. Transp Res E Logist Transp Rev 135

  71. Dror M, Trudeau P (1989) Savings by split delivery routing. Transp Sci 23(2):141–145

    Article  MATH  Google Scholar 

  72. Dror M, Trudeau P (1990) Split delivery routing. Nav Res Logist 37(3):383–402

    Article  MathSciNet  MATH  Google Scholar 

  73. Archetti C, Speranza MG (2012) Vehicle routing problems with split deliveries. Int Trans Oper Res 19(1–2):3–22. https://doi.org/10.1111/j.1475-3995.2011.00811.x

    Article  MathSciNet  MATH  Google Scholar 

  74. Dror M, Laporte G, Trudeau P (1994) Vehicle routing with split deliveries. Discret Appl Math 50(3):239–254

    Article  MathSciNet  MATH  Google Scholar 

  75. Jin M, Liu K, Bowden RO (2007) A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem. Int J Prod Econ 105(1):228–242

    Article  Google Scholar 

  76. Moreno L, AragãO MPD, Uchoa E (2010) Improved lower bounds for the split delivery vehicle routing problem. Oper Res Lett 38(4):302–306

    Article  MathSciNet  MATH  Google Scholar 

  77. Archetti C, Bouchard M, Desaulniers G (2011) Enhanced branch and price and cut for vehicle routing with split deliveries and time windows. Transp Sci 54

  78. Archetti C, Bianchessi N, Speranza MG (2014) Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur J Oper Res 238(3):685–698

    Article  MathSciNet  MATH  Google Scholar 

  79. Belenguer JM, Martinez MC, Mota E (2000) A lower bound for the split delivery vehicle routing problem. Oper Res 48(5):801–810

    Article  MathSciNet  MATH  Google Scholar 

  80. Gulczynski D, Golden B, Wasil E (2010) The split delivery vehicle routing problem with minimum delivery amounts. Transp Res E Logist Transp Rev 46(5):612–626

    Article  MATH  Google Scholar 

  81. Xiong Y, Gulczynski D, Kleitman D, Golden B, Wasil E (2012) A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts. Optim Lett 7(7):1597–1609. https://doi.org/10.1007/s11590-012-0554-9

    Article  MathSciNet  MATH  Google Scholar 

  82. Han FW, Chu YC (2016) A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts. Transp Res E Logist Transp Rev 88:11–31

    Article  Google Scholar 

  83. Chen P, Golden B, Wang X, Wasil E (2017) A novel approach to solve the split delivery vehicle routing problem. Int Trans Oper Res 24(1–2):27–41. https://doi.org/10.1111/itor.12250

    Article  MathSciNet  MATH  Google Scholar 

  84. Khmelev A, Kochetov Y (2015) A hybrid VND method for the split delivery vehicle routing problem. Electron Notes Discrete Math 47:5–12

    Article  MathSciNet  MATH  Google Scholar 

  85. Ho SC, Haugland D (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput Oper Res 31(12):1947–1964

    Article  MATH  Google Scholar 

  86. Archetti C, Bouchard M, Desaulniers G (2010) Enhanced branch and price and cut for vehicle routing with split deliveries and time windows. Transp Sci 45(3):285–298

    Article  Google Scholar 

  87. Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper Res 58(1):179–192

    Article  MathSciNet  MATH  Google Scholar 

  88. Luo Z, Qin H, Zhu W, Lim A (2016) Branch and price and cut for the split-delivery vehicle routing problem with time windows and linear weight-related cost. Transp Sci 51(2):668–687

    Article  Google Scholar 

  89. Salani M, Vacca I (2011) Branch and price for the vehicle routing problem with discrete split deliveries and time windows. Eur J Oper Res 213(3):470–477

    Article  MathSciNet  MATH  Google Scholar 

  90. Luo Z, Qin H, Zhu W, Lim A (2017) Branch and price and cut for the split-delivery vehicle routing problem with time windows and linear weight-related cost. Transp Sci 51(2):668–687

    Article  Google Scholar 

  91. Bianchessi N, Irnich S (2019) Branch-and-cut for the split delivery vehicle routing problem with time windows. Transp Sci 53(2):1–26

    Article  MATH  Google Scholar 

  92. Mitra S (2005) An algorithm for the generalized vehicle routing problem with backhauling. Asia Pac J Oper Res 22(2):153–169. https://doi.org/10.1142/s0217595905000522

    Article  MathSciNet  MATH  Google Scholar 

  93. Nowak M, Ergun Z, White CC (2008) Pickup and delivery with split loads. Transp Sci 42(1):32–43

    Article  Google Scholar 

  94. Chen Q, Li K, Liu Z (2014) Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads. Transp Res E Logist Transp Rev 69:218–235

    Article  Google Scholar 

  95. Wang Y, Ma X-l, Lao Y-t, Yu H-y, Liu Y (2014) A two-stage heuristic method for vehicle routing problem with split deliveries and pickups %J Frontiers of Information Technology & Electronic Engineering. J Zhejiang Univ SCI C (Comput Electron) 15(3):200–210

    Article  Google Scholar 

  96. Wang K, Ye C, Ning A (2015) Achieving better solutions for vehicle routing problem involving split deliveries and pickups using a competitive decision algorithm. Asia Pac J Oper Res 32(4):1550022

    Article  MathSciNet  MATH  Google Scholar 

  97. Golden BL, Assad AA (1988) Vehicle routing: methods and studies. Elsevier Science Publishers, Amsterdam

    MATH  Google Scholar 

  98. Bertsimas, Dimitris J, Ryzin V, Garrett (1991) A stochastic and dynamic vehicle routing problem in the Euclidean plane. INFORMS

  99. Bertsimas DJ, Gv R (1993) Stochastic and dynamic vehicle routing in the euclidean plane with multiple capacitated vehicles. Oper Res 41(1):60–76

    Article  MathSciNet  MATH  Google Scholar 

  100. Psaraftis HN (1995) Dynamic vehicle routing: Status and prospects. Ann Oper Res 61(1):143–164

    Article  MATH  Google Scholar 

  101. Bertsimas DJS-L (1996) A new generation of vehicle routing: robust algorithms, addressing uncertainty. Oper Res 44(2):286–304

    Article  MathSciNet  MATH  Google Scholar 

  102. Gendreau MPJ (1998) Fleet management and logistics. Kluwer Academic Publishers, Boston

    Google Scholar 

  103. Psaraftis HN, Wen M, Kontovas CA (2016) Dynamic vehicle routing problems: three decades and counting. Networks 67(1):3–31. https://doi.org/10.1002/net.21628

    Article  MathSciNet  Google Scholar 

  104. Ghiani G, Guerriero F, Laporte G, Musmanno R (2003) Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies. Eur J Oper Res 151(1):1–11

    Article  MATH  Google Scholar 

  105. Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1–11. https://doi.org/10.1016/j.ejor.2012.08.015

    Article  MathSciNet  MATH  Google Scholar 

  106. Teodorovi D, Pavkovi G (1996) The fuzzy set theory approach to the vehicle routing problem when demand at nodes is uncertain. Fuzzy Sets Syst 82(3):307–317

    Article  MathSciNet  Google Scholar 

  107. Pavone M, Bisnik N, Frazzoli E, Isler V (2009) A stochastic and dynamic vehicle routing problem with time windows and customer impatience. Mob Netw Appl 14(3):350–364

    Article  Google Scholar 

  108. Schyns M (2015) An ant colony system for responsive dynamic vehicle routing. Eur J Oper Res 245(3):704–718. https://doi.org/10.1016/j.ejor.2015.04.009

    Article  MathSciNet  MATH  Google Scholar 

  109. Gaur DR, Mudgal A, Singh RR (2020) Improved approximation algorithms for cumulative VRP with stochastic demands. Discret Appl Math 280:133–143

    Article  MathSciNet  MATH  Google Scholar 

  110. Dinh T, Fukasawa R, Luedtke JR (2018) Exact algorithms for the chance-constrained vehicle routing problem. Math Program 172:105–138

    Article  MathSciNet  MATH  Google Scholar 

  111. Lalla-Ruiz E, Mes M (2020) Mathematical formulations and improvements for the multi-depot open vehicle routing problem. Optim Lett. https://doi.org/10.1007/s11590-020-01594-z

    Article  MATH  Google Scholar 

  112. Soto-Mendoza V, García-Calvillo I, Ruiz-y-Ruiz E, Pérez-Terrazas J (2020) A hybrid grasshopper optimization algorithm applied to the open vehicle routing problem. Algorithms. https://doi.org/10.3390/a13040096

    Article  Google Scholar 

  113. Kara İ, Kara BY, Yetis MK (2007) Energy minimizing vehicle routing problem. In: International conference on combinatorial optimization & applications, pp 62–71

  114. Bekta T, Laporte G (2011) The pollution-routing problem. Transp Res B Methodol 45(8):1250

    Google Scholar 

  115. Erdoğan S, Miller-Hooks E (2012) A green vehicle routing problem. Transp Res E Logist Transp Rev 48(1):114

    Article  Google Scholar 

  116. Shuai Z, Gajpal Y, Appadoo SS (2018) A meta-heuristic for capacitated green vehicle routing problem. Ann Oper Res 269(9):1–19

    MathSciNet  MATH  Google Scholar 

  117. Cattaruzza D, Absi N, Feillet D (2018) Vehicle routing problems with multiple trips. Ann Oper Res 14(3):223–259. https://doi.org/10.1007/s10288-016-0306-2

    Article  MathSciNet  MATH  Google Scholar 

  118. Pinto T, Alves C, Carvalho JVd (2020) Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls. Int Trans Oper Res 27(1):549–572

    Article  MathSciNet  Google Scholar 

  119. Cao E-b, Lai M-y (2007) Vehicle routing problem with simultaneous delivery and pick-up with time windows. In: 1st international conference on transportation engineering.

  120. Lai M, Cao E (2010) An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows. Eng Appl Artif Intell 23(2):188–195

    Article  Google Scholar 

  121. 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

    Article  Google Scholar 

  122. Lee C-G, Epelman MA, White CC, Bozer YA (2006) A shortest path approach to the multiple-vehicle routing problem with split pick-ups. Transp Res B Methodol 40(4):265–284. https://doi.org/10.1016/j.trb.2004.11.004

    Article  Google Scholar 

  123. Chen S, Golden B, Wasil E (2007) The split delivery vehicle routing problem: applications, algorithms, test problems, and computational results. Networks 49(4):318–329. https://doi.org/10.1002/net.20181

    Article  MathSciNet  MATH  Google Scholar 

  124. Archetti C, Speranza MG, Savelsbergh MWP (2008) An optimization-based heuristic for the split delivery vehicle routing problem. Transp Sci 42(1):22–31

    Article  Google Scholar 

  125. Jin M, Kai L, Eksioglu B (2008) A column generation approach for the split delivery vehicle routing problem. Networks 36(2):265–270

    MathSciNet  MATH  Google Scholar 

  126. Bortfeldt A, Yi J (2020) The split delivery vehicle routing problem with three-dimensional loading constraints. Eur J Oper Res 282(2):545–558. https://doi.org/10.1016/j.ejor.2019.09.024

    Article  MathSciNet  MATH  Google Scholar 

  127. Archetti C, Speranza MG, Hertz A (2006) A tabu search algorithm for the split delivery vehicle routing problem. Transp Sci 40(1):64–73

    Article  Google Scholar 

  128. Derigs U, Li B, Vogel U (2010) Local search-based metaheuristics for the split delivery vehicle routing problem. J Oper Res Soc 61(9):1356–1364

    Article  Google Scholar 

  129. Aleman RE, Zhang X, Hill RR (2010) An adaptive memory algorithm for the split delivery vehicle routing problem. Journal of Heuristics 16(3):441–473

    Article  MATH  Google Scholar 

  130. Aleman REHRR (2010) A tabu search with vocabulary building approach or the vehicle routing problem with split demands. Int J Meta-heuristics 1(1):55–80

    MATH  Google Scholar 

  131. Qiu M, Fu Z, Eglese R, Tang Q (2019) A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups. Comput Oper Res

  132. Wilck Iv JH, Cavalier TM (2012) A genetic algorithm for the split delivery vehicle routing problem. American Journal of Operations Research 02(02):207–216. https://doi.org/10.4236/ajor.2012.22024

    Article  Google Scholar 

  133. Berbotto L, García S, Nogales FJJAOOR (2014) A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem. Ann Oper Res 222(1):153–173

    Article  MathSciNet  MATH  Google Scholar 

  134. 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

    Article  MathSciNet  MATH  Google Scholar 

  135. Rajappa GP, Wilck JH, Bell JE (2016) An ant colony optimization and hybrid metaheuristics algorithm to solve the split delivery vehicle routing problem. Int J Appl Ind Eng 3:55–73. https://doi.org/10.4018/IJAIE.2016010104

    Article  Google Scholar 

  136. Shi J, Zhang J, Wang K, Fang X (2018) Particle Swarm Optimization for Split Delivery Vehicle Routing Problem. Asia Pac J Oper Res 35(2):18400061840001–18400061840042. https://doi.org/10.1142/S0217595918400067

    Article  MathSciNet  MATH  Google Scholar 

  137. Campos V, Corberán A, Mota E (2008) A scatter search algorithm for the split delivery vehicle routing problem. Adv Comput Intell Transp Logist Supply Chain Manag 144:137–152

    Google Scholar 

  138. Yan SY, Chu JC, Hsiao FY et al (2015) A planning model and solution algorithm for multi-trip split-delivery vehicle routing and scheduling problems with time windows. Comput Ind Eng 87:383–393

    Article  Google Scholar 

  139. Chen P, Golden B, Wang X, Wasil E (2016) A novel approach to solve the split delivery vehicle routing problem. Int Trans Oper Res

  140. Li J, Qin H, Baldacci R, Zhu W (2020) Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows. Transp Res E Logist Transp Rev. https://doi.org/10.1016/j.tre.2020.101955

    Article  Google Scholar 

  141. Gu W, Cattaruzza D, Ogier M, Semet F (2019) Adaptive large neighborhood search for the commodity constrained split delivery VRP. Comput Oper Res. https://doi.org/10.1016/j.cor.2019.07.019

    Article  MathSciNet  MATH  Google Scholar 

  142. Ortega EJA, Schilde M, Doerner KF (2020) Matheuristic search techniques for the consistent inventory routing problem with time windows and split deliveries. Oper Res Perspect. https://doi.org/10.1016/j.orp.2020.100152

    Article  MathSciNet  Google Scholar 

  143. Pillac V, Guéret C, Medaglia AL (2012) An event-driven optimization framework for dynamic vehicle routing. Decis Support Syst 54(1):414–423

    Article  Google Scholar 

  144. Hu ZH, Sheu JB, Zhao L et al (2015) A dynamic closed-loop vehicle routing problem with uncertainty and incompatible goods. Transp Res Part C 55(6):273–297

    Article  Google Scholar 

  145. Abdallah AMFM, Essam DL, Sarker RA (2017) On solving periodic re-optimization dynamic vehicle routing problems. Appl Soft Comput 55:1–12

    Article  Google Scholar 

  146. De Armas J, Melián-Batista B (2015) Variable neighborhood search for a dynamic rich vehicle routing problem with time windows. Comput Ind Eng 85:120–131. https://doi.org/10.1016/j.cie.2015.03.006

    Article  Google Scholar 

  147. Kuo RJ, Wibowo BS, Zulvia FE (2016) Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time. Appl Math Model 40(23–24):9990–10001. https://doi.org/10.1016/j.apm.2016.06.025

    Article  MathSciNet  MATH  Google Scholar 

  148. Ghannadpour SF, Noori S, Tavakkoli-Moghaddam R, Ghoseiri K (2014) A multi-objective dynamic vehicle routing problem with fuzzy time windows: model, solution and application. Appl Soft Comput 14(1):504–527. https://doi.org/10.1016/j.asoc.2013.08.015

    Article  Google Scholar 

  149. Chen S, Chen R, Wang G-G, Gao J, Sangaiah AK (2018) An adaptive large neighborhood search heuristic for dynamic vehicle routing problems. Comput Electr Eng 67:596–607. https://doi.org/10.1016/j.compeleceng.2018.02.049

    Article  Google Scholar 

  150. Angelelli E, Bianchessi N, Mansini R, Speranza MG (2009) Short term strategies for a dynamic multi-period routing problem. Transp Res C Emerg Technol 17(2):106–119

    Article  MATH  Google Scholar 

  151. Albareda-Sambola M, Fernández E, Laporte G (2014) The dynamic multiperiod vehicle routing problem with probabilistic information. Comput Oper Res 48:31–39. https://doi.org/10.1016/j.cor.2014.02.010

    Article  MATH  Google Scholar 

  152. Ulmer MW, Soeffker N, Mattfeld DC (2018) Value function approximation for dynamic multi-period vehicle routing. Eur J Oper Res 269(3):883–899. https://doi.org/10.1016/j.ejor.2018.02.038

    Article  MathSciNet  MATH  Google Scholar 

  153. Slater A (2002) Specification for a dynamic vehicle routing and scheduling system. Int J Transp Manag 1(1):29–40

    Google Scholar 

  154. Okulewicz M, Mańdziuk J (2017) The impact of particular components of the PSO-based algorithm solving the dynamic vehicle routing problem. Appl Soft Comput 58:586–604. https://doi.org/10.1016/j.asoc.2017.04.070

    Article  Google Scholar 

  155. Kim S, Lewis ME, White CC (2005) Optimal vehicle routing with real-time traffic information. IEEE Trans Intell Transp Syst 6(2):178–188. https://doi.org/10.1109/tits.2005.848362

    Article  Google Scholar 

  156. Guner AR, Murat A, Chinnam RB (2012) Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information. Comput Oper Res 39(2):358–373

    Article  Google Scholar 

  157. Li J-Q, Mirchandani PB, Borenstein D (2009) Real-time vehicle rerouting problems with time windows. Eur J Oper Res 194(3):711–727. https://doi.org/10.1016/j.ejor.2007.12.037

    Article  MathSciNet  MATH  Google Scholar 

  158. Taniguchi E, Shimamoto H (2004) Intelligent transportation system based dynamic vehicle routing and scheduling with variable travel times. Transp Res C Emerg Technol 12(3–4):235–250. https://doi.org/10.1016/j.trc.2004.07.007

    Article  Google Scholar 

  159. Nakamura Y, Taniguchi E, Yamada T, Ando N (2010) Selecting a dynamic and stochastic path method for vehicle routing and scheduling problems. Paper presented at the the 6th Int Conf on city logistics, Puerto Vallarta

  160. Qureshi AG, Taniguchi E, Yamada T (2012) A microsimulation based analysis of exact solution of dynamic vehicle routing with soft time windows. Procedia Soc Behav Sci 39:205–216. https://doi.org/10.1016/j.sbspro.2012.03.102

    Article  Google Scholar 

  161. Davis LC (2017) Dynamic origin-to-destination routing of wirelessly connected, autonomous vehicles on a congested network. Phys A 478:93–102. https://doi.org/10.1016/j.physa.2017.02.030

    Article  MATH  Google Scholar 

  162. Wang J, Niu H (2018) A distributed dynamic route guidance approach based on short-term forecasts in cooperative infrastructure-vehicle systems. Transp Res D Transp Environ

  163. Núñez A, Sáez D, Cortés CE (2008) Hybrid predictive control for the vehicle dynamic routing problem based on evolutionary multi objective optimization(EMO). Paper presented at the Proc of the 17th world congress int federation of automatic control. The International Federation of Automatic Control, Seoul, Korea

  164. Potvin J-Y, Xu Y, Benyahia I (2006) Vehicle routing and scheduling with dynamic travel times. Comput Oper Res 33(4):1129–1137. https://doi.org/10.1016/j.cor.2004.09.015

    Article  MATH  Google Scholar 

  165. Fleischmann B, Gnutzmann S, Sandvoß E (2004) Dynamic vehicle routing based on online traffic information. Transp Sci 38(4):420–433

    Article  Google Scholar 

  166. Chen H-K, Hsueh C-F, Chang M-S (2006) The real-time time-dependent vehicle routing problem. Transp Res E Logist Transp Rev 42(5):383–408. https://doi.org/10.1016/j.tre.2005.01.003

    Article  Google Scholar 

  167. Wohlgemuth S, Oloruntoba R, Clausen U (2012) Dynamic vehicle routing with anticipation in disaster relief. Socioecon Plann Sci 46(4):261–271

    Article  Google Scholar 

  168. Kilby PPP, Shaw P (1998) Dynamic VRPs: a study of scenarios. University of Strathclyde

  169. Chen Z, Xu H (2006) Dynamic column generation for dynamic vehicle routing with time windows. Transp Sci 40(1):74–88. https://doi.org/10.1287/trsc.1050.0133

    Article  Google Scholar 

  170. Secomandi N (2000) Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput Oper Res 27(11–12):1201–1225

    Article  MATH  Google Scholar 

  171. Godfrey GA, Powell WB (2002) An adaptive dynamic programming algorithm for dynamic fleet management, I: single period travel times. Transp Sci 36(1):21–39

    Article  MATH  Google Scholar 

  172. Novoa C, Storer R (2009) An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur J Oper Res 196(2):509–515. https://doi.org/10.1016/j.ejor.2008.03.023

    Article  MATH  Google Scholar 

  173. Ichoua S, Gendreau M, Potvin JY (2006) Exploiting knowledge about future demands for real-time vehicle dispatching. Transp Sci 40(2)

  174. Gendreau M, Guertin F, Potvin JY, Seguin R (2006) Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transp Res C Emerg Technol 14(3):157–174

    Article  Google Scholar 

  175. Azi N, Gendreau M, Potvin JY (2012) A dynamic vehicle routing problem with multiple delivery routes. Ann Oper Res 199:103–112

    Article  MathSciNet  MATH  Google Scholar 

  176. Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Optim 10(4):327–343

    Article  MathSciNet  MATH  Google Scholar 

  177. Hanshar FT, Ombuki-Berman BM (2007) Dynamic vehicle routing using genetic algorithms. Appl Intell 27(1):89–99. https://doi.org/10.1007/s10489-006-0033-z

    Article  MATH  Google Scholar 

  178. Barkaoui M, Gendreau M (2013) An adaptive evolutionary approach for real-time vehicle routing and dispatching. Comput Oper Res 40(7):1766–1776

    Article  MathSciNet  MATH  Google Scholar 

  179. Cortes CE, Saez D, Nunez A, Munoz-Carpintero D (2009) Hybrid adaptive predictive control for a dynamic pickup and delivery problem. Transp Sci 43(1):27–42

    Article  Google Scholar 

  180. Khouadjia MR, Alba E, Jourdan L, Talbi EG (2010) Multi-swarm optimization for dynamic combinatorial problems: a case study on dynamic vehicle routing problem. In: Swarm intelligence—7th international conference, ANTS 2010, Brussels, Belgium, 8–10 Sept 2010. Proceedings.

  181. Sabar NR, Bhaskar A, Chung E, Turky A, Song A (2019) A self-adaptive evolutionary algorithm for dynamic vehicle routing problems with traffic congestion. Swarm Evol Comput 44:1018–1027. https://doi.org/10.1016/j.swevo.2018.10.015

    Article  Google Scholar 

  182. Elhassania M, Jaouad B, Ahmed EA (2013) A new hybrid algorithm to solve the vehicle routing problem in the dynamic environment. Int J Soft Comput 8(5):327–334

    Google Scholar 

  183. Euchi J, Yassine A, Chabchoub H (2015) The dynamic vehicle routing problem: solution with hybrid metaheuristic approach. Swarm Evol Comput 21:41–53. https://doi.org/10.1016/j.swevo.2014.12.003

    Article  Google Scholar 

  184. Gao S, Wang Y, Cheng J, Inazumi Y, Tang Z (2016) Ant colony optimization with clustering for solving the dynamic location routing problem. Appl Math Comput 285:149–173

    MathSciNet  MATH  Google Scholar 

  185. Bent RW, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper Res 52(6):977–987

    Article  MATH  Google Scholar 

  186. Mańdziuk J, Żychowski A (2016) A memetic approach to vehicle routing problem with dynamic requests. Appl Soft Comput 48:522–534

    Article  Google Scholar 

Download references

Acknowledgements

This paper is supported by the Graduate Innovation Foundation of Jiangsu Province under Grant No. KYLX16_0781, the Natural Science Foundation of Jiangsu Province under Grants No. BK20181340, the 111 Project under Grants No. B12018, and PAPD of Jiangsu Higher Education Institutions.

Author information

Authors and Affiliations

  1. Key Laboratory of Advanced Process Control for Light Industry (Jiangnan University), Ministry of Education, Wuxi, 214122, China

    Haifei Zhang, Hongwei Ge & Jinlong Yang

  2. School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi, 214122, Jiangsu, China

    Haifei Zhang, Hongwei Ge & Jinlong Yang

  3. Medical Image Processing Group, Department of Radiology, University of Pennsylvania, Philadelphia, PA, 19104, USA

    Yubing Tong

Authors
  1. Haifei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hongwei Ge
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jinlong Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yubing Tong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hongwei Ge.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, H., Ge, H., Yang, J. et al. Review of Vehicle Routing Problems: Models, Classification and Solving Algorithms. Arch Computat Methods Eng 29, 195–221 (2022). https://doi.org/10.1007/s11831-021-09574-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11831-021-09574-x

Search

Navigation