论文部分内容阅读
限制条件下网络最大流问题是网络优化中的一个实际应用问题,在限制条件下求出网络最大流,合理地进行流量分配,并对网络部分环节进行改造,达到限制条件下网络优化最大的效果,对合理提高利用现有的网络资源,有明显的应用背景、理论意义和应用价值。限制条件下的网络最大流问题要比理论上的单纯的网络最大流问题复杂。本论文收集和查阅了大量的这方面的文献资料,对此问题进行了深入的系统的理论研究、分析,并在此基础上提出了一些自己的见解,特别是在求解最佳修改边的问题上,取得了较好的结论。与此同时,本论文也给出了限制条件下最大流问题的理论求解方法和数学算法,并用Visual Basic 6.0程序设计语言设计和实现了限制条件下最大流问题自动求解。该系统已运行通过,并显示出良好的效果。本系统是图论中的理论问题转化为实际问题一个初步尝试,目标是实现限制条件下最大流及应用问题的完全智能化。
The problem of the maximum flow in the network is a practical problem in the network optimization under the restricted conditions. The maximum flow of the network is obtained under the limited conditions, the traffic distribution is carried out reasonably, and some parts of the network are modified to achieve the maximum network optimization under the limited conditions , There is a clear application background, theoretical significance and application value for rational utilization of existing network resources. The problem of the maximum network flow under the condition of restriction is more complicated than that of the simple network maximum flow problem. This dissertation collects and consults a great deal of literature in this field, conducts in-depth systematic theoretical research and analysis on this issue, and puts forward some own opinions based on it, especially in solving the problem of the best modification On, made a good conclusion. At the same time, this thesis also gives the theoretical solution and mathematical algorithm of the maximum flow under the condition of restriction, and uses Visual Basic 6.0 programming language to design and realize the automatic solution of the maximum flow under the limit condition. The system is running and shows good results. The system is a preliminary attempt to translate the theoretical problem in graph theory into a practical one, with the goal of achieving full intelligence of the maximum flow and application problems under the constraint conditions.