流通网络中随机流动的仿真研究

堵塞流是指网络在堵塞情况下通过网络的最大流量，而网络最小流量是网络在最严重堵塞情况下通过网络的最大流量。研究表明，很难从理论上确定一个网络的最小流的准确数值，因此必须借助网络的随机流动仿真试验。本文通过建立流通网络中的随机流动仿真模型来研究一般网络中的堵塞现象及堵塞流运动规律。探索了堵塞流值的概率分布规律，提出了流通网络在随机流动情况下的流通能力的新概念，并证明了作者提出的网络最小流算法的正确性。

Research on Stochastic Flow in a Transportation Network by Simulational Method

Blockage is a kind of phenomenon, happened frequently in a transport network in which human beings are moving subjects. The blocking flow defined in this paper means the maximum flow through a network in the blocked situation of the network. The minimum flow means the maximum flow thourgh the network in the most seriously-blocked situation of the network. The research shows that it is difficult to determine the exact number of the minimum flow theoretionlly. So it is necessary to be proved by the simulational method. The blocking phenomenon and the flow regularity of blocking flow in a transportation network are studied by simulational model. The probability distributions of the different blocking flows are obtained and a new concept and the idex of the flow capacity in a network are presented. The validity of the algorithms is proved for solving the minimum flow problem.