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.


Published in:
2012 IEEE 51st IEEE Conference on Decision and Control (CDC), 2533-2538
Presented at:
2012 IEEE 51st Annual Conference on Decision and Control (CDC), Maui, HI, USA, December 10-13, 2012
Year:
2012
Publisher:
IEEE
ISBN:
978-1-4673-2065-8
Keywords:
Laboratories:




 Record created 2014-01-29, last modified 2018-03-17

External link:
Download fulltext
URL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)