A Network Partition Approach for MFD-Based Urban Transportation Network Model

• Haitao Xu,
• Weiguo Zhang,
• Zuozhang zhuo,

Vol. 14, No. 11, November 30, 2020
10.3837/tiis.2020.11.013, Download Paper (Free):

• Traffic network partition
• macroscopic fundamental diagram
• spectral clustering
• isoperimetric algorithm
• traffic simulation

Abstract

Recent findings identified the scatter and shape of MFD (macroscopic fundamental diagram) is heavily influenced by the spatial distribution of link density in a road network. This implies that the concept of MFD can be utilized to divide a heterogeneous road network with different degrees of congestion into multiple homogeneous subnetworks. Considering the actual traffic data is usually incomplete and inaccurate while most traffic partition algorithms rely on the completeness of the data, we proposed a three-step partitioned algorithm called Iso-MB (Isoperimetric algorithm - Merging - Boundary adjustment) permitting of incompletely input data in this paper. The proposed algorithm was implemented and verified in a simulated urban transportation network. The existence of well-defined MFD in each subnetwork was revealed and discussed and the selection of stop parameter in the isoperimetric algorithm was explained and dissected. The effectiveness of the approach to the missing input data was also demonstrated and elaborated.

Statistics

Cite this article