| 运输网络转运结点有容量限制的最大流分配算法 |
| |
| 引用本文： | 寇玮华,李宗平. 运输网络转运结点有容量限制的最大流分配算法[J]. 交通运输工程与信息学报, 2008, 6(4): 5-9 |
| |
| 作者姓名： | 寇玮华 李宗平 |
| |
| 作者单位： | 西南交通大学,交通运输学院,成都,610031;西南交通大学,交通运输学院,成都,610031 |
| |
| 基金项目： | 国家自然科学基金 ， 教育部高等学校博士学科点专项科研基金 |
| |
| 摘 要： | 对运输网络转运结点有容量限制的最大流分配一般是用结点一分为二的方法，但在大型、复杂的运输网络中，当有容量限制的结点很多时，这种方法将会使运输网络变得更加庞大，流量分配的过程变得更加繁琐。通过分析容量限制结点的特点，基于寻找增流链的算法，构造了基于大型、复杂运输网络中结点有容量限制的最大流分配算法。利用此算法，可以解决大型、复杂运输网络中容量限制的结点很多时的最大流分配问题，此算法也为解决实际的运输问题提供了应用基础。
|
| 关 键 词： | 大型复杂运输网络 最大流分配 结点容量限制 增流链 Ford-Fulkerson算法 |
Maximum Flow Distributing Algorithm under Restricted Capacity Condition at Transportation Network Sites |
| |
| KOU Wei-hua,LI Zong-ping. Maximum Flow Distributing Algorithm under Restricted Capacity Condition at Transportation Network Sites[J]. Journal of Transportation Engineering and Information, 2008, 6(4): 5-9 |
| |
| Authors: | KOU Wei-hua LI Zong-ping |
| |
| Affiliation: | KOU Wei-hua LI Zong-ping College of Traffic & Transportation,Southwest Jiaotong University,Chengdu 610031,China |
| |
| Abstract: | When the maximum flow distribution was carried out in a transportation network,the site under restricted capacity is usually to be divided into two sites.But in an enormous-complex transportation network,this method should make the network very large,in addition,the distributing maximum flow process will be more complicated.In this article,by analyzing the characteristics of these sites and based on the adjusting process of the add-flow-path,a distributing maximum flow algorithm is put forward in the paper.... |
| |
| Keywords: | Large transportation network maximum flow distribution sites with restricted capacity add-flow-path Ford-Fulkerson algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
