城市常规公交与地铁复合网络构建及鲁棒性分析OA

To address the problem that isolated analysis of conventional bus and subway networks fails to capture actual passenger transfer behaviors and inter-network coupling effects,this study constructs a weighted composite network model of conventional bus and subway systems using the Space L mod-eling method.The model integrates actual spatial distances between nodes,establishing a coupling radius of 660 m via Geographic Information Systems(GIS)and the Amap Application Programming In-terface(API),while excluding stations where the actual walking path is excessive despite meeting straight-line distance criteria.Line carrying capacity and passenger travel time are assigned as edge weights to balance network supply capacity with passenger travel costs.Network topological properties are analyzed using Matlab and Gephi,focusing on core metrics such as average degree,average path length,clustering coefficient,and betweenness centrality.Furthermore,two novel attack strategies are proposed:the Node Centrality Importance Attack Strategy(CIAS),based on multi-attribute decision theory,closeness centrality,and betweenness centrality;and the Degree Attack Strategy of Coupling Nodes(DASCN),which accounts for the substitution effects of coupling nodes.An attack efficiency evalu-ation function is introduced to compare these novel strategies against traditional ones,using Harbin's main urban area as a case study.Performance is evaluated via global efficiency,the relative size of the largest connected subgraph,and the network connectivity rate.The results demonstrate that the composite net-work shows significant improvements in average degree,clustering coefficient,network efficiency,and connectivity rate,with decreased average path length and betweenness centrality,indicating enhanced re-silience.Under identical node removal scales,the CIAS exerts a greater negative impact on network per-formance than traditional strategies,whereas the DASOCN has a comparatively smaller impact on global efficiency,the largest connected subgraph,and connectivity rates.