Reliable and economic resource allocation in an unreliable flow network

In this paper a reliable and economic resource allocation strategy under cost constraints is developed for an unreliable multi-source multi-sink flow network. A multi-source multi-sink flow network is composed of nodes, characterized as source nodes, sink nodes and intermediate nodes, as well as directed arcs, joining pairs of nodes. In the presence of unreliable intermediate nodes and arcs, it is important to distribute resources at source nodes in a reliable and cost-effective manner so that resources are more likely to be transmitted successfully to sink nodes through the flow network. By modelling the capacities of intermediate nodes and arcs as statistically independent random variables, an integrated approach is proposed in this study that combines the existing methodologies to determine a reliability-maximizing resource allocation strategy which meets demand at sink nodes and a predetermined transmission cost requirement. Examples of cyclic and acyclic flow networks with unreliable intermediate nodes and arcs are given to illustrate the application of the proposed approach.

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

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

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

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

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

[6]  Yi-Kuei Lin,et al.  Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network , 2003, Comput. Oper. Res..

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

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

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

[10]  Kailash C. Kapur,et al.  Reliability Analysis for Multistate Systems with Multistate Components , 1983 .

[11]  Terje Aven,et al.  Reliability Evaluation of Multistate Systems with Multistate Components , 1985, IEEE Transactions on Reliability.

[12]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

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

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

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