Abstract
Determination of minimal upper paths is an important step in calculating the reliability (i.e. the probability that a required amount of flow can be transmitted from a source to a terminal) of stochastic flow networks. This paper presents an algorithm for determining minimal upper paths of a planar flow network. Four criteria are developed to eliminate unnecessary subnetworks from the enumeration tree. Computational results indicate that the developed criteria are effective in reducing the number of explicitly considered subnetworks, and thereby, in reducing the amount of computational effort required. Minimal upper paths can be also utilized to calculate certain component importance measures or to identify the most reliable path for sending a required amount of flow from a source to a terminal.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
