Opening book details…
Can I read A Practical Bounding Algorithm for Computing Two-terminal Reliability Based on Decomposition Technique on EtoBox?
A Practical Bounding Algorithm for Computing Two-terminal Reliability Based on Decomposition Technique by Yi-feng Niu; Fang-Ming Shao is a Engineering article available to read on EtoBox.
What is A Practical Bounding Algorithm for Computing Two-terminal Reliability Based on Decomposition Technique about?
Two-terminal reliability, which is defined as the probability that there exists at least one path from source node to sink node, is an important performance measure in network system. However, it is well known that the complexity of exact two-terminal reliability evaluation is NP-hard. This paper considers a bounding algorithm for computing twoterminal reliability based on decomposition technique originally used in computing multistate reliability. Compared with traditional bounding algorithms, the proposed algorithm requires neither all MPs/MCs to be enumerated in advance, nor all arcs to have the same state probabilities. It can sequentially improve the quality of approximation according to a predetermined value ε. Especially, it may be an exact algorithm if it runs into completion. An example shows that the proposed algorithm is practical and effective.
Who reads A Practical Bounding Algorithm for Computing Two-terminal Reliability Based on Decomposition Technique?
It is typically read by researchers, students, and practitioners in Engineering.
- Author
- Yi-feng Niu; Fang-Ming Shao
- Publisher
- Elsevier Science; Elsevier ; Elsevier Ltd.; Elsevier BV (ISSN 0898-1221)
- Published
- 2011
- Language
- EN
- Field
- Engineering (Physical Sciences)