Generate upper boundary vectors meeting the demand and budget for a p

The system capacity for a single-commodity flow network is the maximum flow from the source to the sink. This paper discusses the system capacity problem for a p-commodity limited-flow network with unreliable nodes. In such a network, arcs and nodes all have several possible capacities and may fail. Different types of commodity, which are transmitted through the same network simultaneously, competes the capacities of arcs and nodes. In particular, the consumed capacity by different types of commodity varies from arcs and nodes. We first define the system capacity as a vector and then a performance index, the probability that the upper bound of the system capacity is a given pattern subject to the budget constraint, is proposed. Such a performance index can be easily computed in terms of upper boundary vectors meeting the demand and budget. A simple algorithm based on minimal cuts is thus presented to generate all upper boundary vectors. The manager can apply this performance index to measure the system capacity level for a supply-demand system.

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

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

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

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

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

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

[7]  Yi-Kuei Lin,et al.  Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case , 2003, Comput. Oper. Res..

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

[9]  Yi-Kuei Lin,et al.  ON THE MULTICOMMODITY RELIABILITY FOR A STOCHASTIC- FLOW NETWORK WITH NODE FAILURE UNDER BUDGET CONSTRAINT , 2003 .

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

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

[12]  Yi-Kuei Lin,et al.  Two-commodity reliability evaluation for a stochastic-flow network with node failure , 2002, Comput. Oper. Res..

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

[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]  Wei-Chang Yeh.  A simple algorithm to search for all d-MPs with unreliable nodes , 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]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

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

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

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

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

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

[23]  Yi-Kuei Lin.  Reliability evaluation for a multi‐commodity flow model under budget constraint , 2002 .

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

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

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

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

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