交通运输系统工程与信息 ›› 2006, Vol. 6 ›› Issue (2): 51-56 .

• 系统工程理论与方法 • 上一篇    下一篇

路网容量最大流的一种改进算法

吴海燕,高进博,冷传才   

  1. 北京建筑工程学院,北京100044
  • 收稿日期:2005-12-30 修回日期:1900-01-01 出版日期:2006-04-20 发布日期:2006-04-20

A New Maximum-Flow Method of Urban Road Network Capacity

WU Hai-yan,GAO Jin-bo,LENG Chuan-cai   

  1. Beijing Institute of Civil Engineering and Architecture,Beijing 100044,China
  • Received:2005-12-30 Revised:1900-01-01 Online:2006-04-20 Published:2006-04-20

摘要: 对城市道路网的路网容量理论和模型进行了研究,在国内外现有较成熟的路网容量模型研究的基础上,分析了各种模型的假设条件、模型特点以及模型应用范围;并分析了国内外现有的最大流算法及其缺陷,提出了改进的算法,并在Matlab 中得到实现;最后,在中关村实例中进行了应用,效果良好.

关键词: 城市道路网, 路网容量, 最大流算法, 矩阵

Abstract: In this paper,urban road network capacity analysis theory and its application are introduced,based on the oversea and domestic road network capacity research results. Assumption term,model characteristics and applications limitations are involved . The maximum-flow algorithm in urban road network capacity analysis is introduced. The shortages of algorithm are put forward and an improved algorithm is developed in this paper,which will make the result more effective. The algorithm is in practice under Matlab. Finally,it is used in Zhongguancun’s Case Study and got well effect.

Key words: urban road network, network capacity, maximum-flow algorithm, matrix