| 战时动态交通网络最大能力路径问题算法研究 |
| |
| 引用本文： | 海军,侯远达. 战时动态交通网络最大能力路径问题算法研究[J]. 国防交通工程与技术, 2008, 6(2): 19-22 |
| |
| 作者姓名： | 海军 侯远达 |
| |
| 作者单位： | 军事交通学院,天津,300161;军事交通学院,天津,300161 |
| |
| 摘 要： | 战时或应急条件下，交通网络具有动态特征，研究确定动态交通网络的最大能力路径，不但可以拓展最大流问题基本理论，而且对于完成大规模军用物资的运输保障任务，也有着十分重要的现实意义。提出了动态交通网络最大能力路径的概念，并基于最大流理论，结合实例介绍了寻找最大能力路径的具体算法，有助于紧急情况下确定交通网络中的最大能力路径。
|
| 关 键 词： | 交通网络 路径 最大流 通行能力 |
| 文章编号： | 1672-3953(2008)02-0019-04 |
| 修稿时间： | 2007-10-26 |
Study of the Maximal-Capacity-Path Algorithm of the Dynamic Traffic Network |
| |
| Hai Jun,Hou Yuanda. Study of the Maximal-Capacity-Path Algorithm of the Dynamic Traffic Network[J]. Traffic Engineering and Technology for National Defence, 2008, 6(2): 19-22 |
| |
| Authors: | Hai Jun Hou Yuanda |
| |
| Affiliation: | Hai Jun,Hou Yu,a(The Military Traffic Academy,Tianjin 300161,China) |
| |
| Abstract: | Since the traffic networks have the dynamic features either in wartime or in case of emergency, to study the maximal capacity path of the dynamic traffic networks may not only expand the maximal flow theory, but also be of great practical or immediate importance in helping fulfill the large-scale transport tasks of military materials. The concept of the maximal capacity path of dynamic traffic network, and the maximal-capacity-path algorithm based on the maximal flow theory are put forward and discussed in ... |
| |
| Keywords: | traffic networks path maximal flow traffic capacity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
