Routing optimization with time windows under uncertainty

We study an a priori Traveling Salesman Problem with Time Windows (tsptw) in which the travel times along the arcs are uncertain and the goal is to determine within a budget constraint, a route for the service vehicle in order to arrive at the customers’ locations within their stipulated time windows as well as possible. In particular, service at customer’s location cannot commence before the beginning of the time window and any arrival after the end of the time window is considered late and constitutes to poor customer service. In articulating the service level of the tsptw under uncertainty, we propose a new decision criterion, called the essential riskiness index, which has the computationally attractive feature of convexity that enables us to formulate and solve the problem more effectively. As a decision criterion for articulating service levels, it takes into account both the probability of lateness and its magnitude, and can be applied in contexts where either the distributional information of the uncertain travel times is fully or partially known. We propose a new formulation for the tsptw, where we explicitly express the service starting time at each customer’s location as a convex piecewise affine function of the travel times, which would enable us to obtain the tractable formulation of the corresponding distributionally robust problem. We also show how to optimize the essential riskiness index via Benders decomposition and present cases where we can obtain closed-form solutions to the subproblems. We also illustrate in our numerical studies that this approach scales well with the number of samples used for the sample average approximation. The approach can be extended to a more general setting including Vehicle Routing Problem with Time Windows with uncertain travel times and customers’ demands.

[1]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

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

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

[4]  石井 恵一 On sharpness of Tchebycheff-type inequalities = チェビシェフ型不等式の最良性について , 1964 .

[5]  D. Bertsimas,et al.  A Practically Efficient Approach for Solving Adaptive Distributionally Robust Linear Optimization Problems , 2017 .

[6]  A. Charnes,et al.  Chance-Constrained Programming , 1959 .

[7]  Dan Wu,et al.  Brainstorming-Based Ant Colony Optimization for Vehicle Routing With Soft Time Windows , 2019, IEEE Access.

[8]  Herbert E. Scarf,et al.  A Min-Max Solution of an Inventory Problem , 1957 .

[9]  Michel Gendreau,et al.  The vehicle routing problem with hard time windows and stochastic service times , 2013, EURO J. Transp. Logist..

[10]  Laurence A. Wolsey,et al.  Reformulation and Decomposition of Integer Programs , 2009, 50 Years of Integer Programming.

[11]  Michel Gendreau,et al.  Stochastic Vehicle Routing Problems , 2014, Vehicle Routing.

[12]  Marielle Christiansen,et al.  Layered Formulation for the Robust Vehicle Routing Problem with Time Windows , 2012, ISCO.

[13]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..

[14]  Roberto Roberti,et al.  An exact solution framework for a broad class of vehicle routing problems , 2010, Comput. Manag. Sci..

[15]  S. Vaida,et al.  Studies in the Mathematical Theory of Inventory and Production , 1958 .

[16]  Moshe Sniedovich,et al.  Technical Note - Analysis of a Preference Order Traveling Salesman Problem , 1981, Oper. Res..

[17]  Ioana Popescu,et al.  Robust Mean-Covariance Solutions for Stochastic Optimization , 2007, Oper. Res..

[18]  Melvyn Sim,et al.  Robust Approximation to Multiperiod Inventory Management , 2010, Oper. Res..

[19]  Edward P. C. Kao,et al.  A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem , 1978, Oper. Res..

[20]  Daniel Kuhn,et al.  Distributionally Robust Convex Optimization , 2014, Oper. Res..

[21]  Michel Gendreau,et al.  A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times , 2014, Eur. J. Oper. Res..

[22]  R. Rockafellar,et al.  Optimization of conditional value-at risk , 2000 .

[23]  Patrick Jaillet,et al.  Routing Optimization Under Uncertainty , 2016, Oper. Res..

[24]  Guy Desaulniers,et al.  The Vehicle Routing Problem with Time Windows , 2014, Vehicle Routing.

[25]  David P. Morton,et al.  Stochastic Vehicle Routing with Random Travel Times , 2003, Transp. Sci..

[26]  Guy Desaulniers,et al.  New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows , 2016, INFORMS J. Comput..

[27]  Diwakar Gupta,et al.  Appointment scheduling in health care: Challenges and opportunities , 2008 .

[28]  Marcus Poggi de Aragão,et al.  Improved Branch-Cut-and-Price for Capacitated Vehicle Routing , 2014, IPCO.

[29]  Jin Qi,et al.  Mitigating Delays and Unfairness in Appointment Systems , 2017, Manag. Sci..

[30]  Robert J. Aumann,et al.  An Economic Index of Riskiness , 2008, Journal of Political Economy.

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

[32]  Sanjeeb Dash,et al.  A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows , 2012, INFORMS J. Comput..

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

[34]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[35]  Linwei Xin,et al.  Time (in)consistency of multistage distributionally robust inventory models with moment constraints , 2013, Eur. J. Oper. Res..

[36]  A. Claus A new formulation for the travelling salesman problem , 1984 .

[37]  Matteo Fischetti,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut , 2022 .

[38]  Melvyn Sim,et al.  Adjustable Robust Optimization via Fourier-Motzkin Elimination , 2018, Oper. Res..

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

[40]  Alexander Shapiro,et al.  Convex Approximations of Chance Constrained Programs , 2006, SIAM J. Optim..

[41]  Paolo Toth,et al.  Vehicle Routing , 2014, Vehicle Routing.

[42]  Patrick Jaillet,et al.  Models and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines , 2016, Transp. Sci..

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

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

[45]  Michel Gendreau,et al.  Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach , 2014, Eur. J. Oper. Res..

[46]  Melvyn Sim,et al.  Satisficing Measures for Analysis of Risky Positions , 2009, Manag. Sci..

[47]  Alexander Shapiro,et al.  The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study , 2003, Comput. Optim. Appl..