Maximum Flow Algorithm For Transshipment Nodes With Flow Demands In Undirected Network

Maximum Flow Problem is a typical network optimization problem. It has widespread application in many science and technology fields, besides solving the problems of practical networks. Most of available maximum flow algorithm aims at directed networks under the conditions of restricted capacity and flow conservation. But the problems in networks of communication and computerization, in fact, are regarded as the maximum flow problem in undirected networks. In addition, transshipment nodes with flow demands widely exist in network of actual application. This kind of transshipment nodes fail to conform to flow conservation. So the traditional algorithm is not a good method to solve this kind of maximum flow problem. In view of the above- mentioned problems, I have accomplished the following work.First of all, the several typical algorithms which lay the groundwork for following research on maximum flow are described briefly. Meanwhile the present situation and the development trend of maximum flow algorithm are introduced.Secondly, a new algorithm is presented which is applicable in the network including transshipment nodes with flow demands, on the basis of the idea of labeling, recording path mark and assignment of the nodes with flow demands. The example of the new algorithm shows the effectiveness and useful worthy.