Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths

A real-life manufacturing system can be modeled as a stochastic-flow network in which nodes stand for the machine stations, and arcs stand for the shipping media. In terms of minimal paths (MPs), this paper presents a stochastic-flow network model with four characteristics: (1) both nodes and arcs have multiple possible capacities, and may fail; (2) each component (arc/node) has both capacity and cost attributes; (3) two-commodity are proceeded; and (4) the capacity weight varies with arcs, nodes, and types of commodity. We study the possibility of two-commodity to be transmitted through this network simultaneously under the budget constraint. Such a possibility is named as the system reliability. The MPs play the role of media to describe the relationship among flow assignments and capacity vectors. Subsequently, a simple algorithm, in terms of MPs, is proposed to evaluate the system reliability. From the capacity management and decision making viewpoints, managers may adopt the system reliability as a performance index to measure the system capacity and finally to determine if it meets the customers' orders or not.

[1]  Yuanlong Shen,et al.  A new simple algorithm for enumerating all minimal paths and cuts of a graph , 1995 .

[2]  B. Rothschild,et al.  On Two Commodity Network Flows , 1966, Oper. Res..

[3]  John Yuan,et al.  Reliability evaluation of a limited-flow network in terms of minimal cutsets , 1993 .

[4]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[5]  Yi-Kuei Lin,et al.  Study on the multicommodity reliability of a capacitated-flow network☆ , 2001 .

[6]  E. Jamoulle,et al.  Transportation networks with random arc capacities , 1972 .

[7]  Lester Randolph Ford,et al.  A Suggested Computation for Maximal Multi-Commodity Network Flows , 2004, Manag. Sci..

[8]  John J. Jarvis.  On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem , 1969 .

[9]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[10]  Amjed M. Al-Ghanim,et al.  A heuristic technique for generating minimal path and cutsets of a general network , 1999 .

[11]  Jsen-Shung Lin,et al.  Reliability evaluation of capacitated-flow networks with budget constraints , 1998 .

[12]  K.K. Aggarwal,et al.  Capacity Consideration in Reliability Analysis of Communication Systems , 1982, IEEE Transactions on Reliability.

[13]  Xue Janan,et al.  On Multistate System Analysis , 1985, IEEE Transactions on Reliability.

[14]  Yi-Kuei Lin,et al.  Reliability Evaluation for an Information Network With Node Failure Under Cost Constraint , 2007, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[15]  Yi-Kuei Lin,et al.  ON RELIABILITY EVALUATION OF A STOCHASTIC-FLOW NETWORK IN TERMS OF MINIMAL CUTS , 2001 .

[16]  Chin-Chia Jane,et al.  On reliability evaluation of a capacitated-flow network in terms of minimal pathsets , 1995, Networks.

[17]  Wei-Chang Yeh,et al.  A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network , 1998 .

[18]  Yi-Kuei Lin,et al.  Reliability of a stochastic-flow network with unreliable branches & nodes, under budget constraints , 2004, IEEE Trans. Reliab..

[19]  Wei-Chang Yeh.  A simple approach to search for all d-MCs of a limited-flow network , 2001, Reliab. Eng. Syst. Saf..

[20]  K. K. Aggarwal,et al.  A Simple Method for Reliability Evaluation of a Communication System , 1975, IEEE Trans. Commun..

[21]  J. Abraham.  An Improved Algorithm for Network Reliability , 1979, IEEE Transactions on Reliability.

[22]  Wei-Chang Yeh.  A simple algorithm to search for all d-MPs with unreliable nodes , 2001, Reliab. Eng. Syst. Saf..

[23]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .

[24]  John Erik Hershey,et al.  Fast algorithm for computing the reliability of a communication network , 1991 .

[25]  Weiwe-Chang Yeh.  A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes , 2004, Reliab. Eng. Syst. Saf..

[26]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[27]  Wei-Chang Yeh.  A new approach to evaluate reliability of multistate networks under the cost constraint , 2005 .

[28]  W. Griffith.  MULTISTATE RELIABILITY MODELS , 1980 .

[29]  Yi-Kuei Lin,et al.  A simple algorithm for reliability evaluation of a stochastic-flow network with node failure , 2001, Comput. Oper. Res..

[30]  S.H. Lee,et al.  Reliability Evaluation of a Flow Network , 1980, IEEE Transactions on Reliability.

[31]  Yi-Kuei Lin,et al.  Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs , 2002, Reliab. Eng. Syst. Saf..

[32]  K. Kobayashi,et al.  A new algorithm in enumerating all minimal paths in a sparse network , 1999 .

[33]  Suresh Rai,et al.  An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities , 2005, IEEE Transactions on Reliability.

[34]  Suresh Rai,et al.  CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks , 1991, IEEE Trans. Parallel Distributed Syst..

[35]  Kailash C. Kapur,et al.  Reliability Bounds for Multistate Systems with Multistate Components , 1985, Oper. Res..

[36]  Arjang A. Assad,et al.  Multicommodity network flows - A survey , 1978, Networks.

[37]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[38]  J. R. Evans,et al.  Maximum flow in probabilistic graphs-the discrete case , 1976, Networks.