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

A New Maximum-Flow Method of Urban Road Network Capacity

作　　者：吴海燕[1] 高进博[1] 冷传才[1] 

机构地区：[1]北京建筑工程学院,北京100044

出　　处：《交通运输系统工程与信息》2006年第2期51-56,共6页Journal of Transportation Systems Engineering and Information Technology

基　　金：北京市自然基金资助(8012008)

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

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

分 类 号：U491[交通运输工程—交通运输规划与管理]