AN EFFICIENT CALCULATION METHOD TO OBTAIN UPPER AND LOWER BOUNDS OF TERMINAL RELIABILITY OF ROAD NETWORKS USING BOOLEAN ALGEBRA
Yasunori Iida, Hiroshi Wakabayashi · Doboku Gakkai Ronbunshu · 1988
This paper proposes a new method to estimate upper and lower bounds of reliability between node pairs in road networks. The conventional calculation methods using all the minimal path sets and cut sets are impractical for a large system since the path sets and cut sets include a large number of elements. The proposed method is quite useful since it requires only partial minimal path sets and cut sets. An efficient way of selection of the paths and cuts is investigated, and an algorithm for a Boolean manipulation is developed. Also a numerical example of small size network is executed to examine the validity of the method.