A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity

In a single-commodity flow network, the system capacity is the maximum flow from the source to the destination. The reliability and unreliability based on system capacity are two appropriate performance indices to measure the quality level of a flow network. This paper extends the performance evaluation problem to a two-commodity multistate flow network composed of multistate components (edges and nodes). Both types of commodity, which are transmitted through the same network simultaneously, consume the capacities of edges and nodes differently. That is, the capacity weight varies with types of commodity, edges and nodes. The maximal total flow is not suitable to be treated as the system capacity in two-commodity case. Hence, we first define the system capacity as a 2-tuple vector and then propose a performance index, the probability that the upper bound of the system capacity is a given pattern. Such a performance index that is used to measure the quality level of a supply-demand system can be easily computed in terms of upper boundary vectors. An efficient algorithm in terms of minimal cuts is thus presented to generate all upper boundary vectors.

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

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

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

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

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

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

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

[8]  Nasser Fard,et al.  Cutset enumeration of network systems with link and node failures , 1999 .

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

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

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

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

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

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

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

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

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

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

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

[20]  Wei-Chang Yeh Multistate network reliability evaluation under the maintenance cost constraint , 2004 .

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

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

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

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

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

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