Improving arrival time prediction of Thailand's passenger trains using historical travel times

Suporn Pongnumkul, Thanakij Pechprasarn, Narin Kunaseth, Kornchawal Chaipah
{"title":"Improving arrival time prediction of Thailand's passenger trains using historical travel times","authors":"Suporn Pongnumkul, Thanakij Pechprasarn, Narin Kunaseth, Kornchawal Chaipah","doi":"10.1109/JCSSE.2014.6841886","DOIUrl":null,"url":null,"abstract":"The State Railway of Thailand provides passengers with train location information on their Web site, which includes the name of the last station that each train arrives at or departs from, along with the timestamps and the accumulative train delay (in minutes) from the train timetable. This information allows passengers to intuitively predict the arrival time at their station by adding the last known train delay to the scheduled arrival time. This paper aims at providing a more accurate prediction of passenger train's arrival times using the historical travel times between train stations. Two algorithms that use train location information and historical travel times are proposed and evaluated. The first algorithm uses the moving average of historical travel times. The second algorithm utilizes the travel times of the k-nearest neighbors (k-NN) of the last known arrival time. To evaluate the proposed algorithms, we collected six months of data for three different trains and calculated prediction errors using mean absolute error (MAE). The prediction errors of the proposed algorithms are compared to the prediction errors of the baseline algorithm that predicts the arrival time by adding the last known train delay to the scheduled train arrival time. Both algorithms outperform the baseline prediction. The algorithm based on moving average travel time improves the prediction error by 22.9 percent on average, and the algorithm based on k-NN improves the prediction error by 23.0 percent on average (k=16).","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2014.6841886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 35

Abstract

The State Railway of Thailand provides passengers with train location information on their Web site, which includes the name of the last station that each train arrives at or departs from, along with the timestamps and the accumulative train delay (in minutes) from the train timetable. This information allows passengers to intuitively predict the arrival time at their station by adding the last known train delay to the scheduled arrival time. This paper aims at providing a more accurate prediction of passenger train's arrival times using the historical travel times between train stations. Two algorithms that use train location information and historical travel times are proposed and evaluated. The first algorithm uses the moving average of historical travel times. The second algorithm utilizes the travel times of the k-nearest neighbors (k-NN) of the last known arrival time. To evaluate the proposed algorithms, we collected six months of data for three different trains and calculated prediction errors using mean absolute error (MAE). The prediction errors of the proposed algorithms are compared to the prediction errors of the baseline algorithm that predicts the arrival time by adding the last known train delay to the scheduled train arrival time. Both algorithms outperform the baseline prediction. The algorithm based on moving average travel time improves the prediction error by 22.9 percent on average, and the algorithm based on k-NN improves the prediction error by 23.0 percent on average (k=16).
利用历史旅行时间改进泰国客运列车到达时间预测
泰国国家铁路公司(State Railway of Thailand)在其网站上为乘客提供列车位置信息,其中包括每列火车到达或出发的最后一站的名称,以及列车时刻表上的时间戳和累计列车延误(以分钟为单位)。通过将最后一班已知的列车延误时间添加到预定到达时间中,乘客可以直观地预测到达车站的时间。本文的目的是利用历史火车站之间的旅行时间,对旅客列车到达时间进行更准确的预测。提出并评估了两种利用列车位置信息和历史行程时间的算法。第一种算法使用历史旅行时间的移动平均。第二种算法利用最后已知到达时间的k近邻(k-NN)的旅行时间。为了评估所提出的算法,我们收集了三个不同列车的六个月数据,并使用平均绝对误差(MAE)计算预测误差。将所提算法的预测误差与基线算法的预测误差进行了比较。基线算法通过将最后已知列车延误加入预定列车到达时间来预测到达时间。两种算法都优于基线预测。基于移动平均行程时间的算法将预测误差平均提高22.9%,基于k- nn的算法将预测误差平均提高23.0% (k=16)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信