Reliable route guidance: A case study from Chicago

YM Nie, X Wu, JF Dillenburg, PC Nelson - Transportation Research Part A …, 2012 - Elsevier
YM Nie, X Wu, JF Dillenburg, PC Nelson
Transportation Research Part A: Policy and Practice, 2012Elsevier
Reliable route guidance can be obtained by solving the reliable a priori shortest path
problem, which finds paths that maximize the probability of arriving on time. The goal of this
paper is to demonstrate the benefits and applicability of such route guidance using a case
study. An adaptive discretization scheme is first proposed to improve the efficiency in
computing convolution, a time-consuming step used in the reliable routing algorithm to
obtain path travel time distributions. Methods to construct link travel time distributions from …
Reliable route guidance can be obtained by solving the reliable a priori shortest path problem, which finds paths that maximize the probability of arriving on time. The goal of this paper is to demonstrate the benefits and applicability of such route guidance using a case study. An adaptive discretization scheme is first proposed to improve the efficiency in computing convolution, a time-consuming step used in the reliable routing algorithm to obtain path travel time distributions. Methods to construct link travel time distributions from real data in the case study are then discussed. Particularly, the travel time distributions on arterial streets are estimated from linear regression models calibrated from expressway data. Numerical experiments demonstrate that optimal paths are substantially affected by the reliability requirement in rush hours, and that reliable route guidance could generate up to 5–15% of travel time savings. The study also verifies that existing algorithms can solve large-scale problems within a reasonable amount of time.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果