Abstract
Capacitated stochastic flow networks have wide applications including modelling of electricity, transportation, and delivery networks. Evaluating the reliability of stochastic flow networks is crucial for network design and maintenance. The reliability of a network to deliver a specific demand is subject to flow constraints depending on network purpose. Additionally, for designed networks, our assumptions on arc directionality, node failure and dynamicity of demand and arc reliability—can vary. Consequently, we need a generic framework that accommodates all these variations and helps designers evaluate reliability. In this paper we introduce Flexible Evaluation Algorithm for Reliability, FEAR v1.0 to evaluate reliability of designed networks and provide maintenance plans. We benchmark the performance of our framework against networks from the literature beside introducing a new example of coapplied multiple constraints. Afterward, we validate our framework against recent literature for networks with dynamic arc reliability. Finally, we show a novel maintenance algorithm for dynamic demand. At the end, the framework is proven to work fine for single-source single-sink single-commodity networks for both static and dynamic demands.
Similar content being viewed by others
References
Guo Y, Summers TH (2019) A performance and stability analysis of low-inertia power grids with stochastic system inertia. In: Proceedings of the American Control Conference, 2019, vol. 2019-July, pp 1965–1970. https://doi.org/10.23919/acc.2019.8814402
Chang PC, Lin YK, Huang DH (2019) Reliability for a stochastic flow computer network subject to time constraint and correlated failures. In: Proceedings - 25th ISSAT International Conference on reliability and quality in design, 2019, pp 24–28
Liu Z, Wang S, Zhou B, Cheng Q (2017) Robust optimization of distance-based tolls in a network considering stochastic day to day dynamics. Transp Res Part C Emerg Technol 79:58–72. https://doi.org/10.1016/j.trc.2017.03.011
Lin JS (1998) Reliability evaluation of capacitated-flow networks with budget constraints. IIE Trans (Institute of Industrial Engineers) 30(12):1175–1180. https://doi.org/10.1080/07408179808966574
Hudson JC, Kapur KC (1983) Reliability analysis for multistate systems with multistate components. IIE Trans (Institute of Industrial Engineers) 15(2):127–135. https://doi.org/10.1080/05695558308974623
Aven T (1985) Reliability evaluation of multistate systems with multistate components. IEEE Trans Reliab R-34(5):473–479. https://doi.org/10.1109/TR.1985.5222235
Datta E, Goyal NK (2021) An efficient approach to find reliable topology of stochastic flow networks under cost constraint. Int J Inform Technol (Singapore). https://doi.org/10.1007/s41870-020-00555-0
Lin JS (2016) Reliability evaluation of a multicommodity capacitated-flow network in terms of minimal pathsets. Int J Inf Manage Sci 27(3):269–281. https://doi.org/10.6186/IJIMS.2016.27.3.4
Fardis MN, Cornell CA (1981) Analysis of coherent multistate systems. IEEE Trans Reliab R-30(2):117–122. https://doi.org/10.1109/TR.1981.5221002
Lin J-S, Jane C-C, Yuan J (1995) On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks 25(3):131–138. https://doi.org/10.1002/net.3230250306
Janan X (1985) On multistate system analysis. IEEE Trans Reliab R-34(4):329–337. https://doi.org/10.1109/TR.1985.5222178
Lin YK (2001) A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Comput Oper Res 28(13):1277–1285. https://doi.org/10.1016/S0305-0548(00)00039-3
Lin YK, Huang CF (2013) Stochastic flow network reliability with tolerable error rate. Qual Technol Quant Manag 10(1):57–73. https://doi.org/10.1080/16843703.2013.11673308
Lin YK, Yeh CT, Huang CF (2013) Reliability evaluation of a stochastic-flow distribution network with delivery spoilage. Comput Ind Eng 66(2):352–359. https://doi.org/10.1016/j.cie.2013.06.019
Chiu YH, Lin YK, Nguyen TP (2021) Network reliability of a stochastic online-food delivery system with space and time constraints. Int J Perform Eng 17(5):433–443. https://doi.org/10.23940/ijpe.21.05.p3.433443
Das D, Tripathy CR, Tripathy PK, Kabat MR (2020) System reliability estimation of constrained multi-state computational grids. Int J Inform Technol (Singapore). https://doi.org/10.1007/s41870-018-0132-1
Chang PC (2022) Theory and applications of an integrated model for capacitated-flow network reliability analysis. Comput Ind Eng. https://doi.org/10.1016/j.cie.2021.107877
Bai G, Liu T, Zhang Y, Tao J (2020) An improved method for reliability evaluation of two-terminal multistate networks based on state space decomposition. IEEE Trans Reliab 70(3):1084–1095. https://doi.org/10.1109/tr.2020.2988987
Hudson JC, Kapur KC (1983) Modules in coherent multistate systems. IEEE Trans Reliab R-32(2):183–185. https://doi.org/10.1109/TR.1983.5221522
Hudson JC, Kapur KC (1985) Reliability bounds for multistate systems with multistate components. Oper Res 33(1):153–160. https://doi.org/10.1287/opre.33.1.153
Bai G, Zuo MJ, Tian Z (2015) Ordering heuristics for reliability evaluation of multistate networks. IEEE Trans Reliab 64(3):1015–1023. https://doi.org/10.1109/TR.2015.2430491
Aggarwal KK, Gupta JS, Misra KB (1975) A simple method for reliability evaluation of a communication system. IEEE Trans Commun 23(5):563–566. https://doi.org/10.1109/TCOM.1975.1092838
Ford LR, Fulkerson DR (2015) Flows in networks. Flows Netw. https://doi.org/10.2307/3007401
MathWorks (2018) “MATLAB”
Chen SG, Lin YK (2012) Search for all minimal paths in a general large flow network. IEEE Trans Reliab 61(4):949–956. https://doi.org/10.1109/TR.2012.2220897
Nahman JM (1994) Enumeration of minimal paths of modified networks. Microelectron Reliab 34(3):475–484. https://doi.org/10.1016/0026-2714(94)90086-8
Yeh WC (2007) A simple heuristic algorithm for generating all minimal paths. IEEE Trans Reliab 56(3):488–494. https://doi.org/10.1109/TR.2007.903290
Meghanathan N (2017) “Breadth First Search”, routing protocols and graph theory algorithms for mobile. Ad Hoc Netw. https://doi.org/10.4018/978-1-5225-2227-0.les3
MathWorks (2019) Cell arrays ; Strings. https://www.mathworks.com/help/matlab/cell-arrays.html. Accessed 27 Jul 2021
(1971) Solving integer programs by enumeration. Math Sci Eng 76(C): 81–102, https://doi.org/10.1016/S0076-5392(08)61099-1
Fass D (2004) CARTPROD: Cartesian product of multiple sets. https://www.mathworks.com/matlabcentral/fileexchange/5475-cartprod-cartesian-product-of-multiple-sets. Accessed 17 Aug 2021
Zuo MJ, Tian Z, Huang HZ (2007) An efficient method for reliability evaluation of multistate networks given all minimal path vectors. IIE Trans (Institute of Industrial Engineers) 39(8):811–817. https://doi.org/10.1080/07408170601013653
Lin YK, Yeh CT (2013) A two-stage approach for a multi-objective component assignment problem for a stochastic-flow network. Eng Optim 45(3):265–285. https://doi.org/10.1080/0305215X.2012.669381
Aissou A, Daamouche A, Hassan MR (2021) Components assignment problem for flow networks using MOPSO. IAENG Int J Comput Sci 48(1)
Brailsford SC, Potts CN, Smith BM (1999) Constraint satisfaction problems: algorithms and applications. Eur J Oper Res 119(3):557–581. https://doi.org/10.1016/S0377-2217(98)00364-6
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Elgamal, M.A., Younis, L.Y., Abdou, H.A. et al. Framework for evaluating reliability of stochastic flow networks under different constraints. Int. j. inf. tecnol. 15, 3473–3482 (2023). https://doi.org/10.1007/s41870-023-01312-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s41870-023-01312-9