期刊
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
卷 100, 期 -, 页码 75-97出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2017.01.008
关键词
Reliability; Stochastic distribution network; Minimal cut; D-minimal cut
类别
资金
- National Basic Research Program of China [2012CB725401]
- National Natural Science Foundation of China [71621001, 71601072, 71601073]
- Research Committee of The Hong Kong Polytechnic University [87PV]
- Research Institute for Sustainable Urban Development of The Hong Kong Polytechnic University [1-ZVBX, 1-ZVBY]
This paper presents a d-minimal cut based algorithm to evaluate the performance index Rd+i 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 our algorithm outperforms the existing methods. Furthermore, a real case study is provided to illustrate the application of the algorithm. (C) 2017 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据