| 路网容量及最大流算法研究 |
| |
| 引用本文： | 高进博,吴海燕,冷传才,张蕊.路网容量及最大流算法研究[J].道路交通与安全,2006,6(1):10-13,43. |
| |
| 作者姓名： | 高进博 吴海燕 冷传才 张蕊 |
| |
| 作者单位： | 北京建筑工程学院 北京100044 |
| |
| 摘 要： | 对城市道路网的现有路网容量理论和模型进行了研究,在国内外现有较成熟的路网研究方法的基础上,分析了各种模型的假设条件、模型特点以及模型应用范围,并基于最大流、最小割理论分析了国内外现有的最大流算法及其缺陷,提出了改进的算法和在Matlab中的实现方式。
|
| 关 键 词： | 路网容量 最大流算法 矩阵 |
Urban Road Network Capacity and Maximum Flow Algorithm Improvement |
| |
| GAO Jinbo,WUHaiyan,LENG Chuancai,ZHANG Rui.Urban Road Network Capacity and Maximum Flow Algorithm Improvement[J].Road Traffic & Safety,2006,6(1):10-13,43. |
| |
| Authors: | GAO Jinbo WUHaiyan LENG Chuancai ZHANG Rui |
| |
| Abstract: | In this paper, urban road network capacity calculation theory and its application are introduced,based on the oversea and domestic mature road net capacity studies. Analyzing assumption term, modelcharacteristics and applications limitations of each model are also inducted. The maximum flow algorithm isalso introduced which based on maximum flow and minimum section method. Finally, the shortage of thealgorithm is analyzed and the improving method had been developed, which will make the algorithm moreeffective and make it in practice under the Matlab. |
| |
| Keywords: | network capacity Maximum Flow Algorithm matrix |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
