An approximate algorithm for the robust design in a stochastic-flow network

Shin Guang Chen, Yi-Kuei Lin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

This article proposes an approximate algorithm to solve the robust design problem in a stochastic-flow network. Conventionally, the robust design is an issue in quality engineering where the designed product functions well even in a versatile environment. However, in the context of a stochastic-flow network, it means the network functions well even in a node's failure situation. This can be solved by properly assigning capacity. Because the problem is known to be NP-hard, a relatively fast approximation algorithm would be beneficial. Some numerical examples are presented to illustrate the usefulness of the proposed approach.

Original languageEnglish
Pages (from-to)2440-2454
Number of pages15
JournalCommunications in Statistics - Theory and Methods
Volume39
Issue number13
DOIs
StatePublished - 1 Jan 2010

Keywords

  • Capacity assignment
  • Robust design
  • Stochastic-flow network
  • Structural importance

Fingerprint Dive into the research topics of 'An approximate algorithm for the robust design in a stochastic-flow network'. Together they form a unique fingerprint.

Cite this