Routing Optimization Under Uncertainty

We consider a class of routing optimization problems under uncertainty in which all decisions are made before the uncertainty is realized. The objective is to obtain optimal routing solutions that would, as much as possible, adhere to a set of specified requirements after the uncertainty is realized. These problems include finding an optimal routing solution to meet the soft time window requirements at a subset of nodes when the travel time is uncertain, and sending multiple capacitated vehicles to different nodes to meet the customers’ uncertain demands. We introduce a precise mathematical framework for defining and solving such routing problems. In particular, we propose a new decision criterion, called the Requirements Violation (RV) Index , which quantifies the risk associated with the violation of requirements taking into account both the frequency of violations and their magnitudes whenever they occur. The criterion can handle instances when probability distributions are known, and ambiguity when distributions are partially characterized through descriptive statistics such as moments. We develop practically efficient algorithms involving Benders decomposition to find the exact optimal routing solution in which the RV Index criterion is minimized, and we give numerical results from several computational studies that show the attractive performance of the solutions.

[1]  Gérard Cornuéjols,et al.  The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..

[2]  Melvyn Sim,et al.  Managing Underperformance Risk in Project Portfolio Selection , 2015, Oper. Res..

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

[4]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

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

[6]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..

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

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

[9]  I. Gilboa,et al.  Maxmin Expected Utility with Non-Unique Prior , 1989 .

[10]  Defeng Sun,et al.  Preferences for travel time under risk and ambiguity: Implications in path selection and network equilibrium , 2016 .

[11]  Peng Sun,et al.  A Robust Optimization Perspective on Stochastic Programming , 2007, Oper. Res..

[12]  Temel Öncan,et al.  A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..

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

[14]  Matthew Brand,et al.  Stochastic Shortest Paths Via Quasi-convex Maximization , 2006, ESA.

[15]  Timothy L. Urban,et al.  Vehicle routing with soft time windows and Erlang travel times , 2008, J. Oper. Res. Soc..

[16]  David Simchi-Levi,et al.  A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty , 1996, Oper. Res..

[17]  János Barta,et al.  The Robust Traveling Salesman Problem with Interval Data , 2006, Transp. Sci..

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

[19]  Patrick Jaillet,et al.  A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..

[20]  Jean-Yves Potvin,et al.  Vehicle Routing , 2009, Encyclopedia of Optimization.

[21]  Gerhard J. Woeginger,et al.  On the robust assignment problem under a fixed number of cost scenarios , 2006, Oper. Res. Lett..

[22]  Martine Labbé,et al.  Reduction approaches for robust shortest path problems , 2011, Comput. Oper. Res..

[23]  A R Odoni,et al.  THE PROBABILISTIC VEHICLE ROUTING PROBLEM. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[24]  Hrvoje Gold,et al.  Vehicle Routing Problem , 2008, Encyclopedia of GIS.

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

[26]  Petros A. Ioannou,et al.  Truck route planning in nonstationary stochastic networks with time windows at customer locations , 2006, IEEE Transactions on Intelligent Transportation Systems.

[27]  Lauri Häme,et al.  Dynamic journeying under uncertainty , 2013, Eur. J. Oper. Res..

[28]  Gilbert Laporte,et al.  A concise guide to the Traveling Salesman Problem , 2010, J. Oper. Res. Soc..

[29]  Jan Dhaene,et al.  Modern Actuarial Risk Theory: Using R , 2008 .

[30]  Y. Nie,et al.  Shortest path problem considering on-time arrival probability , 2009 .

[31]  A. Ben-Tal,et al.  Adjustable robust solutions of uncertain linear programs , 2004, Math. Program..

[32]  Fernando Ordóñez,et al.  Robust Vehicle Routing , 2010 .

[33]  Melvyn Sim,et al.  Aspirational Preferences and Their Representation by Risk Measures , 2012, Manag. Sci..

[34]  Fernando Ordóñez,et al.  A robust optimization approach to dispatching technicians under stochastic service times , 2013, Optim. Lett..

[35]  Tom Van Woensel,et al.  Vehicle routing problem with stochastic travel times including soft time windows and service costs , 2013, Comput. Oper. Res..

[36]  Roberto Montemanni,et al.  A branch and bound algorithm for the robust shortest path problem with interval data , 2004, Oper. Res. Lett..

[37]  Dimitris Bertsimas,et al.  The probabilistic vehicle routing problem , 1988 .

[38]  Abdel Lisser,et al.  Stochastic Shortest Path Problem with Delay Excess Penalty , 2010, Electron. Notes Discret. Math..

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

[40]  Dan Trietsch,et al.  Stochastic Traveling Salesperson Models with Safety Time , 2009 .

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

[42]  Daniel Vanderpooten,et al.  Complexity of the min-max and min-max regret assignment problems , 2005, Oper. Res. Lett..

[43]  Wei Tsang Ooi,et al.  A stochastic dynamic traveling salesman problem with hard time windows , 2009, Eur. J. Oper. Res..

[44]  C. HuangC.,et al.  Bounds on the Expectation of a Convex Function of a Random Variable , 1977 .

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

[46]  Barrett W. Thomas,et al.  Probabilistic Traveling Salesman Problem with Deadlines , 2008, Transp. Sci..

[47]  Melvyn Sim,et al.  Multiple Objectives Satisficing Under Uncertainty , 2013, Oper. Res..

[48]  Igor Averbakh,et al.  Interval data minmax regret network optimization problems , 2004, Discret. Appl. Math..

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

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

[51]  Daniel Kuhn,et al.  Primal and dual linear decision rules in stochastic and robust optimization , 2011, Math. Program..

[52]  Hande Yaman,et al.  The Robust Shortest Path Problem with Interval Data , 2012 .

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

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

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

[56]  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..

[57]  L. Khachiyan.  COMMUNICATIONS OF THE MOSCOW MATHEMATICAL SOCIETY: The problem of calculating the volume of a polyhedron is enumerably hard , 1989 .

[58]  Stephen C. H. Leung,et al.  Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm , 2010 .

[59]  J. Danskin.  The Theory of Max-Min and its Application to Weapons Allocation Problems , 1967 .