| 基于虚拟顶点最大流的城市路网通行能力算法 |
| |
| 引用本文： | 王敏,钱勇生,王守宝.基于虚拟顶点最大流的城市路网通行能力算法[J].计算机工程与应用,2010,46(11):243-245. |
| |
| 作者姓名： | 王敏 钱勇生 王守宝 |
| |
| 作者单位： | 兰州交通大学交通运输学院,兰州,730070 |
| |
| 摘 要： | 针对城市道路路网通行能力的确定问题，通过引入虚拟起、讫点改造路网。应用图论中最大流最小割定理，对最大流算法进行了改进；提出了一种在容量限制下确定路网通行能力的算法，使得多起点、多讫点的道路路网通行能力的确定得以简化。用算例验证了算法的正确性。
|
| 关 键 词： | 路网通行能力 最大流最小割 交通流 |
| 收稿时间： | 2008-9-8 |
| 修稿时间： | 2008-12-4
|
Algorithm of urban traffic network capacity based on virtual vertices max-flow |
| |
| WANG Min,QIAN Yong-sheng,WANG Shou-baoSchool of Traffic , Transportation,Lanzhou Jiaotong University,Lanzhou ,China.Algorithm of urban traffic network capacity based on virtual vertices max-flow[J].Computer Engineering and Applications,2010,46(11):243-245. |
| |
| Authors: | WANG Min QIAN Yong-sheng WANG Shou-baoSchool of Traffic Transportation Lanzhou Jiaotong University Lanzhou China |
| |
| Affiliation: | WANG Min,QIAN Yong-sheng,WANG Shou-baoSchool of Traffic , Transportation,Lanzhou Jiaotong University,Lanzhou 730070,China |
| |
| Abstract: | An algorithm is proposed to determine urban traffic network capacity with road sections capacity confined.The urban traffic network is transformed by adding virtual origin and destination,the max-flow min-cut theorem is used and the maximum flow algorithm is improved,the algorithm about urban traffic network capacity is simplified.Experiment shows that the algorithm is right. |
| |
| Keywords: | traffic network capacity max-flow min-cut traffic flow |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
