Efficient Vulnerability Assessment of Large-Scale Dynamic Transportation Networks

IF 5.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE IEEE Transactions on Reliability Pub Date : 2024-06-19 DOI:10.1109/TR.2024.3413315
Venkateswaran Shekar;Lance Fiondella
{"title":"Efficient Vulnerability Assessment of Large-Scale Dynamic Transportation Networks","authors":"Venkateswaran Shekar;Lance Fiondella","doi":"10.1109/TR.2024.3413315","DOIUrl":null,"url":null,"abstract":"Static and dynamic methods are used to assess the efficiency and vulnerability of transportation networks. Dynamic methods identify both where and when disruptions would be most detrimental. However, exhaustive analysis is computationally prohibitive for large networks because thousands of simulations are required. To enhance the scalability of dynamic transportation network vulnerability assessment, this article presents a subnetwork approach to identify the impact of an edge closure at a specific time by simulating only a portion of the network immediately surrounding the disruption and then incorporating this subnetwork simulation into the baseline scenario without disruptions. Our experiments confirm a strong correlation between the results of complete network simulation and the subnetwork approach with significant computational reductions. Subnetwork size is a tunable parameter, enabling a tradeoff between the accuracy of the subnetwork approach relative to the exhaustive approach and time savings achieved. We also identify a heuristic method to select the subnetwork size for any network to reap the greatest benefits with respect to accuracy and speed up. The subnetwork vulnerability assessment method is subsequently used to allocate limited resources to mitigate travel time disruptions. The approach only required hours not months to complete, advancing methods for city-scale disaster recovery and planning.","PeriodicalId":56305,"journal":{"name":"IEEE Transactions on Reliability","volume":"74 2","pages":"2738-2750"},"PeriodicalIF":5.7000,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Reliability","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10564837/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Static and dynamic methods are used to assess the efficiency and vulnerability of transportation networks. Dynamic methods identify both where and when disruptions would be most detrimental. However, exhaustive analysis is computationally prohibitive for large networks because thousands of simulations are required. To enhance the scalability of dynamic transportation network vulnerability assessment, this article presents a subnetwork approach to identify the impact of an edge closure at a specific time by simulating only a portion of the network immediately surrounding the disruption and then incorporating this subnetwork simulation into the baseline scenario without disruptions. Our experiments confirm a strong correlation between the results of complete network simulation and the subnetwork approach with significant computational reductions. Subnetwork size is a tunable parameter, enabling a tradeoff between the accuracy of the subnetwork approach relative to the exhaustive approach and time savings achieved. We also identify a heuristic method to select the subnetwork size for any network to reap the greatest benefits with respect to accuracy and speed up. The subnetwork vulnerability assessment method is subsequently used to allocate limited resources to mitigate travel time disruptions. The approach only required hours not months to complete, advancing methods for city-scale disaster recovery and planning.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大规模动态交通网络的高效脆弱性评估
采用静态和动态方法对交通网络的效率和脆弱性进行了评估。动态方法可以确定中断最有害的时间和地点。然而,对于大型网络来说,详尽的分析在计算上是令人望而却步的,因为需要成千上万的模拟。为了增强动态运输网络脆弱性评估的可扩展性,本文提出了一种子网方法,通过仅模拟中断周围网络的一部分,然后将该子网模拟纳入基线场景而不中断,从而识别特定时间边缘关闭的影响。我们的实验证实了完整网络模拟结果与子网方法之间的强相关性,并且计算量显著减少。子网大小是一个可调参数,可以在子网方法相对于穷举方法的准确性和节省的时间之间进行权衡。我们还确定了一种启发式方法来选择任何网络的子网大小,从而在准确性和速度方面获得最大的好处。随后采用子网脆弱性评估方法来分配有限的资源,以减轻出行时间中断。这种方法只需要几个小时而不是几个月的时间就能完成,它推进了城市规模的灾难恢复和规划方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Reliability
IEEE Transactions on Reliability 工程技术-工程:电子与电气
CiteScore
12.20
自引率
8.50%
发文量
153
审稿时长
7.5 months
期刊介绍: IEEE Transactions on Reliability is a refereed journal for the reliability and allied disciplines including, but not limited to, maintainability, physics of failure, life testing, prognostics, design and manufacture for reliability, reliability for systems of systems, network availability, mission success, warranty, safety, and various measures of effectiveness. Topics eligible for publication range from hardware to software, from materials to systems, from consumer and industrial devices to manufacturing plants, from individual items to networks, from techniques for making things better to ways of predicting and measuring behavior in the field. As an engineering subject that supports new and existing technologies, we constantly expand into new areas of the assurance sciences.
期刊最新文献
URL2Path: A Robust Graph Learning Approach for Malicious URL Detection A Multisource Data Feature Fusion Method Based on FCN and Residual Attention Mechanism for Remaining Life Prediction of Gas Turbine CoWAR: A General Complementary Web API Recommendation Framework Based on Learning Model Decentralized Event-Triggered Quantized Control for Cyber-Physical Systems Under Multiple-Channel Denial-of-Service Attacks Zero Forgetting Lifelong Dictionary Learning Based on Low-Rank Decomposition for Multimode Process Monitoring
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1