桂林市公交换乘网络的实证分析  

Empirical Analysis of Guilin′s Bus Transfer Network

作　　者：覃炳发 李科赞 QIN Bingfa;LI Kezan(School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004, China)

机构地区：[1]桂林电子科技大学数学与计算科学学院,广西桂林541004

出　　处：《复杂系统与复杂性科学》2020年第2期22-30,共9页Complex Systems and Complexity Science

基　　金：国家自然科学基金(61663006)。

摘　　要：考虑公交线路上下行不一致的情形,以桂林市区公交网络为例,利用网络分析结果,为公交线路的优化提供理论依据。首先,研究桂林市区公交换乘有向网络的度分布、平均路径长度等特性量。结果表明,网络度值的累积概率呈现出对数函数形式;度值、介数、紧密度最高的站点均为桂林站,说明桂林站为核心站点。其次,运用随机和蓄意两种攻击方法对网络进行破坏,随机攻击下的平均最短路径以及连通度的变化幅度和速度都比遭受蓄意攻击的低,说明网络在面对随机攻击时的鲁棒性较好。最后,利用PageRank算法对网络节点的重要性进行排序,挖掘出了公交网络中的关键站点。This paper considers the inconsistency between the upgoing and downgoing bus lines.Taking the bus network in Guilin as an example,use the network analysis results to provide a theoretical basis for the optimization of the bus lines.Firstly,the characteristics of the degree distribution,average path length,etc.of the bus transfer network in the urban area of Guilin are studied.The results show that the cumulative probability of the network degree value is in the form of a logarithmic function.The Guilin station has the highest degree,betweenness and compactness,which indicate that the Guilin station is the core station.Secondly,both random and deliberate attack methods are used to destroy the network.The changes of average shortest path and connectivity under random attack are slighter than the deliberate attack,which means that the network is more robust against random attack.Finally,the PageRank algorithm is used to rank the importance of network nodes,and key stations in the bus transfer network are mined.

关 键 词：公交换乘有向网络 平均路径长度 鲁棒性 PAGERANK算法 

分 类 号：O29[理学—应用数学]