基于贪心介数的地铁-公交复合网络关键车站识别算法

Key Station Recognition Algorithm of Metro-Bus Composite Network Based on Greedy Betweenness

关键车站识别是分析与理解地铁-公交复合网络特性、结构、功能的有效方式。为挖掘地铁-公交复合网络中的关键车站并提高网络鲁棒性,采用Space L方法,建立地铁-公交复合网络模型,提出基于贪心介数的地铁-公交复合网络关键车站识别算法;在介数中心性算法的基础上,引入贪心算法,计算网络结构动态变化下的车站重要度,扩大关键车站的影响力。仿真分析表明,成都市地铁-公交复合网络具有无标度和小世界特性,贪心介数策略攻击对网络性能影响最大,表明该算法具有较高的关键车站识别精度。

Key station identification is an effective way to analyze and understand the characteristics, structure and function of the metro-bus composite network. In order to explore key stations in the metro-bus composite network and improve the robustness of the network, the Space L method is used to establish a metro-bus composite network model, and a greedy betweenness-based key station identification algorithm for metro-bus composite network is proposed. Based on the betweenness centrality algorithm, the greedy algorithm is introduced to calculate the importance of stations under the dynamic changes of the network structure and expand the influence of key stations. Simulation analysis shows that the Chengdu metro-bus composite network has the characteristics of scale-free and small-world, and the greedy betweenness strategy attack has the greatest impact on the network performance, indicating that the algorithm has high accuracy in key station recognition.