Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal, K. K., Gupta, J. S., & Misra, K. B. (1975). A simple method for reliability evaluation of a communication system. IEEE Transactions on Communications, 23, 563–565.
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).
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.
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.
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).
Chen, S. G., & Lin, Y. K. (2012). Search for all minimal paths in a general large flow network. IEEE Transactions on Reliability, 61(4), 949–956.
Chen, S. G., & Lin, Y. K. (2016). Searching for \(d\)-MPs with fast enumeration. Journal of Computational Science, 17, 139–147.
Colbourn, C. J. (1987). The combinatorics of network reliability. Oxford: Oxford University Press.
Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press.
Lee, S. H. (1980). Reliability evaluation of a flow network. IEEE Transactions on Reliability, 29, 24–26.
Lin, J. S., Jane, C. C., & Yuan, J. (1995). On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks, 25, 131–138.
Lin, Y. K. (2001). A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Computers and Operations Research, 28(13), 1277–1285.
Lin, Y. K., & Chen, S. G. (2017a). A maximal flow method to search for \(d\)-MPs in stochastic-flow networks. Journal of Computational Science, 22, 119–125.
Lin, Y. K., & Chen, S. G. (2017b). A merge search approach to find minimal path vectors in multistate networks. International Journal of Reliability, Quality and Safety Engineering, 24(1), 1750005-1–1750005-12.
Ramirez-Marquez, J. E., & Gebre, B. A. (2007). A classification tree based approach for the development of minimal cut and path vectors of a capacitated network. IEEE Transaction on Reliability, 56(3), 474–487.
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)
Xue, J. (1985). On multistate system analysis. IEEE Transactions on Reliability, 34(4), 329–337.
Yeh, W. C. (2001). A simple algorithm to search for all \(d\)-MPs with unreliable nodes. Reliability Engineering and System Safety, 73, 49–54.
Yeh, W. C. (2002). A simple method to verify all \(d\)-minimal path candidates of a limited-flow network and its reliability. The International Journal of Advanced Manufacturing Technology, 20(1), 77–81.
Zuo, M. J., Tian, Z., & Huang, H. Z. (2007). An efficient method for reliability evaluation of multistate networks given all minimal path vectors. IIE Transactions, 39, 811–817.
Acknowledgements
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.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Lin, YK., Chen, SG. An efficient searching method for minimal path vectors in multi-state networks. Ann Oper Res 312, 333–344 (2022). https://doi.org/10.1007/s10479-019-03158-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-019-03158-6