TY - JOUR
AB - Many real-world systems (such as electric power, transportation, etc.) are multistate systems composed of multistate components. Such systems may be regarded as flow networks whose arcs have independent, discrete, limited and multivalued random capacities. Their reliabilitycan be computed in terms of minimal cut (MC) vectors to level (d; c) (named (d; c)-MCs here), using the probabilitythat d units of flow can be transmitted from the source node to the sink node such that the total maintenance cost of each d-MCs is less than or equal to c: In this study, all MCs are assumed to be known in advance and we developed an intuitive algorithm based on some simple concepts that were found in this studyto find the entire (d; c)-MCs before calculating the reliabilityvalue of a network. One example is illustrated to show how all (d; c)-MCs are generated bythe proposed algorithm. Then the reliability of this example is computed. The computational complexityof the proposed algorithm is also analyzed.
AU - Yeh, W
DA - 2004/01/01
DO - 10.1016/S0925-5273(03)00180-4
EP - 83
JO - International Journal Of Production Economics
PB - Elsevier Science Bv
PY - 2004/01/01
SP - 73
TI - Multistate Network Reliability Evaluation Under The Maintenance Cost Constraint
VL - 88
Y1 - 2004/01/01
Y2 - 2020/01/23
ER -