An algorithm for calculating multi-state network reliability with arbitrary capacities of the links
Date Issued
2008
Author(s)
Stojkovic, Natasha
Popeska, Zaneta
Abstract
The problem that we regard in this paper is known as the multi-state two-terminal
reliability computation, and we consider how the concept of the minimal path and cut vectors is
used in modeling the reliability of these types of systems. The main focus is to develop an algorithm for obtaining minimal path vectors for multi-state two-terminal network. The proposed algorithm differs from the other known algorithms for this problem, because it does not request any
restrictions for the values of the capacities of the links. Some examples to illustrate the algorithm are included.
reliability computation, and we consider how the concept of the minimal path and cut vectors is
used in modeling the reliability of these types of systems. The main focus is to develop an algorithm for obtaining minimal path vectors for multi-state two-terminal network. The proposed algorithm differs from the other known algorithms for this problem, because it does not request any
restrictions for the values of the capacities of the links. Some examples to illustrate the algorithm are included.
Subjects
File(s)![Thumbnail Image]()
Loading...
Name
page170 copy.pdf
Size
101.73 KB
Format
Adobe PDF
Checksum
(MD5):4f7f3e54d70ff0e9485887d4765ae32b