Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/CDC.2012.6426188 | Decision and Control |
Keywords | Field | DocType |
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 | Canadian traveller problem,Mathematical optimization,Shortest path problem,Computer science,Constrained Shortest Path First,Risk management,Risk aversion,Risk measure,Rare events,CVAR | Conference |
ISSN | ISBN | Citations |
0743-1546 E-ISBN : 978-1-4673-2064-1 | 978-1-4673-2064-1 | 1 |
PageRank | References | Authors |
0.38 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christos Gavriel | 1 | 1 | 0.72 |
| Hanasusanto, Grani Adiwena | 2 | 86 | 5.71 |
| Daniel Kuhn | 3 | 559 | 32.80 |