• DocumentCode
    3166712
  • Title

    Risk-averse shortest path problems

  • Author

    Gavriel, Constantinos ; Hanasusanto, G. ; Kuhn, Daniel

  • Author_Institution
    Dept. of Comput., Imperial Coll. London, London, UK
  • fYear
    2012
  • fDate
    10-13 Dec. 2012
  • Firstpage
    2533
  • Lastpage
    2538
  • Abstract
    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.
  • Keywords
    graph theory; optimisation; risk management; arc length; conditional value-at-risk; expected travel time; risk measure; risk minimization; risk-averse shortest path problem; routing policy; worst-case CVaR; Dynamic programming; Heuristic algorithms; Optimization; Random variables; Routing; Shortest path problem; Uncertainty;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control (CDC), 2012 IEEE 51st Annual Conference on
  • Conference_Location
    Maui, HI
  • ISSN
    0743-1546
  • Print_ISBN
    978-1-4673-2065-8
  • Electronic_ISBN
    0743-1546
  • Type

    conf

  • DOI
    10.1109/CDC.2012.6426188
  • Filename
    6426188