摘要
本文基于网络最大流原理,提出一种大型网络可靠性评估的增流减流交叉网流法。该方法通过削减某一状态下某些支路的网流来获取另一相关状态下各支路的网流初始直,从而大大减少了各状态下需要计算的增流次数。算例表明,该方法十分有效、此外,本文还就该方法与最小割集法进行了比较研究。
Based on the maximum flow principle about networks, a network flow approach to reliability evaluation in large scale netwerks ty mixing inereasing flow with decreasing flow is proposed in this paper.This approach gets the initial flow of each branch in a r.etwork associated with a state of the retwork by decreasing flows of some branches correlative to another state of the network.As a result, the number of flow compute required can be reduced enormously.The numerical example shows that the approach is powerful. The comparison of this approach with the minimal cutset one is also given in this paper.
出处
《重庆大学学报（自然科学版）》
EI
CAS
CSCD
1990年第4期1-6,共6页
Journal of Chongqing University
关键词
可靠性
网络流
线性规划
算法
reliability
network flow
linear programming
algorithm
