Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (11): 243-245.DOI: 10.3778/j.issn.1002-8331.2010.11.074

• 工程与应用 • Previous Articles     Next Articles

Algorithm of urban traffic network capacity based on virtual vertices max-flow

WANG Min,QIAN Yong-sheng,WANG Shou-bao   

  1. School of Traffic and Transportation,Lanzhou Jiaotong University,Lanzhou 730070,China
  • Received:2008-09-08 Revised:2008-12-04 Online:2010-04-11 Published:2010-04-11
  • Contact: WANG Min

基于虚拟顶点最大流的城市路网通行能力算法

王 敏,钱勇生,王守宝   

  1. 兰州交通大学 交通运输学院,兰州 730070
  • 通讯作者: 王 敏

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.

Key words: traffic network capacity, max-flow min-cut, traffic flow

摘要: 针对城市道路路网通行能力的确定问题,通过引入虚拟起、讫点改造路网。应用图论中最大流最小割定理,对最大流算法进行了改进;提出了一种在容量限制下确定路网通行能力的算法,使得多起点、多讫点的道路路网通行能力的确定得以简化。用算例验证了算法的正确性。

关键词: 路网通行能力, 最大流最小割, 交通流

CLC Number: