.png){kind=icon}
返回
Wasserstein distributionally robust shortest path problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2020.01.009.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a data-driven distributionally robust shortest path (DRSP) model where the distribution of the travel time in the transportation network can only be partially observed through a finite number of samples. Specifically, we aim to find an optimal path to minimize the worst-case alpha-reliable mean-excess travel time (METT) over a Wasserstein ball, which is centered at the empirical distribution of the sample dataset and the ball radius quantifies the level of its confidence. In sharp contrast to the existing DRSP models, our model is equivalently reformulated as a tractable mixed 0-1 convex problem, e.g., 0-1 linear program or 0-1 second-order cone program. Moreover, we also explicitly derive the distribution achieving the worst-case METT by simply perturbing each sample. Experiments demonstrate the advantages of our DRSP model in terms of the out-of-sample performance and computational complexity. Finally, our DRSP model is easily extended to solve the distributionally robust bi-criteria shortest path problem and the minimum cost flow problem. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Uncertainty modelling
Distributionally robust shortest path
Wasserstein metric
METT
Mixed 0-1 convex program
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Exploring the Relationship between Facets of Mindfulness and Eating Pathology in Women探索女性正念与饮食病理之间的关系
PREAI
分享收藏
查看更多内容