• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

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

立即免费搜索

文件翻译

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

免费翻译文档

深度研究

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

立即免费体验

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

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.

DOI:10.1371/journal.pone.0301272
PMID:38593152
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC11003686/
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/e29521c6efa4/pone.0301272.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c3b6/11003686/9f1909fb3521/pone.0301272.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c3b6/11003686/00499faa91f6/pone.0301272.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c3b6/11003686/451e13d6b287/pone.0301272.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c3b6/11003686/cae8da5b47cd/pone.0301272.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c3b6/11003686/e29521c6efa4/pone.0301272.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c3b6/11003686/9f1909fb3521/pone.0301272.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c3b6/11003686/00499faa91f6/pone.0301272.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c3b6/11003686/451e13d6b287/pone.0301272.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c3b6/11003686/cae8da5b47cd/pone.0301272.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c3b6/11003686/e29521c6efa4/pone.0301272.g005.jpg

相似文献

1
Identification of critical links based on the optimal reliable path in stochastic traffic networks.基于最优可靠路径的随机交通网络关键链路识别。
PLoS One. 2024 Apr 9;19(4):e0301272. doi: 10.1371/journal.pone.0301272. eCollection 2024.
2
Identification of critical links in a large-scale road network considering the traffic flow betweenness index.考虑交通流量介数的大规模路网关键链路识别。
PLoS One. 2020 Apr 10;15(4):e0227474. doi: 10.1371/journal.pone.0227474. eCollection 2020.
3
School bus routing problem in the stochastic and time-dependent transportation network.随机和时变交通网络中的校车路径问题。
PLoS One. 2018 Aug 23;13(8):e0202618. doi: 10.1371/journal.pone.0202618. eCollection 2018.
4
Degradable transportation network with the addition of electric vehicles: Network equilibrium analysis.添加电动汽车后的可降解交通网络:网络均衡分析
PLoS One. 2017 Sep 8;12(9):e0184693. doi: 10.1371/journal.pone.0184693. eCollection 2017.
5
An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm.基于贪心算法的城市道路网络修复优化调度
PLoS One. 2016 Oct 21;11(10):e0164780. doi: 10.1371/journal.pone.0164780. eCollection 2016.
6
Congestion patterns of electric vehicles with limited battery capacity.具有有限电池容量的电动汽车的拥塞模式。
PLoS One. 2018 Mar 15;13(3):e0194354. doi: 10.1371/journal.pone.0194354. eCollection 2018.
7
Understanding the marginal distributions and correlations of link travel speeds in road networks.理解路网中链路行驶速度的边缘分布和相关性。
Sci Rep. 2020 Jul 16;10(1):11821. doi: 10.1038/s41598-020-68810-9.
8
Heterogeneous Data Fusion Method to Estimate Travel Time Distributions in Congested Road Networks.用于估计拥堵道路网络中行程时间分布的异构数据融合方法
Sensors (Basel). 2017 Dec 6;17(12):2822. doi: 10.3390/s17122822.
9
Traffic assignment in urban transportation network problem with emission constraints in China: a cooperative game theory.中国具有排放约束的城市交通网络问题中的交通分配:合作博弈论。
Environ Sci Pollut Res Int. 2023 Jun;30(26):69274-69288. doi: 10.1007/s11356-023-27108-9. Epub 2023 May 3.
10
Short-Term Traffic State Prediction Based on the Critical Road Selection Optimization in Transportation Networks.基于交通网络关键路段选择优化的短期交通状态预测。
Comput Intell Neurosci. 2021 Aug 30;2021:9966382. doi: 10.1155/2021/9966382. eCollection 2021.

本文引用的文献

1
Identification of critical links in a large-scale road network considering the traffic flow betweenness index.考虑交通流量介数的大规模路网关键链路识别。
PLoS One. 2020 Apr 10;15(4):e0227474. doi: 10.1371/journal.pone.0227474. eCollection 2020.
2
A deterministic approach for rapid identification of the critical links in networks.一种用于快速识别网络中关键链路的确定性方法。
PLoS One. 2019 Jul 17;14(7):e0219658. doi: 10.1371/journal.pone.0219658. eCollection 2019.