一类流量增减最大值可预见的不确定网络最大流的模型与算法

Model and Algorithm for the Maximum Flow on an Uncertain Network with the Maximum Value of Increase or Decrease of Flows Predicted

不确定网络最大流问题是现实中普遍存在的一种网络流问题,针对该问题中的流在传输过程中增减并存的特征给出了一种模型及算法.将其网络上增加弧上的增加量作为初始输入量之一,经过特定运算将其转化为只损耗网络,运用有损耗网络最大流问题的算法进行最终求解.最后,通过实例验证了其正确性.

A problem for maximum flows on uncertain networks is a problem that exists widely in practice. In this paper, a model and algorithm for such a problem are given correspording to properties that flows on its networks may decrease or increase. Firstly, the increasing arcs are as one of the input＇flow sources on networks of this problem which is then transferred to a problem for maximum flows on loss networks, which is solved by itself algorithm. Finally,such a algorithm proves correct by a given example.