Abstract
A stochastic-flow network in which nodes as well as arcs all have both capacity and cost attributes is studied. We evaluate the possibility that the maximum flow of the network is not less than a demand under the budget constraint. Such a possibility is in general called the system reliability. A minimal path, an order sequence of arcs & nodes from the source to the sink without cycles, is used to assign the flow to each component (arc or node). Based on minimal paths, an efficient algorithm is proposed to generate all (d, C)-MPs that are the minimal capacity vectors meeting the demand d and the budget C. The system reliability can then be calculated in terms of all (d, C)-MPs.
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 callMore From: International Journal of Reliability, Quality and Safety Engineering
Disclaimer: 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.
