System Reliability Evaluation for a Multistate Supply Chain Network With Failure Nodes Using Minimal Paths

This work devotes to the application of network methods for the reliability of a complex supply chain system, which is a set of several factories with supply-demand relationship. Two characters are considered in the proposed network: 1) nodes, and arcs all have multiple possible capacities, and may fail; and 2) the capacity weight varies with arcs, nodes, and types of commodity. The purpose of this paper is to study the systems reliability, in this case the possibility that a given quantity (d 1,d 2) of two types of commodities can be transmitted from the source factory to the destination factory simultaneously. Such a possibility can be treated as a performance index to measure the quality level of a supply chain network. The flow model is constructed by flow assignments, and capacity vectors. The (d 1,d 2) -MP, which represents the capacity of each arc/node, is a minimal capacity vector meeting the demand constraint. A simple algorithm in terms of minimal paths is first proposed to generate all (d 1,d 2)-MP. The system reliability can then be calculated efficiently in terms of (d 1,d 2)-MP. Time complexity of the proposed algorithm is also analyzed.

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

[2]  B. Rothschild,et al.  MULTICOMMODITY NETWORK FLOWS. , 1969 .

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

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

[5]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

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

[7]  James R. Evans.  A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem , 1976, Math. Program..

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

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

[10]  John E. Cremeans,et al.  THE MULTICOMMODITY NETWORK FLOW MODEL REVISED TO INCLUDE VEHICLE PER TIME PERIOD AND NODE CONSTRAINTS , 1972 .

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

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

[13]  John E. Cremeans,et al.  Optimal multicommodity network flows with resource allocation , 1970 .

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

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

[16]  J. A. Tomlin,et al.  Minimum-Cost Multicommodity Network Flows , 1966, Oper. Res..

[17]  W. J. Rueger.  Reliability Analysis of Networks with Capacity-Constraints and Failures at Branches & Nodes , 1986, IEEE Transactions on Reliability.

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

[19]  Wei-Chang Yeh.  A Simple Method to Verify All d-Minimal Path Candidates of a Limited-Flow Network and its Reliability , 2002 .

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

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

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

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

[24]  Nader Ebrahimi,et al.  Multistate reliability models , 1984 .

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

[26]  Yi-Kuei Lin,et al.  On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint , 2007, Eur. J. Oper. Res..

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

[28]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[29]  J. Kennington.  Solving multicommodity transportation problems using a primal partitioning simplex technique , 1977 .

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

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

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

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

[34]  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..

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

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

[37]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

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