An evaluation of the multi-state node networks reliability using the traditional binary-state networks reliability algorithm |
| |
Authors: | Wei-Chang Yeh |
| |
Affiliation: | e-Integration & Collaboration Laboratory, Department of Industrial Engineering, Feng Chia University, P.O. Box 67-100, Taichung 408, Taiwan, ROC |
| |
Abstract: | A system where the components and system itself are allowed to have a number of performance levels is called the Multi-state system (MSS). A multi-state node network (MNN) is a generalization of the MSS without satisfying the flow conservation law. Evaluating the MNN reliability arises at the design and exploitation stage of many types of technical systems. Up to now, the known existing methods can only evaluate a special MNN reliability called the multi-state node acyclic network (MNAN) in which no cyclic is allowed. However, no method exists for evaluating the general MNN reliability. The main purpose of this article is to show first that each MNN reliability can be solved using any the traditional binary-state networks (TBSN) reliability algorithm with a special code for the state probability. A simple heuristic SDP algorithm based on minimal cuts (MC) for estimating the MNN reliability is presented as an example to show how the TBSN reliability algorithm is revised to solve the MNN reliability problem. To the author's knowledge, this study is the first to discuss the relationships between MNN and TBSN and also the first to present methods to solve the exact and approximated MNN reliability. One example is illustrated to show how the exact MNN reliability is obtained using the proposed algorithm. |
| |
Keywords: | Network reliability Multi-state system Multi-state node network Multi-state node acyclic network Traditional binary-state network Sum-of-disjoint-products Minimal cut |
本文献已被 ScienceDirect 等数据库收录! |
|