| 引用本文: | 寇玮华,崔皓莹.运费无差异的多品种流交通网络最小费用算法[J].哈尔滨工业大学学报,2014,46(8):122.DOI:10.11918/j.issn.0367-6234.2014.08.021 |
| KOU Weihua,CUI Haoying.A minimum cost algorithm for multicommodity flow traffic network which has same convey cost[J].Journal of Harbin Institute of Technology,2014,46(8):122.DOI:10.11918/j.issn.0367-6234.2014.08.021 |
|
| 摘要: |
| 为了解决交通网络应用中多品种流问题,对运送费用无差异的多品种流交通网络进行分析,在借鉴连续最短路算法和Ford-Fulkerson算法基础上,构造了复合参数和复合指标．基于设定的复合参数、复合指标以及相应的计算规则,构建了多品种流交通网络最小费用流分配算法,通过算例验证了算法的可行性．运费无差异的多品种流交通网络最小费用算法为解决交通运输领域普遍存在的运送费用无差异的多品种流最小费用流问题提供了应用基础． |
| 关键词: 多品种流 交通网络 最小费用流 复合参数和复合指标 连续最短路算法 Ford-Fulkerson算法 |
| DOI：10.11918/j.issn.0367-6234.2014.08.021 |
| 分类号:U113 |
| 基金项目:国家自然科学基金资助项目(71271176). |
|
| A minimum cost algorithm for multicommodity flow traffic network which has same convey cost |
|
KOU Weihua,CUI Haoying
|
|
(School of Transportation and Logistics, Southwest Jiaotong University, 610031 Chengdu, China)
|
| Abstract: |
| To solve the multicommodity flow problem in traffic network, this paper analyses the multicommodity flow traffic network with same cost, and builds the composite parameters and composite indicators on account of the successive shortest path algorithm and the Ford-Fulkerson algorithm. Based on the corresponding calculation rules of composite parameters and composite indicators, this paper builds a minimum cost flow algorithm for multicommodity flow traffic network and the feasibility of this algorithm is verified by an example. This algorithm provides the basis to solve the problem of multicommodity flow minimum cost flow with same cost which is quite widespread in the field of transportation. |
| Key words: the multicommodity flow traffic network minimum-cost flow composite parameters and composite indicators successive shortest path algorithm Ford-Fulkerson algorithm |
