AN EFFICIENT CALCULATION METHOD TO OBTAIN UPPER AND LOWER BOUNDS OF TERMINAL RELIABILITY OF ROAD NETWORKS USING BOOLEAN ALGEBRA
-
- IIDA Yasunori
- THE JAPAN SOCIETY OF CIVIL ENGINEERS
-
- WAKABAYASHI Hiroshi
- THE JAPAN SOCIETY OF CIVIL ENGINEERS
Bibliographic Information
- Other Title
-
- ブール代数を用いた道路網ノード間信頼度の上・下限値の効率的算出法
- ブール ダイスウ オ モチイタ ドウロモウ ノードカン シンライド ノ ウエ
Search this article
Abstract
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.
Journal
-
- Doboku Gakkai Ronbunshu
-
Doboku Gakkai Ronbunshu 1988 (395), 75-84, 1988-07-20
Japan Society of Civil Engineers
- Tweet
Details 詳細情報について
-
- CRID
- 1390282680578492928
-
- NII Article ID
- 130003799615
-
- NII Book ID
- AN10014020
-
- ISSN
- 18827187
- 02897806
-
- NDL BIB ID
- 3192613
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed