DETERMINATION OF THE MOST RELIABLE PATH OF A PLANAR FLOW NETWORK

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 149
  • Download : 0
For a planar stochastic flow network with binary states of elements, this paper presents an algorithm for determining the most reliable path (MRP) for transmitting a required amount of flow from a source to a terminal. We first establish a theorem stating that the MRP is one of the minimal upper paths (MUPs). This implies that the criteria, developed in a previous article (Lee and Yum, Reliab. Engng System Safety, 39 (1993) 1-10) to eliminate those subnetworks that cannot be a MUP, are still effective in determining the MRP. In the present article, we develop two additional elimination criteria based upon the inherent property of the MRP. An example is included to illustrate the proposed procedures, and computational results are reported.
Publisher
ELSEVIER SCI LTD
Issue Date
1994
Language
ENG
Article Type
Article
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0