运输网络极大流的一种新算法

A NEW ALGORITHM OF MAXIMAL FLOW IN TRANSPORTATION NETWORK

从网络整体水平上来研究道路网的容量是一个没有很好解决的课题。本文根据运输网络的特点,应用网络流理论基本定律,提出了一种无向网络极大流算法。利用本算法不必将无向网络转化为有向网络,可直接进行道路网容量分析。文中给出了计算机程序框图和实例分析。

In this paper, an algorithm of maximal flow in an undirected network, the Evolving Cut Set Method(ECS method), is put forward based on the attributes of transportation networks. The theoretic basis of the ECS method is the famous theorem, that is, the maximal flow the minimum cut set theorem, which was presented, by Ford and Fulkerson in 1957.The capacity of an undirected network can be calculated directly by the ECS model.It is more adaptable for urban transportation networks.The computer flow chart of the ECS algorithm is given in this paper.The overall capacity of a large city arterial network in China is analyzed by use of the model.