Travel time reliability (TTR) has been widely used as an important evaluation index for traffic performance evaluation. On the network level, the existing analyses tend to simplify the network as a homogeneous one, i.e., ignoring the situation that the traffic states in different regions exist in difference. It may lead to errors in the evaluation of network-level TTR. To this end, the community detection algorithm is applied to help divide the network into several homogeneous clusters, for which TTR could be investigated more sophisticatedly. Concretely, the network is initially partitioned by Fast-Unfolding algorithm, and then the clustering results are enhanced by the Newman fast algorithm. Experiments based on real network traffic data from automatic number plate recognition (ANPR) demonstrate that the proposed method enables to provide of more accurate partition results of the heterogeneous network. The essential heterogeneity in network traffic states can significantly affect the evaluation of the network-level TTR.
Network-Level Travel Time Reliability Analysis via Network Partitioning with Community Detection Algorithms
24th COTA International Conference of Transportation Professionals ; 2024 ; Shenzhen, China
CICTP 2024 ; 1816-1827
2024-12-11
Conference paper
Electronic Resource
English
Spatiotemporal Partitioning of Transportation Network Using Travel Time Data
Transportation Research Record | 2017
|A Simplified Network Model for Travel Time Reliability Analysis in a Road Network
DOAJ | 2017
|Transit network design based on travel time reliability
Online Contents | 2014
|Modelling network travel time reliability under stochastic demand
Online Contents | 2005
|