196324
20190316235835.0
978-1-4673-2065-8
10.1109/CDC.2012.6426188
doi
CONF
Risk-averse shortest path problems
2012
IEEE
2012
Conference Papers
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.
Dynamic programming
Heuristic algorithms
Optimization
Random variables
Routing
Shortest path problem
Uncertainty
Gavriel, Christos
Hanasusanto, Grani A.
Kuhn, Daniel
239987
247589
2012 IEEE 51st Annual Conference on Decision and Control (CDC)
Maui, HI, USA
December 10-13, 2012
2533-2538
2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
URL
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6426188
RAO
252496
U12788
oai:infoscience.tind.io:196324
CDM
conf
GLOBAL_SET
112541
EPFL-CONF-196324
EPFL
PUBLISHED
NON-REVIEWED
CONF