摘要
本文首先分析多品种流交通网络的特性,在借鉴Ford-Fulkerson算法的基础上构造了求多品种问题最大流的基于多品种流的Ford-Fulkerson算法。然后分析了多品种流交通网络对特定品种在结点上的流量有要求的几种情况,并设计了这几种情况下交通网络求最大流的算法。在实际交通网络中多品种流问题普遍存在,对特定结点的品种的流量有要求的多品种问题更是不胜枚举,本文的算法为解决实际问题提供了应用基础。
Having analyzed the characteristics of the multi-variety flow traffic network ,a Ford-Fulkerson algorithm for calculating the maximum flow of a multi-variety flow traffic network was designed .According to several cases of a node with flow requirements for some special varieties,the algorithm for the cases were designed respectively.In the real traffic networks the problems in multi-variety flows are existed widely,and the maximum flow determination for some special variety flows is very common,the algorithm could＆amp;nbsp;provide a application basis for these practical problems.
出处
《交通运输工程与信息学报》
2014年第2期83-89,共7页
Journal of Transportation Engineering and Information
