改进K-shell算法的城市道路网关键交叉口识别  

Identification of key intersections in urban road networks based on improved K-shell algorithm

作　　者：裴玉龙[1] 刘鹤行 王子奇 PEI Yulong;LIU Hehang;WANG Ziqi(Transportation Research Center,Northeast Forestry University,Harbin 150040,China)

机构地区：[1]东北林业大学交通研究中心,哈尔滨150040

出　　处：《重庆理工大学学报（自然科学）》2024年第4期146-153,共8页Journal of Chongqing University of Technology：Natural Science

基　　金：国家重点研发计划项目(2018YFB1600902)。

摘　　要：交叉口重要性不仅与自身属性相关,还受相邻路段属性的影响,针对城市道路网中关键交叉口识别方法准确率不足的问题,提出一种考虑城市道路网特性的改进K-shell算法。即在传统K-shell算法基础上,综合考虑交叉口及其相邻路段的结构特性与交通特性,提出交叉口重要度的概念,利用CRITIC法确定交叉口重要度中相关指标的权重系数,对城市道路网中的交叉口进行重要性排序。以哈尔滨市二环内道路网为例,构建级联失效模型,分析随着失效交叉口比例的增加,不同排序方法下的网络效率、网络最大连通子图比率、故障节点比率的波动情况,结果表明,改进K-shell算法能够更加有效地识别城市道路网关键交叉口。The importance of intersections is not only related to their own attributes,but also influenced by the attributes of adjacent road sections.To address the issue of insufficient accuracy in identifying key intersections in urban road networks,this paper proposes an improved K-shell algorithm considering the characteristics of urban road networks.Based on the traditional K-shell algorithm,the concept of intersection importance is proposed by fully considering the structural characteristics and traffic characteristics of intersections and adjacent road sections.The weight coefficients of relevant indicators in intersection importance are determined by CRITIC method,and the importance of intersections in urban road networks is prioritized.The road network within Harbin Second Ring Road is taken as an example.A cascading failure model is built.As the proportion of failed intersections increases,the fluctuations of network efficiency,ratio of the largest connected sub-graphs,and ratio of faulty nodes under different sorting methods are analyzed.Our results show the improved K-shell algorithm achieves higher efficiency in identifying the key intersections of urban road networks.

关 键 词：城市道路网 关键交叉口 K-SHELL 交叉口重要度 

分 类 号：U491[交通运输工程—交通运输规划与管理]