流量网络
脆弱性(计算)
计算机科学
临界性
流量(计算机网络)
交通生成模型
网络拓扑
脆弱性评估
复杂网络
毒物控制
关键基础设施
拓扑(电路)
数据挖掘
数学优化
工程类
计算机网络
数学
计算机安全
电气工程
物理
环境卫生
万维网
心理弹性
医学
核物理学
心理治疗师
心理学
作者
Hana Takhtfiroozeh,Mihalis M. Golias,Sabyasachee Mishra
标识
DOI:10.1177/03611981211013039
摘要
An important part of transportation network vulnerability analysis is identifying critical links where failure may lead to severe consequences, and the potential of such incidents cannot be considered negligible. Existing transportation network vulnerability assessment can be categorized as topological, or traffic based. Topological-based assessment identifies the most critical components in the network by considering network structure and connectivity. Traffic-based assessment identifies the most critical components in the network by full-scan analysis and takes into consideration effects of link failures to traffic flow assignment. The former approach does not consider traffic flow dynamics and fails to capture the non-linearity performance function of transport systems while the latter, even though accurate and robust, requires significant computational power and time and may not always be feasible for real life size networks. The primary objective of this paper is to propose new link criticality measures and evaluate their accuracy for transportation network vulnerability assessment. These measures combine characteristics of traffic equilibrium and network topology to balance accuracy and computational complexity. Nine measures are proposed, and their accuracy is compared with three existing traffic-based measures using three case study transportation networks from the literature. Results indicate that three of the proposed measures show strong correlation to the three traffic-based measures while requiring significantly less computational power and time.
科研通智能强力驱动
Strongly Powered by AbleSci AI