有流量需求和分品种容量限制的运输网络最大流算法

摘要

基于Ford-Fulkerson算法求最大流的思路,对有流量需求的分品种容量限制的运输网络构造最大流算法,将有流量需求的转运节点分为转运节点和汇节点,同时构建单源单汇,寻找增流链进行流量调整.最后,通过示例对算法进行验证,计算出了满足流量需求和分品种容量限制的运输网络的最大流.%Based on the idea of Ford-Fulkerson algorithm for the maximum network flow,this paper developed a maximum flow algorithm for a traffic network in which the transshipment nodes can be divided into the transshipment node,source and sink nodes. The algorithm is validated by an example to show that the maximum flow of the transport network satisfying the traffic demand and the capacity of the sub species can be calculated.