An algorithm for calculating multi-state network reliability using minimal path vectors
Date Issued
2008
Author(s)
Synagina, Nina
Abstract
We describe methodologies for the reliability analysis of
multi-state systems. Especially, we are concentrating on the
concept of a minimal path and a cut vectors. The problem of
interest is known as the multi-state two-terminal reliability
computation, and we regard how the concept of the minimal
path and cut vectors is used for modelling the reliability of
these types of systems. The main focus of this presentation is
to develop an algorithm for obtaining minimal path vectors
for multi-state two-terminal network with integer capacity of
any link. The proposed algorithm used minimal path vectors
for a binary system with the same structure as the regarded
one. It is based on addition of vectors, so it is simply for
understanding and fast. Examples are included to illustrate the
algorithm.
multi-state systems. Especially, we are concentrating on the
concept of a minimal path and a cut vectors. The problem of
interest is known as the multi-state two-terminal reliability
computation, and we regard how the concept of the minimal
path and cut vectors is used for modelling the reliability of
these types of systems. The main focus of this presentation is
to develop an algorithm for obtaining minimal path vectors
for multi-state two-terminal network with integer capacity of
any link. The proposed algorithm used minimal path vectors
for a binary system with the same structure as the regarded
one. It is based on addition of vectors, so it is simply for
understanding and fast. Examples are included to illustrate the
algorithm.
Subjects
File(s)![Thumbnail Image]()
Loading...
Name
6CiiT-03.pdf
Size
314.35 KB
Format
Adobe PDF
Checksum
(MD5):87343ccfadeccf4309e6de1cb549a694