A MP-based algorithm for a multicommodity stochastic-flow network with capacity weights

Authors

  • Yi-Kuei Lin Chair Professor, National Taiwan University of Science and Technology

DOI:

https://doi.org/10.23055/ijietap.2009.16.4.42

Abstract

This paper manly proposes an efficient algorithm to evaluate system reliability for many real-life systems such as manufacturing, telecommunication, and computers systems. We constructs a multicommodity stochastic-flow network to model a manufacturing system in which each node stands for a machine station, and each arc stands for a transmission medium (shipping machine or conveyor). Four characteristics are considered: 1) both nodes and arcs have multiple possible capacities and may fail; 2) each component (arc/node) has both capacity and cost attributes; 3) multicommodity are proceed; and 4) the capacity weight varies with arcs, nodes, and types of commodity. We study the possibility that multicommodity can be transmitted through this network simultaneously under the budget constraint. Such a possibility is named the system reliability. The MP (minimal paths) play the role of describing the relationship among flow vectors and capacity vectors. Subsequently, an efficient algorithm in terms of MP is proposed to evaluate the system reliability.

Author Biography

Yi-Kuei Lin, Chair Professor, National Taiwan University of Science and Technology

C

Downloads

Published

2009-08-13

How to Cite

Lin, Y.-K. (2009). A MP-based algorithm for a multicommodity stochastic-flow network with capacity weights. International Journal of Industrial Engineering: Theory, Applications, and Practice, 16(4). https://doi.org/10.23055/ijietap.2009.16.4.42

Issue

Section

Operation Research