联合投送运输网络中关键路段的识别模型
Identification Model of Critical Road Sections in Joint Delivery Transport Network
DOI: 10.12677/OJTT.2022.116048, PDF,    科研立项经费支持
作者: 侯 鹏：国防大学研究生院一大队2队，北京；向光栋, 毛自森*, 娄扑根：陆军工程大学基础部，江苏 南京
关键词: 联合投送；最短路径；关键路段；Joint Delivery； Shortest Path； Key Sections
摘要: 本文首先针对部队联合投送的需求和特点，描述了关键路段的特征；从风险和脆弱性的角度描述了薄弱路段；从中断后影响的角度定义了重要路段；最后给出联合投送关键路段的准确定义和相关建议。
Abstract: Firstly, according to the requirements and characteristics of joint delivery of troops, this paper describes the characteristics of key sections; Weak road sections are described from the perspective of risk and vulnerability; Important sections are defined from the perspective of impact after interruption; Finally, the accurate definition and relevant suggestions of key sections of joint delivery are given.
文章引用：侯鹏, 向光栋, 毛自森, 娄扑根. 联合投送运输网络中关键路段的识别模型[J]. 交通技术, 2022, 11(6): 469-480. https://doi.org/10.12677/OJTT.2022.116048

参考文献

[1] 总参谋部, 总政治部, 总后勤部, 总装备部. 军队联合投送训练规定[A]. 北京: 总参谋部, 2014.
[2] Mine, H. and Kawai, H. (1982) Mathematics for Reliability Analysis. Asakura-Shoten, Tokyo.
[3] Sanso, B. and Milot, L. (1999) Perform Ability off a Congested Urban Transportation Network When Accident Information Is Available. Transportation Science, 33, 68-79. [Google Scholar] [CrossRef] 
[4] Bell, M.G.H. and Iida, Y. (1997) Tralnsportation Network Analysis. John Wiley & Son Inc., Chichester.
[5] D’Este, G.M. and Taylor, M.A.P. (2001) Modelling Network Vulnerability at the Level of the National Strategic Transport Network. Journal of the Eastern Asia Society for Transportation Studies, 4, 1-14.
[6] Scott, D.M., Novak, D.C., Aultman-Hall, L., et al. (2006) Network Robustness Index: A New Method for Identifying Critical Links and Evaluating the Performance of Transportation Networks. Journal of Transport Geography, 14, 215-227. [Google Scholar] [CrossRef] 
[7] 黄正峰. 基于重要度和可靠度的路段质量排序[J]. 重庆交通大学学报, 2009, 28(4): 742-744.
[8] 涂颖菲, 杨超, 陈小鸿. 路网拓扑脆弱性及关键路段分析[J]. 同济大学学报(自然科学版), 2010, 38(3): 364-367, 379.
[9] 江伟, 秦勇, 季全刚, 董宏辉. 路网中关键路段识别的理论方法研究[J]. 道路交通与安全, 2010, 10(2): 38-41.

为你推荐