网络可靠度分析的最小割递推分解算法-地震工程与工程振动.pdfVIP

27 5 Vo.l 27 No. 5 2007 10 JOURNAL OF EARTHQUAKE ENGINEERING AND ENG INEERING V IBRATION Oct. 2007 : 1000-1301( 2007) 05- 0033- 07 1, 2 1 1 李 杰 , 刘 威 , 钱摇琨 ( 1. 200092; 2. , 200092) : , , , , , : ; ; ; : TU311. 41 : A M in im al cut-based recursive decom position algorithm for network reliab ility analy sis 1, 2 1 1 Li Jie L iu W ei Q ian Yaokun ( 1. Building Eng ineering D epartm ent, Tongj iU niversity, Shanghai 200092, China; 2. Civ il Engineering D isaster Prevention Lab, TongjiUniversity, Shanghai 200092; China) Abs tract: In this paper, am in mi al cut-based recursive decomposition algorithm is presented to calculate the failure probab ility of newt ork system. In the algorithm, a complementary structural function is established. During the process of decomposing the complementary structural function, the disjoint m in mi al cuts and the d isjoint m inmi al paths are obtained one by one. Once all disjointm in mi al cuts are decomposed, the failure probability of the ne-t w ork can be calculated by adding the probab ility of all d isjoint m in mi al cuts. For large-scale network, as it is mi - possible to decompose alld isjointm inmi al cuts of the netw ork, the probab ility inequality can be used to evaluate the approxmi ate solution w hich satisfies a prescribed error bound. The results of tw o examples show that the