Heterogeneous Data Fusion Method to Estimate Travel Time Distributions in Congested Road Networks

被引:13
作者
Shi, Chaoyang [1 ,2 ,3 ]
Chen, Bi Yu [1 ,2 ,3 ]
Lam, William H. K. [3 ]
Li, Qingquan [1 ,2 ,4 ]
机构
[1] Wuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430072, Hubei, Peoples R China
[2] Collaborat Innovat Ctr Geospatial Technol, Wuhan 430079, Hubei, Peoples R China
[3] Hong Kong Polytech Univ, Dept Civil & Environm Engn, Hong Kong 999077, Hong Kong, Peoples R China
[4] Shenzhen Univ, Shenzhen Key Lab Spatial Smart Sensing & Serv, Shenzhen 518060, Peoples R China
基金
中国国家自然科学基金;
关键词
travel time distribution; data fusion; evidence theory; spatial correlation; uncertainty; VEHICLE IDENTIFICATION DATA; ALGORITHM; COMBINATION; SYSTEM; MODEL;
D O I
10.3390/s17122822
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
Travel times in congested urban road networks are highly stochastic. Provision of travel time distribution information, including both mean and variance, can be very useful for travelers to make reliable path choice decisions to ensure higher probability of on-time arrival. To this end, a heterogeneous data fusion method is proposed to estimate travel time distributions by fusing heterogeneous data from point and interval detectors. In the proposed method, link travel time distributions are first estimated from point detector observations. The travel time distributions of links without point detectors are imputed based on their spatial correlations with links that have point detectors. The estimated link travel time distributions are then fused with path travel time distributions obtained from the interval detectors using Dempster-Shafer evidence theory. Based on fused path travel time distribution, an optimization technique is further introduced to update link travel time distributions and their spatial correlations. A case study was performed using real-world data from Hong Kong and showed that the proposed method obtained accurate and robust estimations of link and path travel time distributions in congested road networks.
引用
收藏
页数:21
相关论文
共 62 条
[1]  
[Anonymous], 2003, TEXAS TRANSPORTATION
[2]   A comparative assessment of multi-sensor data fusion techniques for freeway traffic speed estimation using microsimulation modeling [J].
Bachmann, Chris ;
Abdulhai, Baher ;
Roorda, Matthew J. ;
Moshiri, Behzad .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2013, 26 :33-48
[3]   Fusing a Bluetooth Traffic Monitoring System With Loop Detector Data for Improved Freeway Traffic Speed Estimation [J].
Bachmann, Chris ;
Roorda, Matthew J. ;
Abdulhai, Baher ;
Moshiri, Behzad .
JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS, 2013, 17 (02) :152-164
[4]   An expert system for multi-criteria decision making using Dempster Shafer theory [J].
Beynon, M ;
Cosker, D ;
Marshall, D .
EXPERT SYSTEMS WITH APPLICATIONS, 2001, 20 (04) :357-367
[5]   Real-Time Estimation of Arterial Travel Times with Spatial Travel Time Covariance Relationships [J].
Chan, K. S. ;
Lam, William H. K. ;
Tam, Mei Lam .
TRANSPORTATION RESEARCH RECORD, 2009, (2121) :102-109
[6]  
Chen B. Y., 2016, TRANSP B, V5, P204
[7]   Finding the k reliable shortest paths under travel time uncertainty [J].
Chen, Bi Yu ;
Li, Qingquan ;
Lam, William H. K. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2016, 94 :189-203
[8]   Spatiotemporal data model for network time geographic analysis in the era of big data [J].
Chen, Bi Yu ;
Yuan, Hui ;
Li, Qingquan ;
Shaw, Shih-Lung ;
Lam, William H. K. ;
Chen, Xiaoling .
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2016, 30 (06) :1041-1071
[9]   Map-matching algorithm for large-scale low-frequency floating car data [J].
Chen, Bi Yu ;
Yuan, Hui ;
Li, Qingquan ;
Lam, William H. K. ;
Shaw, Shih-Lung ;
Yan, Ke .
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2014, 28 (01) :22-38
[10]   Finding Reliable Shortest Paths in Road Networks Under Uncertainty [J].
Chen, Bi Yu ;
Lam, William H. K. ;
Sumalee, Agachai ;
Li, Qingquan ;
Shao, Hu ;
Fang, Zhixiang .
NETWORKS & SPATIAL ECONOMICS, 2013, 13 (02) :123-148