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

doi:10.13190/j.jbupt.2014.s1.010

北京邮电大学学报 ›› 2014, Vol. 37 ›› Issue (s1): 51-54.doi: 10.13190/j.jbupt.2014.s1.010

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

许明^1,2, 吴建平², 杜怡曼², 谢峰³, 肖云鹏¹

1. 北京邮电大学计算机学院, 北京 100876;
2. 清华大学土木工程系, 北京 100084;
3. 清华大学自动化学院, 北京 100084

收稿日期:2013-11-20 出版日期:2014-06-28 发布日期:2014-06-28
作者简介:许明（1980- ），男，博士生， E-mail：xum@bupt.edu.cn；吴建平（1957- ），男，教授，博士生导师.
基金资助:
国家高技术研究发展计划项目（2012AA063303）

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

XU Ming^1,2, WU Jian-ping², DU Yi-man², XIE Feng³, XIAO Yun-peng¹

1. School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China;
2. School of Civil Engineering, Tsinghua University, Beijing 100084, China;
3. Department of Automation, Tsinghua University, Beijing 100084, China

Received:2013-11-20 Online:2014-06-28 Published:2014-06-28
Supported by:

摘要/Abstract

摘要：

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

关键词: 关键节点, 路网负载度, 道路网络, GPS轨迹

Abstract:

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.

Key words: key node, loading degree of road network, road network, GPS trajectories

中图分类号:

TP243

许明, 吴建平, 杜怡曼, 谢峰, 肖云鹏. 基于三部图的路网节点关键度排序方法[J]. 北京邮电大学学报, 2014, 37(s1): 51-54.

XU Ming, WU Jian-ping, DU Yi-man, XIE Feng, XIAO Yun-peng. A Method of Key Node Ranking for Road Network Based on Tripartite Graph[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2014, 37(s1): 51-54.

[1]	舒坚, 江文良, 刘琳岚. 基于拓扑凝聚图的机会网络关键节点评估[J]. 北京邮电大学学报, 2019, 42(2): 57-62.
[2]	陈雯柏, 崔晓丽, 郝翠, 王文凯. 一种物联网系统层次型抗毁性拓扑构建方法[J]. 北京邮电大学学报, 2018, 41(5): 103-109,114.

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

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

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 2

编辑推荐

Metrics

本文评价