International Society of Science and Applied Technologies |
|
Study on the Covering Problem in Network Reliability | ||||
Author | Shin-Guang Chen
|
|||
Co-Author(s) |
|
|||
Abstract | This paper discusses a kind of covering problem in network reliability. Minimal path set can be considered as a set of ow combinations. However, in some cases, a subset of the ow combination may required for applications. Therefore, techniques for dealing such cases are needed. This paper proposes a heuristic approach to solve the covering problem in network reliability. Some numerical examples are also presented for explanation. The results show that the cases are interesting in the discussion.
|
|||
Keywords | Network reliability, flow combination, covering problem, minimal path, backtrack | |||
Article #: RQD26-44 |
Proceedings of 26th ISSAT International Conference on Reliability & Quality in Design |