| 道路网络容量的多端最大流算法 |
| |
| 作者姓名： | 苏镇洪 赵文秀 龙科军 |
| |
| 作者单位： | 广州市道路养护中心;长沙理工大学交通运输工程学院 |
| |
| 基金项目： | 广东省交通科技计划项目(2010-02-038);湖南省科技计划资助重点项目(2010WK4001) |
| |
| 摘 要： | 道路网络作为无向网络,其容量分析必须考虑其起始点和终止点的随机开放特性.采用图论的多端最大流算法和衍生割集算法,研究了道路网络容量的计算方法.分析结果表明,新方法能提高计算效率,它不仅适应大规模道路网络复杂性,而且适应路网起、终点开放的特性.
|
| 关 键 词： | 交通工程 路网容量 多端最大流算法 衍生割集算法 割集 |
Analyzing road network capacity based on multi-terminal network maximum flow algorithm |
| |
| Authors: | SU Zhen-hong ZHAO Wen-xiu LONG Ke-jun |
| |
| Institution: | 1.Guangzhou Road Maintenance Center,Guangzhou 510080,China;2.College of Traffic and Transportation Engineering,Changsha University of Science & Technology,Changsha 410004,China) |
| |
| Abstract: | Due to road network is an undirected network,the calculation for road network capacity should be considered as the stochastic and openness of its origin and destination nodes.multi-terminal network maximum flow algorithm and evolving cut set method were combined to calculate the road network capacity.All the results show that the new method can not only satisfy the openness of network nodes,but also reduce the calculating workload. |
| |
| Keywords: | traffic engineering network capacity multi-terminal maximum flow algorithm evolving cut set method cut set |
| 本文献已被 CNKI 等数据库收录！ |
