面向宏观基本图的多模式交通路网分区算法

A Partitioning Algorithm of Multimodal Traffic Networks for Obtaining Macroscopic Fundamental Diagram

为探究不同模式交通流之间的相互作用关系,提出一种考虑路网多模式属性的分区算法。以社会车和公交车速度和路段邻接关系为划分依据,提出初始子区划分、子区合并、子区边界调整的三步分区算法。以深圳多模式交通数据为例进行了子区划分实验,结果表明本文算法相较于其他分区算法能得到两种模式异质性都较低的交通小区;通过识别路网子区中的多模式宏观基本图,验证了实际交通路网中存在多模式宏观基本图。

For revealing the interaction between different modes of traffic flow, this paper proposes a network partitioning algorithm considering the multi-mode attributes of the given road network. Considering speed of social vehicles and buses and adjacent matrix of road segments in real network, a three-step framework for network partitioning is proposed which consists of initialized partitioning, subnetwork merging, and boundary adjustment. Various numerical experiments are conducted using real data of Shenzhen road network. The results show that the heterogeneity degree of the partitioned network using the proposed three-step partitioning algorithm are lower than the previous method. In addition, the existence of the multi-mode macroscopic fundamental diagram(MFD) is verified by recognizing the corresponding macroscopic density to flow relationship in the real subnetworks of Shenzhen. Therefore, the proposed algorithm can be used to achieve a well-defined MFD of certain targeted subnetwork.