网络可靠度的不交分解算法  

Disjoint Resolving Algorithm for Network Reliability

作　　者：王菲[1] 闫慧臻[1] 

机构地区：[1]大连轻工业学院基础教学部,辽宁大连116034

出　　处：《大连轻工业学院学报》1999年第4期351-356,共6页Journal of Dalian Institute of Light Industry

摘　　要：不交分解算法是应用分解方法把网络分解成若干个不交的部分，并应用循环算法计算网络的可靠度。该算法将分解和不交和方法融合在一起，主要思想是寻找最短路，然后进行不交分解。由于不交分解算法在计算过程中逐步分解。因此可以根据具体网络，随时选择具体最短路以及最短路中的具体边进行分解。这样就简化了同类算法。与Locks算法相比，可以得到更少的不交项。This paper describes a disjoint resolution algorithm to evaluate the reliability of the network. It is the application of the resolution method by resolving the network into several disjoint parts, and using recurring computation. This algorithm simplifys the caculation, because it resolves the network gradually in the calculating process and it can choose the shortest path as well as the edge in the shortest path to start resolving. This algorithm uses less disjoint terms than that in Lock's algorithm.

关 键 词：网络 系统可靠性 不交和 边失效 不交分解算法 

分 类 号：O157.6[理学—数学]