Suppr超能文献

基于最优可靠路径的随机交通网络关键链路识别。

Identification of critical links based on the optimal reliable path in stochastic traffic networks.

机构信息

School of Management, Xuzhou Medical University, Xuzhou, Jiangsu, China.

School of Public Health, Xuzhou Medical University, Xuzhou, Jiangsu, China.

出版信息

PLoS One. 2024 Apr 9;19(4):e0301272. doi: 10.1371/journal.pone.0301272. eCollection 2024.

Abstract

In urban stochastic transportation networks, there are specific links that hold great importance. Disruptions or failures in these critical links can lead to reduced connectivity within the road network. Under this circumstance, this manuscript proposed a novel identification of critical links mathematical optimization model based on the optimal reliable path with consideration of link correlations under demand uncertainty. The method presented in this paper offers a solution to bypass the necessity of conducting a full scan of the entire road network. Due to the non-additive and non-linear properties of the proposed model, a modified heuristic algorithm based on K-shortest algorithm and inequality technical is presented. The numerical experiments are conducted to show that improve a certain road link may not necessarily improve the overall traffic conditions. Moreover, the results indicate that if the travel time reliability is not considered, it will bring errors to the identification of key links.

摘要

在城市随机交通网络中,存在特定的具有重要意义的关键链路。这些关键链路的中断或故障会导致路网连通性降低。在这种情况下,本文提出了一种基于最优可靠路径的新的关键链路识别数学优化模型,该模型考虑了需求不确定性下链路相关性。该方法提供了一种解决方案,可避免对整个路网进行全面扫描的必要性。由于所提出模型的非可加性和非线性特性,提出了一种基于 K-最短算法和不等式技术的改进启发式算法。数值实验表明,改善某条道路链路不一定能改善整体交通状况。此外,结果表明,如果不考虑旅行时间可靠性,将会对关键链路的识别带来误差。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c3b6/11003686/9f1909fb3521/pone.0301272.g001.jpg

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验