A Simple Method To Verify All d-Minimal Path Candidates Of A Limited-Flow Network And Its Reliability
- Publisher:
- Springer-Verlag London Ltd
- Publication Type:
- Journal Article
- Citation:
- International Journal Of Advanced Manufacturing Technology, 2002, 20 (1), pp. 77 - 81
- Issue Date:
- 2002-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2010004134OK.pdf | 90.03 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Many real-world systems are multistate systems composed of multistate components in which the reliability can be computed in terms of minimal path (MP) vectors to level d (named d- MPs). Such systems (electric power, transportation, etc.) may be regarded as flow networks whose arcs have independent, discrete, limited, and multivalued random capacities. In this study, we focused on how to verify all the d-MP candidates before calculating the reliability value of a network. Based on the special property of d-MPs, we develop an intuitive algorithm which is better than the best-known existing method in verifying the d-MP candidates. Analysis of the proposed algorithm and comparison with existing algorithms shows that the proposed method is easier to understand and implement. Finally, an example is shown to illustrate how all d-MPs are generated and verified by the proposed algorithm. Then the reliability of this example is computed.
Please use this identifier to cite or link to this item: