Calculation connectivity reliability of road networks based on recursive decomposition arithmetic

In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic is reviewed. Then the characteristics of road networks, which are different from general networks, are analyzed. Under this condition, an improved recursive decomposition arithmetic is put forward which fits road networks better. Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic. This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems. And because the characteristics of road networks are considered, this arithmetic is greatly simplified. Finally, an example is given to prove its validity.

一种网络可靠度分析的不交和算法

通过对ＡＬＷ算法的改进，得到了一个十分有效的计算网络可靠度的方法。利用本算法所产生的相关系统可靠性公式中的项数，一般要比ＡＬＲ和ＡＬＷ算法所产生的项数少。本算法主要包括两部分，即外循环和内循环。在外循环采用一种新的规则对路径（或割）进行排序，内循环的不交和运算采用单个变量取逆的形式。