DocumentCode :
742490
Title :
Ordering Heuristics for Reliability Evaluation of Multistate Networks
Author :
Guanghan Bai ; Zuo, Ming J. ; Zhigang Tian
Author_Institution :
Dept. of Mech. Eng., Univ. of Alberta., Edmonton, AB, Canada
Volume :
64
Issue :
3
fYear :
2015
Firstpage :
1015
Lastpage :
1023
Abstract :
This paper develops ordering heuristics to improve the efficiency of reliability evaluation for multistate two-terminal networks given all minimal path vectors ( d-MPs for short). In the existing methods, all d-MPs are treated equally. However, we find that the importance of each d-MP is different, and different orderings affect the efficiency of reliability evaluation. Based on the above observations, we introduce the length definitions for d-MPs in a multistate two-terminal network, and develop four ordering heuristics, called O1, O2, O3, and O4, to improve the efficiency of the Recursive Sum of Disjoint Products (RSDP) method for evaluating network reliability. The results show that the proposed ordering heuristics can significantly improve the reliability evaluation efficiency, and O1 performs the best among the four methods. In addition, an ordering heuristic is developed for the reliability evaluation of multistate two-terminal networks given all minimal cut vectors ( d-MCs).
Keywords :
graph theory; network theory (graphs); reliability; O1 heuristics; O2 heuristics; O3 heuristics; O4 heuristics; RSDP method; d-MP; minimal path vectors; multistate two-terminal networks; network reliability; ordering heuristics; recursive sum of disjoint product method; reliability evaluation; Indexes; Mechanical engineering; Periodic structures; Production; Reliability; Scholarships; Transportation; Minimal cut vectors; minimal path vectors; multistate reliability; ordering heuristics; two-terminal networks;
fLanguage :
English
Journal_Title :
Reliability, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9529
Type :
jour
DOI :
10.1109/TR.2015.2430491
Filename :
7109927
Link To Document :
بازگشت