The Research And Application Of The Minimum Cost Maximum Double Flow Algorithm

There is great significance of the minimum cost maximum double-flow problem,many network optimization problems can be classified as its special cases,such as the shortest path problem,the maximum flow problem,the minimum cost maximum flow problem.With the development of logistics and transport,the need for research the above problems have been unable to meet the development of the transport industry,the urgent need to double the cost flow problem in-depth study of minimum cost maximum double-flow not only has theoretical value,but also has great practical value.In this paper,the traditional minimum cost maximum double-flow algorithm is improved,the main results are as follows:1.By comparing the difference between the network and the remainin g residual network,proposes a minimum cost network based on the maximum residual double algorithm,this algorithm avoids in the construction of the remaining network,caused by the presence of countercurrent augmenting path in confusion.The algorithm is proved to be correct,and the results of simulation experiments show that the algorithm can get the maximum flow of the network.2.This paper presents a new method of unsteady flow,the proportion of the minimum cost flow of double value,based on the maximum and minimum cost double on the adjustment of double value,in the constant current value obtained at the same time the proportion of the minimum total cost.The simulation results show that the proposed algorithm is feasible and effective,and it can solve the problem of the minimum cost flow problem in sparse networks and complex networks.3.The discovery of a new algorithm of minimum cost flow,the new algorithm uses Dijkstra algorithm to improve the search cost path from all source to the meeting point,and in the remaining network augmented flow value,because more than simple network than the rest of the network structure,so the final algorithm improves the time efficiency.The simulation results show that the new algorithm is more suitable for sparse networks than complex networks.4.A new algorithm of minimum cost flow to the capacity cost double network,so as to obtain a new algorithm for solving the minimum cost flow double,an example is given to show that the algorithm is effective.