A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Travel Times

We investigate a robust approach for solving the capacitated vehicle routing problem (CVRP) with uncertain travel times. It is based on the concept of K-adaptability, which allows to calculate a set of k feasible solutions in a preprocessing phase. Once a scenario occurs, the corresponding best solution may be picked out of the set of candidates. The aim is then to determine the k candidates such that the respective best one of them is worst-case optimal, which leads to a min-max-min problem. In this paper, we propose an oracle-based algorithm for solving the resulting min-max-min CVRP, calling an exact algorithm for the deterministic problem in each iteration. Moreover, we adjust this approach such that also heuristics for the CVRP can be used. In this way, we derive a heuristic algorithm for the min-max-min problem, which turns out to yield good solutions in a short running time. All algorithms are tested on standard benchmark instances of the CVRP. Capacitated Vehicle Routing Problem, Robust Optimization, K-Adaptability

[1]  Nicolas Jozefowiez,et al.  The vehicle routing problem: Latest advances and new challenges , 2007 .

[2]  Christodoulos A. Floudas,et al.  The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty , 2013, Oper. Res..

[3]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[4]  Chris Groër,et al.  Parallel and Serial Algorithms for Vehicle Routing Problems , 2008 .

[5]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[6]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[7]  Rolf H. Möhring,et al.  The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications , 2009, Robust and Online Large-Scale Optimization.

[8]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[9]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[10]  Gilbert Laporte,et al.  Heuristics for the Vehicle Routing Problem , 2014, Vehicle Routing.

[11]  Matteo Fischetti,et al.  Light Robustness , 2009, Robust and Online Large-Scale Optimization.

[12]  Christoph Buchheim,et al.  Min–max–min robust combinatorial optimization , 2016, Mathematical Programming.

[13]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[14]  Daniel Kuhn,et al.  K-adaptability in two-stage distributionally robust binary programming , 2015, Oper. Res. Lett..

[15]  Paolo Toth,et al.  Exact algorithms for routing problems under vehicle capacity constraints , 2010, Ann. Oper. Res..

[16]  Roberto Roberti,et al.  Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints , 2012, Eur. J. Oper. Res..

[17]  Uwe Clausen,et al.  Dynamic vehicle routing with anticipation in disaster relief , 2012 .

[18]  Anita Schöbel,et al.  Generalized light robustness and the trade-off between robustness and nominal quality , 2014, Math. Methods Oper. Res..

[19]  Jean-Philippe Vial,et al.  Robust Optimization , 2021, ICORES.

[20]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[21]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[22]  P. C. Yellow,et al.  A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .

[23]  Daniele Vigo,et al.  Chapter 6 Vehicle Routing , 2007, Transportation.

[24]  Daniel Vanderpooten,et al.  Min-max and min-max regret versions of combinatorial optimization problems: A survey , 2009, Eur. J. Oper. Res..

[25]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[26]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[27]  Marielle Christiansen,et al.  The robust vehicle routing problem with time windows , 2013, Comput. Oper. Res..

[28]  Kyungsik Lee,et al.  Robust vehicle routing problem with deadlines and travel time/demand uncertainty , 2012, J. Oper. Res. Soc..

[29]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[30]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[31]  Constantine Caramanis,et al.  Finite Adaptability in Multistage Linear Optimization , 2010, IEEE Transactions on Automatic Control.

[32]  Melvyn Sim,et al.  Robust Discrete Optimization , 2003 .

[33]  F. Ordóñez,et al.  A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty , 2008 .

[34]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[35]  Ramasamy Panneerselvam,et al.  A Survey on the Vehicle Routing Problem and Its Variants , 2012 .