UPPER AND LOWER BOUNDS OF TERMINAL RELIABILITY OF ROAD NETWORKS: AN EFFICIENT METHOD WITH BOOLEAN ALGEBRA

An efficient method for calculating the upper and lower bounds of reliability between a pair of nodes in a road network is presented. The proposed method is characterized by the use of only partial minimal path sets and cut sets for the calculation, whereas the conventional methods require all the minimal path sets and cut sets between a pair of nodes. The effectiveness that results from the use of the partial path and cut sets is discussed, and an algorithm for the calculation of reliability has been developed. An efficient way for selecting the partial path and cut sets is reported, and a numerical example of a small size network is executed to examine the validity of the method. (A)

  • Availability:
  • Corporate Authors:

    Kyoto University

    Disaster Prevention Research, Gokasho
    Uji City, Kyoto,   Japan 
  • Authors:
    • Wakabayashi, H
    • Iida, Y
  • Publication Date: 1992

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00665291
  • Record Type: Publication
  • Source Agency: Transport Research Laboratory
  • Files: ITRD
  • Created Date: Sep 9 1994 12:00AM