4.7 Article

Inferencing hourly traffic volume using data-driven machine learning and graph theory

期刊

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.compenvurbsys.2020.101548

关键词

Traffic volume prediction; Spatial dependency; Graph theory; Tree ensemble; XGBoost

资金

  1. Utah DOT
  2. Mountain Plain Consortium (MPC) of the U.S. DOT University Transportation Center [MPC-543]

向作者/读者索取更多资源

This paper introduces an innovative spatial prediction method for hourly traffic volume on a network scale, utilizing the XGBoost tree ensemble model to handle large-scale features and hourly traffic volume samples. In addition, spatial dependency among road segments is considered using graph theory and a graph-based approach in the proposed model. The results from testing on Utah's road network show high computational efficiency and significant improvement in prediction accuracy compared to benchmarked models.
Traffic volume is a critical piece of information in many applications, such as transportation long-range planning and traffic operation analysis. Effectively capturing traffic volumes on a network scale is beneficial to Transportation Systems Management & Operations (TSM&O). Yet it is impractical to install sensors to cover a large road network. To address this issue, spatial prediction techniques are widely performed to estimate traffic volumes at sites without sensors. In retrospect, most relevant studies resort to machine learning methods and treat each prediction location independently during the training process, ignoring the potential spatial dependency among them. This paper presents an innovative spatial prediction method of hourly traffic volume on a network scale. To achieve this, we applied a state-of-the-art tree ensemble model - extreme gradient boosting tree (XGBoost) - to handle the large-scale features and hourly traffic volume samples, due to the model's powerful scalability. Moreover, spatial dependency among road segments is taken into account in the proposed model using graph theory. Specifically, we created a traffic network graph leveraging probe trajectory data, and implemented a graph-based approach - breadth first search (BFS) - to search neighboring sites in this graph for computing spatial dependency. The proposed spatial dependency feature is subsequently incorporated as a new feature fed into XGBoost. The proposed model is tested on the road network in the state of Utah. Numerical results not only indicate high computational efficiency of the proposed model, but also demonstrate significant improvement in prediction accuracy of hourly traffic volume comparing with the benchmarked models.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据