Maximum Flow Distributing Algorithm under Restricted Capacity Condition at Transportation Network Sites

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.This optimization algorithm can solve the distributing maximum flow problem when more sites have the restricted capacity in an enormous-complex transportation network,and can be applied to the practical transportation problems.