The Robust Time-Dependent Vehicle Routing Problem with Time Windows and Budget Uncertainty

Published Online:https://doi.org/10.1287/trsc.2025.0387

References

  • Adamo T, Gendreau M, Ghiani G, Guerriero E (2024) A review of recent advances in time-dependent vehicle routing. Eur. J. Oper. Res. 319(1):1–15.Crossref, Google Scholar
  • Agarwal YK, Venkateshan P (2026) Vehicle routing problem with time windows—New valid inequalities from polar duality. Networks 87(1):3–22.Crossref, Google Scholar
  • Agra A, Christiansen M, Figueiredo RMV, Hvattum LM, Poss M, Requejo C (2013) The robust vehicle routing problem with time windows. Comput. Oper. Res. 40(3):856–866.Crossref, Google Scholar
  • Ahn BH, Shin JY (1991) Vehicle-routeing with time windows and time-varying congestion. J. Oper. Res. Soc. 42(5):393–400. Crossref, Google Scholar
  • Allahyari S, Yaghoubi S, Van Woensel T (2021) The secure time-dependent vehicle routing problem with uncertain demands. Comput. Oper. Res. 131:105253.Crossref, Google Scholar
  • Archetti C, Coelho LC, Speranza MG, Vansteenwegen P (2026) Beyond fifty years of vehicle routing: Insights into the history and the future. Eur. J. Oper. Res. 330(2):355–372.Crossref, Google Scholar
  • Ascheuer N, Fischetti M, Grötschel M (2000) A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2):69–79.Crossref, Google Scholar
  • 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(6):954–966.Crossref, Google Scholar
  • Bartolini E, Goeke D, Schneider M, Ye M (2021) The robust traveling salesman problem with time windows under knapsack-constrained travel time uncertainty. Transportation Sci. 55(2):371–394.Link, Google Scholar
  • Ben-Tal A, Nemirovski A (2002) Robust optimization—Methodology and applications. Math. Programming 92(3):453–480.Crossref, Google Scholar
  • Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
  • Braaten S, Gjønnes O, Hvattum LM, Tirado G (2017) Heuristics for the robust vehicle routing problem with time windows. Expert Systems Appl. 77:136–147.Crossref, Google Scholar
  • Campos R, Coelho LC, Munari P (2025) New formulations for the robust vehicle routing problem with time windows under demand and travel time uncertainty. OR Spectrum 47(2):411–453. Crossref, Google Scholar
  • Dabia S, Røpke S, van Woensel T (2024) Erratum: “Branch and price for the time-dependent vehicle routing problem with time windows. Transportation Sci. 58(5):919–924.Link, Google Scholar
  • Dabia S, Ropke S, van Woensel T, De Kok T (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transportation Sci. 47(3):380–396.Link, Google Scholar
  • De La Vega J, Munari P, Morabito R (2020) Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen. Comput. Oper. Res. 124:105062.Crossref, Google Scholar
  • Desaulniers G, Madsen OBG, Røpke S (2014) The vehicle routing problem with time windows. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications, 2nd ed. (SIAM, Philadelphia), 119–159.Crossref, Google Scholar
  • Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2):342–354.Link, Google Scholar
  • Donati AV, Montemanni R, Casagrande N, Rizzoli AE, Gambardella LM (2008) Time dependent vehicle routing problem with a multi ant colony system. Eur. J. Oper. Res. 185(3):1174–1191.Crossref, Google Scholar
  • Fleischmann B, Gietz M, Gnutzmann S (2004) Time-varying travel times in vehicle routing. Transportation Sci. 38(2):160–173.Link, Google Scholar
  • Franceschetti A, Demir E, Honhon D, Van Woensel T, Laporte G, Stobbe M (2017) A metaheuristic for the time-dependent pollution-routing problem. Eur. J. Oper. Res. 259(3):972–991.Crossref, Google Scholar
  • Froger A, Jabali O, Mendoza JE, Laporte G (2022) The electric vehicle routing problem with capacitated charging stations. Transportation Sci. 56(2):460–482.Link, Google Scholar
  • Garey MR, Johnson DS (2002) Computers and Intractability, vol. 29 (W. H. Freeman, New York).Google Scholar
  • Gendreau M, Ghiani G, Guerriero E (2015) Time-dependent routing problems: A review. Comput. Oper. Res. 64:189–197.Crossref, Google Scholar
  • Han B, Yan Y, Chi T, Park Y (2025) The electric vehicle routing problem with travel time and energy consumption uncertainty. Transportation Res. E Logist. Transportation Rev. 202:104211.Crossref, Google Scholar
  • Hashimoto H, Yagiura M, Ibaraki T (2008) An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optim. 5(2):434–456.Crossref, Google Scholar
  • Here (2024) Here technologies. Accessed July 18, 2024, https://www.here.com.Google Scholar
  • 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.Crossref, Google Scholar
  • Ichoua S, Gendreau M, Potvin JY (2003) Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 144(2):379–396.Crossref, Google Scholar
  • Jeong J, Ghaddar B, Zufferey N, Nathwani J (2024) Adaptive robust electric vehicle routing under energy consumption uncertainty. Transportation Res. C Emerging Tech. 160:104529.Crossref, Google Scholar
  • Jung S, Haghani A (2001) Genetic algorithm for the time-dependent vehicle routing problem. Transportation Res. Rec. 1771(1):164–171.Crossref, Google Scholar
  • Kallehauge B, Boland N, Madsen OB (2007) Path inequalities for the vehicle routing problem with time windows. Networks 49(4):273–293.Crossref, Google Scholar
  • Lysgaard J (2003) CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Technical report, Aarhus School of Business, Aarhus, Denmark.Google Scholar
  • Lysgaard J (2006) Reachability cuts for the vehicle routing problem with time windows. Eur. J. Oper. Res. 175(1):210–223.Crossref, Google Scholar
  • Malheiros I, Ramalho R, Passeti B, Bulhões T, Subramanian A (2021) A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem. Comput. Oper. Res. 129:105196.Crossref, Google Scholar
  • Metz L, Mutzel P, Niemann T, Schürmann L, Stiller S, Tillmann AM (2024) Delay-resistant robust vehicle routing with heterogeneous time windows. Comput. Oper. Res. 164:106553.Crossref, Google Scholar
  • Montero A, Méndez-Díaz I, Miranda-Bront JJ (2017) An integer programming approach for the time-dependent traveling salesman problem with time windows. Comput. Oper. Res. 88:280–289.Crossref, Google Scholar
  • Mor A, Speranza MG (2022) Vehicle routing problems over time: A survey. Ann. Oper. Res. 314(1):255–275.Crossref, Google Scholar
  • Munari P, Moreno A, De La Vega J, Alem D, Gondzio J, Morabito R (2019) The robust vehicle routing problem with time windows: Compact formulation and branch-price-and-cut method. Transportation Sci. 53(4):1043–1066.Link, Google Scholar
  • Pessoa AA, Poss M, Sadykov R, Vanderbeck F (2021) Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty. Oper. Res. 69(3):739–754.Link, Google Scholar
  • Soares R, Parragh SN, Marques A, Amorim P (2025) The robust vehicle routing problem with synchronization: Models and branch-and-cut algorithms. Networks 86(3):296–324.Crossref, Google Scholar
  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
  • Spinelli A, Bezzi D, Jabali O, Maggioni F (2026) A stochastic electric vehicle routing problem under uncertain energy consumption. Transportation Res. C Emerging Tech. 183:105480.Crossref, Google Scholar
  • Subramanian A, Lourenço HR (2023) Iterated local search. Pardalos PM, Prokopyev OA, eds. Encyclopedia of Optimization (Springer, Cham, Switzerland), 1–10.Crossref, Google Scholar
  • Subramanian A, Drummond LM, Bentes C, Ochi LS, Farias R (2010) A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11):1899–1911.Crossref, Google Scholar
  • Toth P, Vigo D (2014) Vehicle Routing: Problems, Methods, and Applications (SIAM, Philadelphia).Crossref, Google Scholar
  • 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(1):475–489.Crossref, Google Scholar
  • Vidal T, Martinelli R, Pham TA, Hà MH (2021) Arc routing with time-dependent travel times and paths. Transportation Sci. 55(3):706–724.Link, Google Scholar
  • Wang A, Subramanyam A, Gounaris CE (2022) Robust vehicle routing under uncertainty via branch-price-and-cut. Optim. Engrg. 23(4):1895–1948.Crossref, Google Scholar
  • Wei J, Poon M, Zhang Z (2024) A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions. Comput. Oper. Res. 172:106807.Crossref, Google Scholar
  • Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5):457–461.Crossref, Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.