基于三部图的路网节点关键度排序方法

A Method of Key Node Ranking for Road Network Based on Tripartite Graph

提出了一种基于三部图的路网节点关键度排序方法,首先从城市出租车轨迹数据中提取出行的起始地-目的地信息以及驾驶员路径选择的统计信息,并以此构建出行网络的三部图模型来刻画出行、路径和路口之间的互影响关系.通过节点之间的连接权重矩阵以迭代的方式计算路口节点的关键度评分.该方法有机地结合了路网的拓扑结构和交通流特征,并兼顾了关键路口节点之间以及路口节点与出行的起始地-目的地分布之间的相关性,可以有效准确地识别整个路网的关键节点.实验验证了方法的有效性.

A method of key node ranking for road network based on tripartite graph was proposed. The statistical information of routes and origin-destination( OD) of trips were extracted from taxi trajectories, and then a tripartite graph was built to model interrelationship among the nodes consist of trips,paths and intersections. The ratings of these nodes were synchronously calculated in an iterative process. This method not only incorporates topological structure and traffic characteristics,but also takes correlation between intersection and OD distribution into account,so network-wide key nodes can be identified accurately. Experiment verifies the validity of the method.