期刊文献+

Intersection delay estimation from floating car data via principal curves: a case study on Beijing's road network 被引量:10

Intersection delay estimation from floating car data via principal curves: a case study on Beijing's road network
原文传递
导出
摘要 It is a pressing task to estimate the real-time travel time on road networks reliably in big cities, even though floating car data has been widely used to reflect the real traffic. Currently floating car data are mainly used to estimate the real-time traffic conditions on road segments, and has done little for turn delay estimation. However, turn delays on road intersections contribute significantly to the overall travel time on road networks in modem cities. In this paper, we present a technical framework to calculate the turn delays on road networks with float car data. First, the original floating car data collected with GPS equipped taxies was cleaned and matched to a street map with a distributed system based on Hadoop and MongoDB. Secondly, the refined trajectory data set was distributed among 96 time intervals (from 0:00 to 23: 59). All of the intersections where the trajectories passed were connected with the trajectory segments, and constituted an experiment sample, while the intersections on arterial streets were specially selected to form another experiment sample. Thirdly, a principal curve-based algorithm was presented to estimate the turn delays at the given intersections. The algorithm argued is not only statistically fitted the real traffic conditions, but also is insensitive to data sparseness and missing data problems, which currently are almost inevitable with the widely used floating car data collecting technology. We adopted the floating car data collected from March to June in Beijing city in 2011, which contains more than 2.6 million trajectories generated from about 20000 GPS-equipped taxicabs and accounts for about 600 GB in data volume. The result shows the principal curve based algorithm we presented takes precedence over traditional methods, such as mean and median based approaches, and holds a higher estimation accuracy (about 10%-15% higher in RMSE), as well as reflecting the changing trend of traffic congestion. With the estimation result for the travel delay at intersections, we analyzed the spatio-temporal distribution of turn delays in three time scenarios (0: 00-0: 15, 8: 15-8:30 and 12: 00-12: 15). It indicates that during one's single trip in Beijing, average 60% of the travel time on the road networks is wasted on the intersections, and this situation is even worse in daytime. Although the 400 main intersections take only 2.7% of all the intersections, they occupy about 18% travel time. It is a pressing task to estimate the real-time travel time on road networks reliably in big cities, even though floating car data has been widely used to reflect the real traffic. Currently floating car data are mainly used to estimate the real-time traffic conditions on road segments, and has done little for turn delay estimation. However, turn delays on road intersections contribute significantly to the overall travel time on road networks in modem cities. In this paper, we present a technical framework to calculate the turn delays on road networks with float car data. First, the original floating car data collected with GPS equipped taxies was cleaned and matched to a street map with a distributed system based on Hadoop and MongoDB. Secondly, the refined trajectory data set was distributed among 96 time intervals (from 0:00 to 23: 59). All of the intersections where the trajectories passed were connected with the trajectory segments, and constituted an experiment sample, while the intersections on arterial streets were specially selected to form another experiment sample. Thirdly, a principal curve-based algorithm was presented to estimate the turn delays at the given intersections. The algorithm argued is not only statistically fitted the real traffic conditions, but also is insensitive to data sparseness and missing data problems, which currently are almost inevitable with the widely used floating car data collecting technology. We adopted the floating car data collected from March to June in Beijing city in 2011, which contains more than 2.6 million trajectories generated from about 20000 GPS-equipped taxicabs and accounts for about 600 GB in data volume. The result shows the principal curve based algorithm we presented takes precedence over traditional methods, such as mean and median based approaches, and holds a higher estimation accuracy (about 10%-15% higher in RMSE), as well as reflecting the changing trend of traffic congestion. With the estimation result for the travel delay at intersections, we analyzed the spatio-temporal distribution of turn delays in three time scenarios (0: 00-0: 15, 8: 15-8:30 and 12: 00-12: 15). It indicates that during one's single trip in Beijing, average 60% of the travel time on the road networks is wasted on the intersections, and this situation is even worse in daytime. Although the 400 main intersections take only 2.7% of all the intersections, they occupy about 18% travel time.
出处 《Frontiers of Earth Science》 SCIE CAS CSCD 2013年第2期206-216,共11页 地球科学前沿(英文版)
基金 This research was supported by the National Natural Science Foundation of China (Grant No. 41271408), the National Hi-tech Research and Development Program of China (No. 2012AA12A211) and State Key Laboratory of Resources and Environmental Information System Open Foundation (No. 088RA500KA). And we also thank the anonymous referees for their helpful comments and suggestions.
关键词 intersection delay float car data TRAJECTORY principal curves intersection delay, float car data, trajectory, principal curves
  • 相关文献

参考文献2

二级参考文献54

  • 1Chabini I,Lan S.Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks[J].IEEE Transactions on Intelligent Transportation Systems,2002,3(1):60-74.
  • 2Kohler E,Langkau K,Skutella M.Time-expanded graphs for flow-dependent transit times[C]//Mohring R,Raman R.Algorithms-ESA 2002.Berlin:Springer-Verlag,2002:49-56.
  • 3Pallottino S,Scutella M C.Shortest Path Algorithms in Transportation Models:Classical and Innovative Aspects[M] // Marcotte P,Nguyen S.Equilibrium and Advanced Transportation Modelling.Netherlands:Kluwer,1998.
  • 4Pyrga E,Schulz F,Wagner D,et al.Efficient models for timetable information in public transportation systems[J].ACM Journal of Experimental Algorithmics,2008,12(2.4):1-39.
  • 5Sung K,Bell M G H,Seong M,et al.Shortest paths in a network with time-dependent flow speeds[J].European Journal of Operational Research,2000,121(1):32-39.
  • 6Horn MET.Efficient modeling of travel in networks with time-varying link speeds[J].Networks,2000,36(2):80-90.
  • 7George B,Shekhar S.Time-aggregated graphs for modeling spatio-temporal networks[C]//Spaccapietra S,Pan J z,Thirsn P,et al.Journal on Data Semantics XI.Berlin:Springer-Verlag,2008:191-212.
  • 8Afiez J,De La Barra T,Pérez B.Dual graph representation of transport networks[J].Transportation Research Part B:Methodological,1996,30(3):209-216.
  • 9Winter S.Modeling costs of turns in route planning[J].Geolnformatica,2002,6(4):345-361.
  • 10Winter S.Route specifications with a linear dual graph[C]//Richardson D,van Oosterom P.Advances in Spatial Data Handling.Berlin:Springer-Verlag,2002:329-338.

共引文献70

同被引文献146

引证文献10

二级引证文献87

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部