Reliability evaluation for a multi-commodity flow model under budget constraint

Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an

Volumn 25, Issue 1, 2002, Pages 109-116

  Lin, Yi Kuei ^a  

^a VAN NUNG INSTITUTE OF TECHNOLOGY   (Taiwan)

Author keywords

Budget; Multi commodity; Stochastic flow network; System reliability

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; BUDGET CONTROL; CALCULATIONS; COMPUTATIONAL COMPLEXITY; COST BENEFIT ANALYSIS; MATHEMATICAL MODELS; RANDOM PROCESSES; THEOREM PROVING; VECTORS;

BUDGET CONSTRAINT; MINIMUM COST FLOW; MULTICOMMODITY FLOW MODEL; STOCHASTIC FLOW NETWORK; SYSTEM RELIABILITY;

RELIABILITY THEORY;

EID: 0036143036     PISSN: 02533839     EISSN: 21587299     Source Type: Journal    
DOI: 10.1080/02533839.2002.9670685     Document Type: Article

References (16)

1. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B., 1993. Network Flows:Theorey, Algorithms and Applications, Prentice-Hall.
2. Cremeans, J. E., Smith, R. A., and Tyndall, G. R., 1970. “Optimal Multicommodity Network Flows with Resource Allocation,”. Naval Research Logistics Quarterly, 17:269–279.
3. Evans, J. R., 1976. “A Combinatorial Equivalence between a Class of Multicommodity Flow Problems and the Capacitated Transportation Problem,”. Mathematical Programming, 10:401–404.
4. Ford, L. R., and Fulkerson, D. R., 1962. Flows in Networks, NJ:Princeton University Press.
5. Griffith, W. S., 1980. “Multistate Reliability Models,”. Journal of Applied Probability, 17:735–744.
6. Grigoriadis, M. D., and White, W. W., 1972. “A Partitioning Algorithm for the Multicommodity Network Flow Problem,”. Mathematical Programming, 3:157–177.
7. Hartman, J. K., and Lasdon, L. S., 1972. “A Generalized upper Bounding Algorithm for Multicommodity Network Flow Problems,”. Networks, 1:333–354.
8. Hudson, J. C., and Kapur, K. C., 1985. “Reliability Bounds for Multistate Systems with Multistate Components,”. Operations Research, 33:153–160.
9. Kennington, J. L., 1977. “Solving Multicommodity Transportation Problems Using a Primal Partitioning Simplex Technique,”. Naval Research Logistics Quarterly, 24:309–325.
10. Lin, J. S., Jane, C. C., and Yuan, J., 1995. “On Reliability Evaluation of a Capacitated-flow Network in Terms of Minimal Pathsets,”. Networks, 25 (3):131–138.
11. Lin, Y. K., 2001. “On Reliability Evaluation of a Stochastic-Flow Network in Terms of Minimal Cuts,”. Journal of Chinese Institute of Industrial Engineer, 18 (3):49–54.
12. Lin, Y. K., 2001. “A Simple Algorithm for Reliability Evaluation of a Stochastic-Flow Network with Node Failure,”. Computers and Operations Research, 28 (13):1277–1285.
13. Ross, S. M., 1993. Introduction to Probability Models, Academic Press.
14. Tomlin, J. A., 1966. “Minimum-cost Multicommodity Network Flows,”. Operations Research, 14:45–51.
15. Weigel, H. S., and Cremeans, J. E., 1972. “The Multicommodity Network Flow Model Revised to Include Vehicle Per Time Period and Node Constraints,”. Naval Research Logistics Quarterly, 19:77–89.
16. Xue, J., 1985. “On Multistate System Analysis,”. IEEE Trans. Reliability, 34:329–337.