Rights statement: This is the author’s version of a work that was accepted for publication in European Journal of Operational Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Operational Research, 274, 2, 2018 DOI: 10.1016/j.ejor.2018.10.006
Accepted author manuscript, 1.14 MB, PDF document
Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
Final published version
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - Algorithms and uncertainty sets for data-driven robust shortest path problems
AU - Chassein, Andre
AU - Dokka Venkata Satyanaraya, Trivikram
AU - Goerigk, Marc
N1 - This is the author’s version of a work that was accepted for publication in European Journal of Operational Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Operational Research, 274, 2, 2018 DOI: 10.1016/j.ejor.2018.10.006
PY - 2019/4/16
Y1 - 2019/4/16
N2 - We consider robust shortest path problems, where the aim is to find a path that optimizes the worst-case performance over an uncertainty set containing all relevant scenarios for arc costs. The usual approach for such problems is to assume this uncertainty set given by an expert who can advise on the shape and size of the set.Following the idea of data-driven robust optimization, we instead construct a range of uncertainty sets from the current literature based on real-world traffic measurements provided by the City of Chicago. We then compare the performance of the resulting robust paths within and outside the sample, which allows us to draw conclusions on the suitability of uncertainty sets.Based on our experiments, we then focus on ellipsoidal uncertainty sets, and develop a new solution algorithm that significantly outperforms a state-of-the art solver.
AB - We consider robust shortest path problems, where the aim is to find a path that optimizes the worst-case performance over an uncertainty set containing all relevant scenarios for arc costs. The usual approach for such problems is to assume this uncertainty set given by an expert who can advise on the shape and size of the set.Following the idea of data-driven robust optimization, we instead construct a range of uncertainty sets from the current literature based on real-world traffic measurements provided by the City of Chicago. We then compare the performance of the resulting robust paths within and outside the sample, which allows us to draw conclusions on the suitability of uncertainty sets.Based on our experiments, we then focus on ellipsoidal uncertainty sets, and develop a new solution algorithm that significantly outperforms a state-of-the art solver.
KW - robustness and sensitivity analysis
KW - robust shortest paths
KW - uncertainty sets
KW - data-driven robust optimization
KW - robustness and sensitivity analysis, robust shortest paths, uncertainty sets, data-driven robust optimization
U2 - 10.1016/j.ejor.2018.10.006
DO - 10.1016/j.ejor.2018.10.006
M3 - Journal article
VL - 274
SP - 671
EP - 686
JO - European Journal of Operational Research
JF - European Journal of Operational Research
SN - 0377-2217
IS - 2
ER -