Evaluating the reliability of a stochastic distribution network in terms of minimal cuts
This paper presents a d-minimal cut based algorithm to evaluate the performance index Rd+1 of a distribution network, defined as the probability that a specified demand d + 1 can be successfully distributed through stochastic arc capacities from the source to the destination. To improve the efficiency of solving d-minimal cuts, a novel technique is developed to determine the minimal capacities of arcs. Also, two new judging criteria are proposed to detect duplicate d-minimal cuts. Both theoretical and computational results indicate that the authors' algorithm outperforms the existing methods. Furthermore, a real case study is provided to illustrate the application of the algorithm.
- Record URL:
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/issn/13665545
-
Supplemental Notes:
- Abstract reprinted with permission of Elsevier.
-
Authors:
- Niu, Yi-Feng
- Gao, Zi-You
- Lam, William H K
- Publication Date: 2017-4
Language
- English
Media Info
- Media Type: Web
- Features: Appendices; Figures; References; Tables;
- Pagination: pp 75-97
-
Serial:
- Transportation Research Part E: Logistics and Transportation Review
- Volume: 100
- Issue Number: 0
- Publisher: Elsevier
- ISSN: 1366-5545
- Serial URL: http://www.sciencedirect.com/science/journal/13665545
Subject/Index Terms
- TRT Terms: Algorithms; Networks; Reliability; Stochastic programming
- Subject Areas: Planning and Forecasting; Transportation (General);
Filing Info
- Accession Number: 01629960
- Record Type: Publication
- Files: TRIS
- Created Date: Mar 27 2017 9:26AM