A minimal path-based method for computing multistate network reliability
Summary: Most of modern technological networks that can perform their tasks with various distinctive levels of efficiency are multistate networks, and reliability is a fundamental attribute for their safe operation and optimal improvement. For a multistate network, the two-terminal reliability at demand level \(d\), defined as the probability that the network capacity is greater than or equal to a demand of \(d\) units, can be calculated in terms of multistate minimal paths, called \(d\)-minimal paths \((d\)-MPs) for short. This paper presents an efficient algorithm to find all \(d\)-MPs for the multistate two-terminal reliability problem. To advance the solution efficiency of \(d\)-MPs, an improved model is developed by redefining capacity constraints of network components and minimal paths (MPs). Furthermore, an effective technique is proposed to remove duplicate \(d\)-MPs that are generated multiple times during solution. A simple example is provided to demonstrate the proposed algorithm step by step. In addition, through computational experiments conducted on benchmark networks, it is found that the proposed algorithm is more efficient.
- Efficient enumeration of d-minimal paths in reliability evaluation of multistate networks
- An improved algorithm for reliability bounds of multistate networks
- A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
- Reliability evaluation of a multicommodity capacitated-flow network in terms of minimal pathsets
- A novel node-based sequential implicit enumeration method for finding all d-MPs in a multistate flow network
- A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
- A quick inclusion-exclusion technique
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
- Computational investigations of maximum flow algorithms
- Efficient enumeration of d-minimal paths in reliability evaluation of multistate networks
- Evaluating cost and reliability integrated performance of stochastic logistics systems
- scientific article; zbMATH DE number 1924497 (Why is no real title available?)
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- Reliability Evaluation of Multistate Systems with Multistate Components
- Reliability evaluation in terms of flow data mining for multistate networks
- An efficient searching method for minimal path vectors in multi-state networks
- A permutation-and-backtrack approach for reliability evaluation in multistate information networks
- Efficient enumeration of d-minimal paths in reliability evaluation of multistate networks
- Reliability evaluation of a multistate network subject to time constraint under routing policy
- Reliability evaluation of multi-state systems based on the max-flow theory and decomposition technique
- Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate
- Evaluating the reliability of a novel deterioration-effect multi-state flow network
- An improved algorithm for reliability bounds of multistate networks
- Reliability Evaluation of a Multi-state Network with Multiple Sinks under Individual Accuracy Rate Constraint
- A novel node-based sequential implicit enumeration method for finding all d-MPs in a multistate flow network
- Reliability optimization of component assignment problem for a multistate network in terms of minimal cuts
- Reliability of a two‐dimensional demand‐based networked system with multistate components
- Simulation-based system reliability estimation of a multi-state flow network for all possible demand levels
- Reliability evaluation of multi-state systems under cost consideration
This page was built for publication: A minimal path-based method for computing multistate network reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223237)
