交通网络两个相邻结点之间有流量约束的最大流分配算法

Maximum Flow Distributing Algorithm under Restricted Flow Condition Between Two Neighboring Sites in Traffic Network

交通网络最大流的分配是基于容量限制条件和流量守恒条件进行的,但在实际应用中,往往对交通网络中两个相邻结点之间的流量有具体的要求和约束限制。本文对交通网络中两个相邻结点之间的流量约束问题进行了分析,基于寻找增流链的算法,构造了带有上限或下限三种流量约束限制条件下的最大流分配算法,这些算法可以为解决实际的交通问题提供一定的应用基础。

For the traffic network, the distributing maximum flow is entirely based on the conditions of the capacity restriction and the flow conservation, but in practical, the flow between two neighboring sites is restricted. In this article, by description and analysis, and in order to find an add-flow-path algorithm, three optimization algorithms with an upper limit and lower limit maximum flow were put forward on the traffic network. These optimization algorithms were likely to offer an application base for the practical traffic problems.