Transit vehicle arrival prediction - Algorithm and large-scale implementation

被引:33
作者
Dailey, DJ [1 ]
Maclean, SD [1 ]
Cathey, FW [1 ]
Wall, ZR [1 ]
机构
[1] Univ Washington, Seattle, WA 98195 USA
来源
TRANSPORTATION NETWORK MODELING 2001: PLANNING AND ADMINIATRATION | 2001年 / 1771期
关键词
D O I
10.3141/1771-06
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
An algorithm is presented to predict transit vehicle arrival times up to I h in advance. It uses the time series of data from an automated vehicle location system, consisting of time and location pairs. These data are used with historical statistics in an optimal filtering framework to predict future arrivals. The algorithm is implemented for a large transit fleet in Seattle, Washington, and the prediction results for hundreds of locations are made widely available on the Web. An evaluation of the second busiest but most complex prediction site is presented to demonstrate the value of prediction over the use of schedules alone.
引用
收藏
页码:46 / 51
页数:6
相关论文
共 4 条
[1]  
Anderson B., 1979, OPTIMAL FILTERING
[2]   A structured approach to developing real-time, distributed network applications for ITS deployment [J].
Dailey, DJ ;
Haselkorn, MR ;
Meyers, D .
ITS JOURNAL, 1996, 3 (03) :163-180
[3]  
DAILEY DJ, 1996, 3941 WARD WASH STAT
[4]  
Press W. H., 1994, NUMERICAL RECIPES C