文章基本信息

标题：Finding Reliable Shortest Path in Stochastic Time-dependent Network
本地全文：下载
作者：Yiyong Pan ; Yiyong Pan ; Lu Sun 等
期刊名称：Procedia - Social and Behavioral Sciences
印刷版ISSN：1877-0428
出版年度：2013
卷号：96
页码：451-460
DOI：10.1016/j.sbspro.2013.08.053
语种：English
出版社：Elsevier
摘要：AbstractThis paper addresses the problem of finding reliable a priori shortest path to maximize the probability of arriving on time in a stochastic and time-dependent network. Optimal solutions to the problem can be obtained from finding non-dominated paths, which are defined based on first-order stochastic dominance. We formulate the problem of finding non-dominated paths as a general dynamic programming problem because Bellman's principle of optimality can be applied to construct non-dominated paths. A label-correcting algorithm is designed to ﬁnd optimal paths based on the new proporty for which Bellman's Principle holds. Numerical results are provided using a small network.
关键词：stochastic time-dependent network;shortest path;dynamic programming;stochastic dominance;label-correcting.