Dijkstra算法
弹性(材料科学)
计算机科学
节点(物理)
干扰(通信)
路径(计算)
最短路径问题
运输工程
工程类
计算机网络
图形
理论计算机科学
结构工程
物理
热力学
频道(广播)
作者
Mingming Zheng,Hanzhang Zuo,Zitong Zhou,Yuhan Bai
出处
期刊:Sustainability
[Multidisciplinary Digital Publishing Institute]
日期:2023-10-18
卷期号:15 (20): 15018-15018
被引量:13
摘要
To enhance the resilience of urban rail transit networks in dealing with interference events and facilitating rapid network recovery, this paper focuses on studying damaged urban rail transit networks and proposes comprehensive resilience evaluation indexes for urban rail transit networks that take into account two dimensions: network topology and passenger travel path selection. A bi-level programming model is constructed to maximize the comprehensive toughness, where the upper-level model is an integer planning model for determining the optimal recovery sequence of the affected stations under interference events that result in station closure or inoperability. The lower-level model is a passenger flow allocation model aiming to minimize travelers’ impedance. A genetic algorithm and Dijkstra’s labeling algorithm are used to solve the upper model as well as the shortest path of the lower model, respectively. Using a real-world urban rail transit network as an example, this research applies different recovery strategies, random recovery, node importance-based recovery, and comprehensive toughness-based recovery, across five common interference scenarios to analyze the recovery sequence of stations in each scenario. The modeling results show that the comprehensive toughness-based restoration strategy yields the most favorable results for the rail transportation network, followed by the node importance-based restoration strategy. In addition, the network’s toughness varies more significantly when employing different restoration strategies during target interference, as compared to the random and range interference scenarios.
科研通智能强力驱动
Strongly Powered by AbleSci AI