Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2014, Vol. 37 ›› Issue (s1): 51-54.doi: 10.13190/j.jbupt.2014.s1.010

• Papers • Previous Articles     Next Articles

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

XU Ming1,2, WU Jian-ping2, DU Yi-man2, XIE Feng3, XIAO Yun-peng1   

  1. 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:
     

PDF

326

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

CLC Number: 

Copyright © 2018 Journal of Beijing University of Posts and Telecommunications 京ICP备14033833号

Adress: BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS    Post Code: 100876    Tel: (010)62281995    QQ: 307514248    weibo    Message    E-mail: byxb@bupt.edu.cn