Skip to main content

Advertisement

SpringerLink
Log in

Vehicle routing problems over time: a survey

  • Survey Papers
  • Published:
Annals of Operations Research 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, M., Zhong, Y., Aghezzaf, E.-H., & Aouam, T. (2014). Modelling and solving the multiperiod inventory-routing problem with stochastic stationary demand rates. International Journal of Production Research, 52, 4351–4363.

    Article  Google Scholar 

  • Aksen, D., Kaya, O., Salman, F., & Tüncel, Ö. (2014). An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. European Journal of Operational Research, 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. Computers and Operations Research, 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. International Journal of Production Research, 54, 564–578.

    Article  Google Scholar 

  • André, J., Bourreau, E., & Wolfler Calvo, R. (2020). Introduction to the special section: Roadef/Euro challenge 2016-inventory routing problem. Transportation Science, 54, 299–301.

    Article  Google Scholar 

  • Archetti, C., & Bertazzi, L. (2021). Recent challenges in routing and inventory routing: E-commerce and last-mile delivery. Networks, 77, 255–268.

    Article  Google Scholar 

  • Archetti, C., & Speranza, M. (2012). Vehicle routing problems with split deliveries. International Transactions on Operations Research, 19, 3–22.

    Article  Google Scholar 

  • Archetti, C., & Speranza, M. (2016). The inventory routing problem: The value of integration. International Transactions in Operational Research, 23, 393–407.

    Article  Google Scholar 

  • Archetti, C., Savelsbergh, M., & Speranza, M. (2006). Worst-case analysis for split delivery vehicle routing problems. Transportation Science, 40, 226–234.

    Article  Google Scholar 

  • Archetti, C., Bertazzi, L., Laporte, G., & Speranza, M. (2007). A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science, 41, 382–391.

    Article  Google Scholar 

  • Archetti, C., Bianchessi, N., Irnich, S., & Speranza, M. (2014). Formulations for an inventory routing problem. International Transactions in Operational Research, 21, 353–374.

    Article  Google Scholar 

  • Archetti, C., Speranza, M., & Vigo, D. (2014). Chapter 10: Vehicle routing problems with profits. In Vehicle routing: Problems, methods, and applications (2nd edn, pp. 273–297). SIAM.

  • Archetti, C., Feillet, D., & Speranza, M. (2015). Complexity of routing problems with release dates. European Journal of Operational Research, 247, 797–803.

    Article  Google Scholar 

  • Archetti, C., Jabali, O., & Speranza, M. (2015). Multi-period vehicle routing problem with due dates. Computers and Operations Research, 61, 122–134.

    Article  Google Scholar 

  • Archetti, C., Fernández, E., & Huerta-Muñoz, D. (2017). The flexible periodic vehicle routing problem. Computers and Operations Research, 85, 58–70.

    Article  Google Scholar 

  • Archetti, C., Christiansen, M., & Speranza, M. (2018). Inventory routing with pickups and deliveries. European Journal of Operational Research, 268, 314–324.

    Article  Google Scholar 

  • Archetti, C., Feillet, D., Mor, A., & Speranza, M. (2018). An iterated local search for the traveling salesman problem with release dates and completion time minimization. Computers and Operations Research, 98, 24–37.

    Article  Google Scholar 

  • Archetti, C., Feillet, D., Mor, A., & Speranza, M. (2020). Dynamic traveling salesman problem with stochastic release dates. European Journal of Operational Research, 280, 832–844.

    Article  Google Scholar 

  • Azadeh, A., Elahi, S., Farahani, M., & Nasirian, B. (2017). A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment. Computers and Industrial Engineering, 104, 124–133.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Baller, A. C., van Ee, M., Hoogeboom, M., & Stougie, L. (2020). Complexity of inventory routing problems when routing is easy. Networks, 75, 113–123.

    Article  Google Scholar 

  • Bektaş, T., Laporte, G., & Vigo, D. (2015). Integrated vehicle routing problems. Computers and Operations Research, 55, 126.

    Article  Google Scholar 

  • Bell, W., Dalberto, L., Fisher, M., Greenfield, A., Jaikumar, R., Kedia, P., Mack, R., & Prutzman, P. (1983). Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces, 13, 4–23.

    Article  Google Scholar 

  • Beltrami, E., & Bodin, L. (1974). Networks and vehicle routing for municipal waste collection. Networks, 4, 65–94.

    Article  Google Scholar 

  • Bertazzi, L., & Speranza, M. (2012). Inventory routing problems: An introduction. EURO Journal on Transportation and Logistics, 1, 307–326.

    Article  Google Scholar 

  • Bertazzi, L., & Speranza, M. (2013). Inventory routing problems with multiple customers. EURO Journal on Transportation and Logistics, 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, L., & 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. Computers and Industrial Engineering, 99, 300–313.

    Article  Google Scholar 

  • Bruglieri, M., Mancini, S., Peruzzini, R., & Pisacane, O. (2021). The multi-period multi-trip container drayage problem with release and due dates. Computers and Operations Research, 125, 105102.

    Article  Google Scholar 

  • Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., & Juan, A. (2015). Rich vehicle routing problem: Survey. ACM Computing Surveys, 47, 32.

    Article  Google Scholar 

  • Campbell, A., & Wilson, J. (2014). Forty years of periodic vehicle routing. Networks, 63, 2–15.

    Article  Google Scholar 

  • Cantu-Funes, R., Salazar-Aguilar, M., & Boyer, V. (2018). Multi-depot periodic vehicle routing problem with due dates and time windows. Journal of the Operational Research Society, 69, 296–306.

    Article  Google Scholar 

  • Cárdenas-Barrón, L. E., & Melo, R. A. (2021). A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics. Omega, 103, 102394.

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Chu, J., Yan, S., & Huang, H.-J. (2017). A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times. Networks and Spatial Economics, 17, 41–68.

    Article  Google Scholar 

  • Coelho, L., & Laporte, G. (2014). Improved solutions for inventory-routing problems through valid inequalities and input ordering. International Journal of Production Economics, 155, 391–397.

    Article  Google Scholar 

  • Coelho, L., & Laporte, G. (2014). Optimal joint replenishment, delivery and inventory management policies for perishable products. Computers and Operations Research, 47, 42–52.

    Article  Google Scholar 

  • Coelho, L., Cordeau, J.-F., & Laporte, G. (2013). Thirty years of inventory routing. Transportation Science, 48, 1–19.

    Article  Google Scholar 

  • Coelho, L., Cordeau, J.-F., & Laporte, G. (2014). Heuristics for dynamic and stochastic inventory-routing. Computers and Operations Research, 52, 55–67.

    Article  Google Scholar 

  • Corberán, Á., & Laporte, G. (2013). Arc routing: Problems, methods, and applications. SIAM.

  • Cordeau, J.-F., Laganà, D., Musmanno, R., & Vocaturo, F. (2015). A decomposition-based heuristic for the multiple-product inventory-routing problem. Computers and Operations Research, 55, 153–166.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Dantzig, G., & Ramser, J. (1959). The truck dispatching problem. Management Science, 6, 80–91.

    Article  Google Scholar 

  • Desaulniers, G., Rakke, J., & Coelho, L. (2015). A branch-price-and-cut algorithm for the inventory-routing problem. Transportation Science, 50, 1060–1076.

    Article  Google Scholar 

  • Eksioglu, B., Vural, A., & Reisman, A. (2009). The vehicle routing problem: A taxonomic review. Computers and Industrial Engineering, 57, 1472–1483.

    Article  Google Scholar 

  • François, V., Arda, Y., Crama, Y., & Laporte, G. (2016). Large neighborhood search for multi-trip vehicle routing. European Journal of Operational Research, 255, 422–441.

    Article  Google Scholar 

  • Golden, B., Raghavan, S., & Wasil, E. (2008). The vehicle routing problem: Latest advances and new challenges (Vol. 43). Springer.

  • 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. International Journal of Production Economics, 183, 570–582.

    Article  Google Scholar 

  • Jayakumar, D., Grzybowska, H., Rey, D., & Dixit, V. (2016). Food rescue and delivery: Heuristic algorithm for periodic unpaired pickup and delivery vehicle routing problem. Transportation Research Record: Journal of the Transportation Research Board, 2548, 81–89.

    Article  Google Scholar 

  • Juan, A., Grasman, S., Caceres-Cruz, J., & Bektaş, T. (2014). A simheuristic algorithm for the single-period stochastic inventory-routing problem with stock-outs. Simulation Modelling Practice and Theory, 46, 40–52.

    Article  Google Scholar 

  • Kheiri, A. (2020). Heuristic sequence selection for inventory routing problem. Transportation Science, 54, 302–312.

    Article  Google Scholar 

  • Klapp, M., Erera, A., & Toriello, A. (2016). The one-dimensional dynamic dispatch waves problem. Transportation Science, 52, 402–415.

    Article  Google Scholar 

  • Klapp, M., Erera, A., & Toriello, A. (2018). The dynamic dispatch waves problem for same-day delivery. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2018.05.032

    Article  Google Scholar 

  • Lacomme, P., Prins, C., & Ramdane-Chérif, W. (2005). Evolutionary algorithms for periodic arc routing problems. European Journal of Operational Research, 165, 535–553.

    Article  Google Scholar 

  • Laganà, D., Longo, F., & Santoro, F. (2015). Multi-product inventory-routing problem in the supermarket distribution industry. International Journal of Food Engineering, 11, 747–766.

    Article  Google Scholar 

  • Lahyani, R., Khemakhem, M., & Semet, F. (2015). Rich vehicle routing problems: From a taxonomy to a definition. European Journal of Operational Research, 241, 1–14.

    Article  Google Scholar 

  • Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43, 408–416.

    Article  Google Scholar 

  • Li, K., Chen, B., Sivakumar, A., & Wu, Y. (2014). An inventory-routing problem with the objective of travel time minimization. European Journal of Operational Research, 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. Engineering Optimization, 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. Transportation Research Part E: Logistics and Transportation Review, 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. The International Journal of Advanced Manufacturing Technology, 85, 2345–2352.

    Article  Google Scholar 

  • Manousakis, E., Repoussis, P., Zachariadis, E., & Tarantilis, C. (2021). Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation. European Journal of Operational Research, 290, 870–885.

    Article  Google Scholar 

  • Mes, M., Schutten, M., & Rivera, A. (2014). Inventory routing for dynamic waste collection. Waste Management, 34, 1564–1576.

    Article  Google Scholar 

  • Mirabi, M. (2014). A hybrid electromagnetism algorithm for multi-depot periodic vehicle routing problem. The International Journal of Advanced Manufacturing Technology, 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. Computers and Operations Research, 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. Journal of the Operational Research Society, 70, 1–12.

    Google Scholar 

  • Moons, S., Ramaekers, K., Caris, A., & Arda, Y. (2018). Integration of order picking and vehicle routing in a b2c e-commerce context. Flexible Services and Manufacturing Journal, 30, 813–843.

    Article  Google Scholar 

  • Mor, A., & Speranza, M. G. (2020). Vehicle routing problems over time: A survey. 4OR, 18, 1–21.

    Article  Google Scholar 

  • Nguyen, P., Crainic, T., & Toulouse, M. (2014). A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows. Journal of Heuristics, 20, 383–416.

    Article  Google Scholar 

  • Nguyen, P., Crainic, T., & Toulouse, M. (2017). Multi-trip pickup and delivery problem with time windows and synchronization. Annals of Operations Research, 253, 899–934.

    Article  Google Scholar 

  • Niakan, F., & Rahimi, M. (2015). A multi-objective healthcare inventory routing problem; a fuzzy possibilistic approach. Transportation Research Part E: Logistics and Transportation Review, 80, 74–94.

    Article  Google Scholar 

  • Nolz, P., Absi, N., & Feillet, D. (2014). A bi-objective inventory routing problem for sustainable waste management under uncertainty. Journal of Multi-Criteria Decision Analysis, 21, 299–314.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Noor, N., & Shuib, A. (2015). Multi-depot instances for inventory routing problem using clustering techniques. Journal of Industrial and Intelligent Information. https://doi.org/10.12720/jiii.3.2.97-101

    Article  Google Scholar 

  • 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 

  • Ostermeier, M., Henke, T., Hübner, A., & Wäscher, G. (2020). Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions. European Journal of Operational Research, 292, 799–817.

    Article  Google Scholar 

  • Pan, B., Zhang, Z., & Lim, A. (2021). Multi-trip time-dependent vehicle routing problem with time windows. European Journal of Operational Research, 291, 218–231.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Papageorgiou, D., Keha, A., Nemhauser, G., & Sokol, J. (2014). Two-stage decomposition algorithms for single product maritime inventory routing. INFORMS Journal on Computing, 26, 825–847.

    Article  Google Scholar 

  • Paradiso, R., Roberti, R., Laganá, D., & Dullaert, W. (2020). An exact solution framework for multitrip vehicle-routing problems with time windows. Operations Research, 68, 180–198.

    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 Systems with Applications, 53, 149–159.

    Article  Google Scholar 

  • Pina-Pardo, J. C., Silva, D. F., & Smith, A. E. (2021). The traveling salesman problem with release dates and drone resupply. Computers and Operations Research, 129, 105170.

    Article  Google Scholar 

  • Qin, L., Miao, L., Ruan, Q., & Zhang, Y. (2014). A local search method for periodic inventory routing problem. Expert Systems with Applications, 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. Transportation Research Part E: Logistics and Transportation Review, 101, 59–83.

    Article  Google Scholar 

  • Rahimi-Vahed, A., Crainic, T., Gendreau, M., & Rei, W. (2015). Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Computers and Operations Research, 53, 9–23.

    Article  Google Scholar 

  • Reyes, D., Erera, A., & Savelsbergh, M. (2018). Complexity of routing problems with release dates and deadlines. European Journal of Operational Research, 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 Spectrum, 40, 1109–1139.

    Article  Google Scholar 

  • Shaabani, H., & Kamalabadi, I. (2016). An efficient population-based simulated annealing algorithm for the multi-product multi-retailer perishable inventory routing problem. Computers and Industrial Engineering, 99, 189–201.

    Article  Google Scholar 

  • Shelbourne, B., Battarra, M., & Potts, C. (2017). The vehicle routing problem with release and due dates. INFORMS Journal on Computing, 29, 705–723.

    Article  Google Scholar 

  • Soysal, M., Bloemhof-Ruwaard, J., Haijema, R., & van der Vorst, J. (2018). Modeling a green inventory routing problem for perishable products with horizontal collaboration. Computers and Operations Research, 89, 168–182.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Tirkolaee, E., Alinaghian, M., Hosseinabadi, A., Sasi, M., & Sangaiah, A. (2018). An improved ant colony optimization for the multi-trip capacitated arc routing problem. Computers and Electrical Engineering. https://doi.org/10.1016/j.compeleceng.2018.01.040

    Article  Google Scholar 

  • Toth, P., & Vigo, D. (2014). Vehicle routing: Problems, methods, and applications (Vol. 18). SIAM.

  • Ulmer, M., Thomas, B., & Mattfeld, D. (2016). Preemptive depot returns for a dynamic same-day delivery problem (pp. 1–39). Technical report, Technische Universität Braunschweig.

  • Ulmer, M. W., Thomas, B. W., Campbell, A. M., & Woyak, N. (2021). The restaurant meal delivery problem: Dynamic pickup and delivery with deadlines and random ready times. Transportation Science, 55, 75–100.

    Article  Google Scholar 

  • Van Anholt, R., Coelho, L., Laporte, G., & Vis, I. (2016). An inventory-routing problem with pickups and deliveries arising in the replenishment of automated teller machines. Transportation Science, 50, 1077–1091.

    Article  Google Scholar 

  • Voccia, S., Campbell, A., & Thomas, B. (2017). The same-day delivery problem for online purchases. Transportation Science. https://doi.org/10.1287/trsc.2016.0732

    Article  Google Scholar 

  • 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. Computers and Operations Research, 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. Applied Stochastic Models in Business and Industry, 33, 369–381.

    Article  Google Scholar 

  • Yang, W., Ke, L., Wang, D. Z., & Lam, J. S. L. (2021). A branch-price-and-cut algorithm for the vehicle routing problem with release and due dates. Transportation Research Part E: Logistics and Transportation Review, 145, 102167.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Zhen, L., Ma, C., Wang, K., Xiao, L., & Zhang, W. (2020). Multi-depot multi-trip vehicle routing problem with time windows and release dates. Transportation Research Part E: Logistics and Transportation Review, 135, 101866.

    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

    M. G. Speranza

  2. Department of Management, Economics and Industrial Engineering, Politecnico di Milano, Via Lambruschini 24/b, 20156, Milan, Italy

    A. Mor

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.

This is an updated version of the paper that appeared in 4OR, 18(2), 1–21 (2020).

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. Ann Oper Res 314, 255–275 (2022). https://doi.org/10.1007/s10479-021-04488-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-021-04488-0

Keywords

Search

Navigation