Risk-averse shortest path problems

We investigate routing policies for shortest path problems with uncertain arc lengths. The objective is to minimize a risk measure of the total travel time. We use the conditional value-at-risk (CVaR) for when the arc lengths (durations) have known distributions and the worst-case CVaR for when these distributions are only partially described. Policies which minimize the expected travel time (average-optimal policies) are desirable for experiments that are repeated several times, but the fact that they take no account of risk makes them unsuitable for decisions that need to be taken only once. In these circumstances, policies that minimize a risk measure provide protection against rare events with high cost.

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

[2]  Ronald Prescott Loui,et al.  Optimal paths in graphs with stochastic or multidimensional weights , 1983, Commun. ACM.

[3]  H. Frank,et al.  Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..

[4]  Munther A. Dahleh,et al.  The Value of Side Information in Shortest Path Optimization , 2011, IEEE Transactions on Automatic Control.

[5]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[6]  James J. Solberg,et al.  The Stochastic Shortest Route Problem , 1980, Oper. Res..

[7]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[8]  Yinyu Ye,et al.  Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems , 2010, Oper. Res..

[9]  John N. Tsitsiklis,et al.  An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..

[10]  Kees Roos,et al.  The Robust Shortest Path Problem by Means of Robust Linear Optimization , 2004, OR.

[11]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[12]  Ronald A. Howard,et al.  Dynamic Probabilistic Systems , 1971 .

[13]  Philippe Artzner,et al.  Coherent Measures of Risk , 1999 .

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

[15]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[16]  Bastian Goldlücke,et al.  Variational Analysis , 2014, Computer Vision, A Reference Guide.

[17]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[18]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[19]  Munther A. Dahleh,et al.  Shortest path optimization under limited information , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[20]  R. Rockafellar,et al.  Conditional Value-at-Risk for General Loss Distributions , 2001 .

[21]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[22]  Laurent El Ghaoui,et al.  Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach , 2003, Oper. Res..

[23]  Munther A. Dahleh,et al.  The value of side information in network flow optimization , 2012, Syst. Control. Lett..

[24]  Daniel Kuhn,et al.  Distributionally robust joint chance constraints with second-order moment information , 2011, Mathematical Programming.