An efficient searching method for minimal path vectors in multi-state networks
- 12 Downloads
Searching for minimal path vectors (MPVs) is an important topic in solving network related problems, especially for the evaluation of network reliability. One of the popular approaches, namely the three-stage method (TSM), is influenced deeply on the efficiency of searching for minimal path vectors in multi-state networks (MSN). TSM consists of three stages, i.e., searching for all minimal path sets, searching for all MPVs, and calculating union probability on MPVs. After reviewing previous works in the literaure, this paper proposes a more efficient method based on cyclic check on the candidates of MPVs, which can do an efficient searching for MPVs in MSNs and even reduce the three-step approach to two-step approach. Benchmarking with the well-known algorithms are made in this paper, and more complicated networks are also examined for verification of the proposed method.
KeywordsNetwork reliability Minimal path sets Minimal path vectors Fast enumeration Cyclic check
This research is supported in part by the Ministry of Science and Technology, Taiwan, Republic of China, under Grant Nos. MOST 106-2221-E-011-101-MY1 and MOST 106-2221-E-236-006.
- Chen, S. G. (2013). Efficiency improvement in explicit enumeration for integer programming problems. In 2013 IEEE international conference on industrial engineering and engineering management, Bangkok, Thailand (pp 98–100).Google Scholar
- Chen, S. G. (2014a). Reduced recursive inclusion–exclusion principle for the probability of union events. In 2014 IEEE international conference on industrial engineering and engineering management (pp. 1–3). Selangor, Malaysia.Google Scholar
- Chen, S. G. (2014b). Reduced recursive sum of disjoint product in network reliability. In 2014 the 20th ISSAT international conference on reliability and quality in design (pp. 170–173). Seattle, Washington, USA.Google Scholar
- Chen, S. G. (2016). Optimal re-arrangement in fast enumeration for integer programming problems. In 2016 IEEE international conference on industrial engineering and engineering management, (pp 1255–1258).Google Scholar
- Colbourn, C. J. (1987). The combinatorics of network reliability. Oxford: Oxford University Press.Google Scholar
- Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press.Google Scholar
- Rebaiaia, M. L., Ait-Kadi, D. (2012). An efficient algorithm for enumerating minimal pathsets in communication networks. In 4th international conference on networked digital technologies, Springer, Berlin, Dubai, UAE, communications in computer and information science, (Vol. 293, pp. 444–458)Google Scholar
- Xue, J. (1985). On multistate system analysis. IEEE Transactions on Reliability, 34(4), 329–337.Google Scholar