考虑点和线的有向无环网络连通可靠性研究  

Research for connectivity reliability of directed acyclic network considering nodes and lines

作　　者：崔铁军[1,2,3] 马云东[3] 

机构地区：[1]辽宁工程技术大学,安全科学与工程学院,辽宁阜新123000 [2]矿山热动力灾害与防治教育部重点实验室,辽宁阜新123000 [3]大连交通大学辽宁省隧道与地下结构工程技术研究中心,辽宁大连116028

出　　处：《计算机应用研究》2015年第11期3315-3318,共4页Application Research of Computers

摘　　要：诸如交通网络、供水网络、电信网络、燃气网络等在人们的生活中极其重要,但是这些网络容易受到自然和人为等因素的影响导致失效,进而降低其连通性。为研究其连通性问题,改进SCM（sequential compounding method）实现了考虑点和线可靠性的有向无环网络连通性的计算方法。该算法是一种快速可靠性评价算法,其结果是近似的,适用于分析可分解为点—线—点结构的网络,特别适用于有一定统计规律的网络。算法主要由两种运算组成,即＂与＂合并和＂或＂合并,通过这两种运算将网络化简直到合并为一个点为止。计算八种典型的网络,并将结果与文献和MCS（Monte Carlo simulations）比较,结果表明,提出的算法与MCS相比计算得到的连通性略有不同,误差在-6.2%~4.6%;但是计算时间差别很大,大约是MCS的1.2%~9.2%。Such as the transportation network, water supply network, telecommuniications network and gas networks was extremely important in our life, but these networks were vulnerable to the influence of natural and man-made factors lead to the failure, and reduced its connectivity. For the study of the connectivity problem, based on sequential compounding method, this paper achieved the calculation method considering the reliability of node and line of directed acyclic network connectivity. The algorithm was a fast reliability evaluation algorithm, the result was similar, and it was suitable for the analysis the network that could be decomposed into node-line-node, especially the networks had certain statistical regularity. Algorithm mainly consists of two kinds of compounding operation ＂intersection＂ and ＂union＂, through these two kinds of operation network was to compound into a single point. Calculation of 8 kinds of typical network, and compared the results with the literature and the MCS, the results show that the proposed algorithm is compared with the MCS calculated connectivity is slightly different, error in 6.2% - 4.6%. But calculating time difference is very big, is about 1.2% - 9.2% of the MCS.

关 键 词：网络连通性 有向无环网络 可靠性 SCM “与”合并运算 “或”合并运算 

分 类 号：TP301.4[自动化与计算机技术—计算机系统结构]