Research on network maximum flow algorithm and its application网络最大流算法与应用研究.pdfVIP

摘要 网络最大流问题在科学和工程等领域应用广泛，许多线性规划的实际问题都可转化为 网络最大流的模型来求解，密切了图论与线性规划问题，开辟了图论应用的新途径。随着 交通、电力、物流等大规模发展以及计算机技术的广泛应用，人们对最大流问题的研究越 来越深入，逐渐建立了较为完善的理论，提出了一系列的算法。本文针对现有的求解网络 最大流算法存在的步骤繁复、计算量大、由于增广链选取的顺序不当而无法得到理想的最 大流等问题，主要做了如下工作： （1）提出了一种基于深度优先的网络最大流算法，该算法的基本思想就是利用分层网 络的概念和 DFS 原理，并加入终止符的概念，在一个网络图上就可以完成整个求解最大流 的过程，改进后的方法有效的提高了算法的效率，最后通过具体实例验证了该方法的性能 与实用性。 （2）引入顶点度的概念提出了一种基于顶点度的网络最大流算法。算法的主要思想就 是在增广链算法的基础上，引入顶点度的概念来选择增广链。改进后的方法更加直观，计 算方便，稳定性更强。 （3）深入的探讨网络最大流问题的推广应用和实现。网络最大流问题在现实生活中应 用广泛，有些实际问题都可以转化成网络最大流问题进行求解，本文总结探讨了最大流问 题的延伸应用。另外，介绍了最大流算法在计算机下的实现，从而解决了最大流算法只针 对小规模网络的局限性。 关键词：最大流问题，深度优先，分层网络，分区，出度，入度，最大匹配 I Abstract The maximum flow problem is widely used in science and engineering, is a close connection between graph theory and linear programming problem, many linear programming problems can be transformed into the network flow model to solve, opened up a new way in application of graph theory. As the rapid development of the traffic, electric power, logistics and the wide application of computer technology, people put forward a series of algorithm through make a deeply research continuously ,and gradually complete the maximum flow theory. There are a lot of complicated calculation and steps in the existing algorithm for solving the maximum networks flow, and because of improper selection order of augmented path, we can not get the ideal maximum flow. Around these problems some investigations are made as follows. Firstly, this paper puts forward a new algorithm for solving the maximum flow problem which make use of depth first search theory and hierarchical network. By adding the concept of terminator, the entire operation process only needs drawing a diagram to be completed. The improved algorithm