PurposeThe purpose of this paper is to attempt to realize the optimization of cascading failure process of urban transit network based on Load‐Capacity model, for better evaluating and improving the operation of transit network.Design/methodology/approachRobustness is an essential index of stability performance for urban transit systems. In this paper, firstly, the static robustness of transit networks is analyzed based on the complex networks theory. Aiming at random and intentional attack, a concrete algorithm process is proposed on the basis of Dijstra algorithm. Then, the dynamic robustness of the networks, namely cascading failure, is analyzed, and the algorithm process is presented based on the Load‐Capacity model. Finally, the space‐of‐stations is adopted to build the network topology of Foshan transit network, and then the simulation analyses of static and dynamic robustness are realized.FindingsResults show that transit network is robust to random attack when considering static robustness, but somewhat vulnerable to intentional attack. For dynamic robustness analysis, a large‐scale cascade of transit network may be triggered when the tolerance parameter α is less than a value, so that the robustness of transit network can be improved through some reasonable measures.Practice implicationsThe results of this study provide useful information for urban transit network robustness optimization.Originality/valueAn effective method for analyzing the static and dynamic robustness of transit network is provided in this paper.
In this paper, we propose an evolving network model growing fast in units of module, according to the analysis of the evolution characteristics in real complex networks. Each module is a small-world network containing several interconnected nodes and the nodes between the modules are linked by preferential attachment on degree of nodes. We study the modularity measure of the proposed model, which can be adjusted by changing the ratio of the number of innermodule edges and the number of inter-module edges. In view of the mean-field theory, we develop an analytical function of the degree distribution, which is verified by a numerical example and indicates that the degree distribution shows characteristics of the small-world network and the scale-free network distinctly at different segments. The clustering coefficient and the average path length of the network are simulated numerically, indicating that the network shows the small-world property and is affected little by the randomness of the new module.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.