Skip to main content

Advertisement

SpringerLink
Log in

Vehicle routing problems over time: a survey

  • Invited Survey
  • Published:
4OR Aims and scope Submit manuscript

Abstract

In vehicle routing problems (VRPs) the decisions to be taken concern the assignment of customers to vehicles and the sequencing of the customers assigned to each vehicle. Additional decisions may need to be jointly taken, depending on the specific problem setting. In this paper, after discussing the different kinds of decisions taken in different classes of VRPs, the class where the decision about when the routes start from the depot has to be taken is considered and the related literature is reviewed. This class of problems, that we call VRPs over time, includes the periodic routing problems, the inventory routing problems, the vehicle routing problems with release dates, and the multi-trip vehicle routing problems.

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

Similar content being viewed by others

References

  • Abdul Rahim MKI, Zhong Y, Aghezzaf E-H, Aouam T (2014) Modelling and solving the multiperiod inventory-routing problem with stochastic stationary demand rates. Int J Prod Res 52:4351–4363

    Article  Google Scholar 

  • Aksen D, Kaya O, Salman FS, Tüncel Ö (2014) An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. Eur J Oper Res 239:413–426

    Article  Google Scholar 

  • Andersson H, Hoff A, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: combined inventory management and routing. Comput Oper Res 37:1515–1536

    Article  Google Scholar 

  • Andersson H, Christiansen M, Desaulniers G (2016) A new decomposition algorithm for a liquefied natural gas inventory routing problem. Int J Prod Res 54:564–578

    Article  Google Scholar 

  • Archetti C, Speranza MG (2012) Vehicle routing problems with split deliveries. Int Trans Oper Res 19:3–22

    Article  Google Scholar 

  • Archetti C, Speranza MG (2016) The inventory routing problem: the value of integration. Int Trans Oper Res 23:393–407

    Article  Google Scholar 

  • Archetti C, Savelsbergh MWP, Speranza MG (2006) Worst-case analysis for split delivery vehicle routing problems. Transp Sci 40:226–234

    Article  Google Scholar 

  • Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transp Sci 41:382–391

    Article  Google Scholar 

  • Archetti C, Bianchessi N, Irnich S, Speranza MG (2014a) Formulations for an inventory routing problem. Int Trans Oper Res 21:353–374

    Article  Google Scholar 

  • Archetti C, Speranza MG, Vigo D (2014b)Chapter 10: vehicle routing problems with profits. In: Vehicle routing: problems, methods, and applications, 2nd ed., pp 273–297. SIAM

  • Archetti C, Feillet D, Speranza MG (2015a) Complexity of routing problems with release dates. Eur J Oper Res 247:797–803

    Article  Google Scholar 

  • Archetti C, Jabali O, Speranza MG (2015b) Multi-period vehicle routing problem with due dates. Comput Oper Res 61:122–134

    Article  Google Scholar 

  • Archetti C, Fernández E, Huerta-Muñoz DL (2017) The flexible periodic vehicle routing problem. Comput Oper Res 85:58–70

    Article  Google Scholar 

  • Archetti C, Christiansen M, Speranza MG (2018a) Inventory routing with pickups and deliveries. Eur J Oper Res 268:314–324

    Article  Google Scholar 

  • Archetti C, Feillet D, Mor A, Speranza MG (2018b) An iterated local search for the traveling salesman problem with release dates and completion time minimization. Comput Oper Res 98:24–37

    Article  Google Scholar 

  • Archetti C, Feillet D, Mor A, Speranza MG (2020) Dynamic traveling salesman problem with stochastic release dates. Eur J Oper Res 280:832–844

    Article  Google Scholar 

  • Azadeh A, Elahi S, Farahani MH, Nasirian B (2017) A genetic algorithm-taguchi based approach to inventory routing problem of a single perishable product with transshipment. Comput Ind Eng 104:124–133

    Article  Google Scholar 

  • Baldacci R, Bartolini E, Mingozzi A, Valletta A (2011) An exact algorithm for the period routing problem. Oper Res 59:228–241

    Article  Google Scholar 

  • Bektaş T, Laporte G, Vigo D (2015) Integrated vehicle routing problems. Comput Oper Res 55:126

    Article  Google Scholar 

  • Bell WJ, Dalberto LM, Fisher ML, Greenfield AJ, Jaikumar R, Kedia P, Mack RG, Prutzman PJ (1983) Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13:4–23

    Article  Google Scholar 

  • Beltrami EJ, Bodin LD (1974) Networks and vehicle routing for municipal waste collection. Networks 4:65–94

    Article  Google Scholar 

  • Bertazzi L, Speranza MG (2012) Inventory routing problems: an introduction. EURO J Transp Logist 1:307–326

    Article  Google Scholar 

  • Bertazzi L, Speranza MG (2013) Inventory routing problems with multiple customers. EURO J Transp Logist 2:255–275

    Article  Google Scholar 

  • Bertazzi L, Bosco A, Laganà D (2015) Managing stochastic demand in an inventory routing problem with transportation procurement. Omega 56:112–121

    Article  Google Scholar 

  • Bertazzi L, Laganà D, Coelho LC, De Maio A (2017) The multi-depot inventory routing problem: An application of vendor-management inventory in city logistic. CIRRELT-2017-54

  • 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

    Article  Google Scholar 

  • Caceres-Cruz J, Arias P, Guimarans D, Riera D, Juan AA (2015) Rich vehicle routing problem: survey. ACM Comput surv (CSUR) 47:32

    Article  Google Scholar 

  • Campbell AM, Wilson JH (2014) Forty years of periodic vehicle routing. Networks 63:2–15

    Article  Google Scholar 

  • Cantu-Funes R, Salazar-Aguilar MA, Boyer V (2018) Multi-depot periodic vehicle routing problem with due dates and time windows. J Oper Res Soc 69:296–306

    Article  Google Scholar 

  • Cattaruzza D, Absi N, Feillet D (2016a) The multi-trip vehicle routing problem with time windows and release dates. Transp Sci 50:676–693

    Article  Google Scholar 

  • Cattaruzza D, Absi N, Feillet D (2016b) Vehicle routing problems with multiple trips. 4OR 14:223–259

    Article  Google Scholar 

  • Christofides N, Beasley JE (1984) The period routing problem. Networks 14:237–256

    Article  Google Scholar 

  • Chu JC, Yan S, Huang H-J (2017) A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times. Netw Spat Econ 17:41–68

    Article  Google Scholar 

  • Coelho LC, Laporte G (2014a) Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int J Prod Econ 155:391–397

    Article  Google Scholar 

  • Coelho LC, Laporte G (2014b) Optimal joint replenishment, delivery and inventory management policies for perishable products. Comput Oper Res 47:42–52

    Article  Google Scholar 

  • Coelho LC, Cordeau J-F, Laporte G (2013) Thirty years of inventory routing. Transp Sci 48:1–19

    Article  Google Scholar 

  • Coelho LC, Cordeau J-F, Laporte G (2014) Heuristics for dynamic and stochastic inventory-routing. Comput Oper Res 52:55–67

    Article  Google Scholar 

  • Corberán Á, Laporte G (2013) Arc routing: problems, methods, and applications. SIAM, New Delhi

    Google Scholar 

  • Cordeau J-F, Laganà D, Musmanno R, Vocaturo F (2015) A decomposition-based heuristic for the multiple-product inventory-routing problem. Comput Oper Res 55:153–166

    Article  Google Scholar 

  • Crama Y, Rezaei M, Savelsbergh M, Van Woensel T (2018) Stochastic inventory routing for perishable products. Transp Sci 52:526–546

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Desaulniers G, Rakke JG, Coelho LC (2015) A branch-price-and-cut algorithm for the inventory-routing problem. Transp Sci 50:1060–1076

    Article  Google Scholar 

  • Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57:1472–1483

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, Berlin

    Book  Google Scholar 

  • Iassinovskaia G, Limbourg S, Riane F (2017) The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains. Int J Prod Econ 183:570–582

    Article  Google Scholar 

  • Jayakumar DN, Grzybowska H, Rey D, Dixit V (2016) Food rescue and delivery: Heuristic algorithm for periodic unpaired pickup and delivery vehicle routing problem. Transp Res Rec J Transp Res Board 2548:81–89

    Article  Google Scholar 

  • Juan AA, Grasman SE, Caceres-Cruz J, Bektaş T (2014) A simheuristic algorithm for the single-period stochastic inventory-routing problem with stock-outs. Simul Model Pract Theory 46:40–52

    Article  Google Scholar 

  • Klapp MA, Erera AL, Toriello A (2016) The one-dimensional dynamic dispatch waves problem. Transp Sci 52:402–415

    Article  Google Scholar 

  • Klapp MA, Erera AL, Toriello A (2018) The dynamic dispatch waves problem for same-day delivery. Eur J Oper Res. https://doi.org/10.1016/j.ejor.2018.05.032

  • Lacomme P, Prins C, Ramdane-Chérif W (2005) Evolutionary algorithms for periodic arc routing problems. Eur J Oper Res 165:535–553

    Article  Google Scholar 

  • Laganà D, Longo F, Santoro F (2015) Multi-product inventory-routing problem in the supermarket distribution industry. Int J Food Eng 11:747–766

    Article  Google Scholar 

  • Lahyani R, Khemakhem M, Semet F (2015) Rich vehicle routing problems: from a taxonomy to a definition. Eur J Oper Res 241:1–14

    Article  Google Scholar 

  • Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43:408–416

    Article  Google Scholar 

  • Li K, Chen B, Sivakumar AI, Wu Y (2014) An inventory-routing problem with the objective of travel time minimization. Eur J Oper Res 236:936–945

    Article  Google Scholar 

  • Liu L, Li K, Liu Z (2017) A capacitated vehicle routing problem with order available time in e-commerce industry. Eng Optim 49:449–465

    Article  Google Scholar 

  • Liu S, Qin S, Zhang R (2018) A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows. Transp Res Part E Logist Transp Rev 116:25–41

    Article  Google Scholar 

  • Liu S-C, Lu M-C, Chung C-H (2016) A hybrid heuristic method for the periodic inventory routing problem. Int J Adv Manuf Technol 85:2345–2352

    Article  Google Scholar 

  • Mes M, Schutten M, Rivera AP (2014) Inventory routing for dynamic waste collection. Waste Manage (Oxford) 34:1564–1576

    Article  Google Scholar 

  • Mirabi M (2014) A hybrid electromagnetism algorithm for multi-depot periodic vehicle routing problem. Int J Adv Manuf Technol 71:509–518

    Article  Google Scholar 

  • Mjirda A, Jarboui B, Macedo R, Hanafi S, Mladenović N (2014) A two phase variable neighborhood search for the multi-product inventory routing problem. Comput Oper Res 52:291–299

    Article  Google Scholar 

  • Montagné R, Gamache M, Gendreau M (2018) A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection. J Oper Res Soc, pp. 1–12

  • Moons S, Ramaekers K, Caris A, Arda Y (2018) Integration of order picking and vehicle routing in a b2c e-commerce context. Flex Serv Manuf J 30:813–843

    Article  Google Scholar 

  • Nguyen PK, Crainic TG, Toulouse M (2014) A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows. J Heuristics 20:383–416

    Article  Google Scholar 

  • Nguyen PK, Crainic TG, Toulouse M (2017) Multi-trip pickup and delivery problem with time windows and synchronization. Ann Oper Res 253:899–934

    Article  Google Scholar 

  • Niakan F, Rahimi M (2015) A multi-objective healthcare inventory routing problem; a fuzzy possibilistic approach. Transp Res Part E Logist Transp Rev 80:74–94

    Article  Google Scholar 

  • Nolz PC, Absi N, Feillet D (2014a) A bi-objective inventory routing problem for sustainable waste management under uncertainty. J Multi-Criteria Decis Anal 21:299–314

    Article  Google Scholar 

  • Nolz PC, Absi N, Feillet D (2014b) A stochastic inventory routing problem for infectious medical waste collection. Networks 63:82–95

    Article  Google Scholar 

  • Noor NM, Shuib A (2015) Multi-depot instances for inventory routing problem using clustering techniques. J Ind Intell Inf. https://doi.org/10.12720/jiii.3.2.97-101

  • Norouzi N, Sadegh-Amalnick M, Alinaghiyan M (2015) Evaluating of the particle swarm optimization in a periodic vehicle routing problem. Measurement 62:162–169

    Article  Google Scholar 

  • Papageorgiou DJ, Cheon M-S, Nemhauser G, Sokol J (2014a) Approximate dynamic programming for a class of long-horizon maritime inventory routing problems. Transp Sci 49:870–885

    Article  Google Scholar 

  • Papageorgiou DJ, Keha AB, Nemhauser GL, Sokol J (2014b) Two-stage decomposition algorithms for single product maritime inventory routing. INFORMS J Comput 26:825–847

    Article  Google Scholar 

  • Park Y-B, Yoo J-S, Park H-S (2016) A genetic algorithm for the vendor-managed inventory routing problem with lost sales. Expert Syst Appl 53:149–159

    Article  Google Scholar 

  • Qin L, Miao L, Ruan Q, Zhang Y (2014) A local search method for periodic inventory routing problem. Expert Syst Appl 41:765–778

    Article  Google Scholar 

  • Rahimi M, Baboli A, Rekik Y (2017) Multi-objective inventory routing problem: a stochastic model to consider profit, service level and green criteria. Transp Res Part E Logist Transp Rev 101:59–83

    Article  Google Scholar 

  • Rahimi-Vahed A, Crainic TG, Gendreau M, Rei W (2015) Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Comput Oper Res 53:9–23

    Article  Google Scholar 

  • Reyes D, Erera AL, Savelsbergh MWP (2018) Complexity of routing problems with release dates and deadlines. Eur J Oper Res 266:29–34

    Article  Google Scholar 

  • Riquelme-Rodríguez J-P, Langevin A, Gamache M (2014) Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints. Networks 64:125–139

    Article  Google Scholar 

  • Russell R, Igo W (1979) An assignment routing problem. Networks 9:1–17

    Article  Google Scholar 

  • Schubert D, Scholz A, Wäscher G (2018) Integrated order picking and vehicle routing with due dates. OR Spectr 40:1109–1139

    Article  Google Scholar 

  • Shaabani H, Kamalabadi IN (2016) An efficient population-based simulated annealing algorithm for the multi-product multi-retailer perishable inventory routing problem. Comput Ind Eng 99:189–201

    Article  Google Scholar 

  • Shelbourne BC, Battarra M, Potts CN (2017) The vehicle routing problem with release and due dates. INFORMS J Comput 29:705–723

    Article  Google Scholar 

  • Soysal M, Bloemhof-Ruwaard JM, Haijema R, van der Vorst JGAJ (2018) Modeling a green inventory routing problem for perishable products with horizontal collaboration. Comput Oper Res 89:168–182

    Article  Google Scholar 

  • Tirkolaee EB, Goli A, Bakhsi M, Mahdavi I (2017) A robust multi-trip vehicle routing problem of perishable products with intermediate depots and time windows. Numer Algebra Control Optim 7:417–433

    Article  Google Scholar 

  • Tirkolaee EB, Alinaghian M, Hosseinabadi AAR, Sasi MB, Sangaiah AK (2018) An improved ant colony optimization for the multi-trip capacitated arc routing problem. Comput Electr Eng. https://doi.org/10.1016/j.compeleceng.2018.01.040

  • Toth P, Vigo D (2014) Vehicle routing: problems, methods, and applications, vol 18. SIAM, New Delhi

    Book  Google Scholar 

  • Ulmer MW, Thomas BW, Mattfeld DC (2016) Preemptive depot returns for a dynamic same-day delivery problem. Technical Report, Technische Universität Braunschweig, pp 1–39

  • Ulmer MW, Thomas BW, Campbell AM, Woyak N (2017) The restaurant meal delivery problem: dynamic pick-up and delivery with deadlines and random ready times

  • Van Anholt RG, Coelho LC, Laporte G, Vis IFA (2016) An inventory-routing problem with pickups and deliveries arising in the replenishment of automated teller machines. Transp Sci 50:1077–1091

    Article  Google Scholar 

  • Voccia SA, Campbell AM, Thomas BW (2017) The same-day delivery problem for online purchases. Transp Sci. https://doi.org/10.1287/trsc.2016.0732

  • Wassan N, Wassan N, Nagy G, Salhi S (2017) The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search. Comput Oper Res 78:454–467

    Article  Google Scholar 

  • Yadollahi E, Aghezzaf E-H, Raa B (2017) Managing inventory and service levels in a safety stock-based inventory routing system with stochastic retailer demands. Appl Stoch Models Bus Ind 33:369–381

    Article  Google Scholar 

  • Yahyaoui H, Kaabachi I, Krichen S, Dekdouk A (2018) Two metaheuristic approaches for solving the multi-compartment vehicle routing problem. Oper Res, pp 1–24. https://doi.org/10.1007/s12351-018-0403-4

  • Zhang Y, Mei Y, Tang K, Jiang K (2017) Memetic algorithm with route decomposing for periodic capacitated arc routing problem. Appl Soft Comput 52:1130–1142

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous reviewers for their suggestions and comments which helped improving a previous version of this paper.

Author information

Authors and Affiliations

  1. Department of Economics and Management, University of Brescia, C.da S. Chiara 50, Brescia, Italy

    A. Mor & M. G. Speranza

Authors
  1. A. Mor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. G. Speranza
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Mor.

Ethics declarations

Conflict of interest

We hereby state that we hold no conflicts of interest with respect to the submission of the text to 4OR.

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

Mor, A., Speranza, M.G. Vehicle routing problems over time: a survey. 4OR-Q J Oper Res 18, 129–149 (2020). https://doi.org/10.1007/s10288-020-00433-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-020-00433-2

Keywords

Mathematics Subject Classification

Search

Navigation