A Simple Method for the Multi-State Quickest Path Flow Network Reliability Problem

摘要：

In order to conform to the real world systems such as distribution systems and supply chain management system,we assume the capacity of each arc in the quickest path problem is stochastic (multi-state).In this study,we propose a simple algorithm to evaluate the probability that d units of data can be sent from the source node to the sink node through the multistate quickest path flow network within T units of time.The proposed algorithm based on the k-th shortest path algorithm only has less time complexity than the best-known algorithms which were required to solve the NP-hard problem to find all minimal paths in advance.

关键词： reliability multi-state quickest path flow network the k-th shortest path

作者: Wei-Chang Yeh Wei-Wen Chang Chuan-Wei Chiu

作者单位: Department of Industrial Engineering and Engineering Management National Tsing Hua University Hsinchu,ROC

会议类型: 国际会议

会议名称: 2009 8th International Conference on Reliability,Maintainability and Safety(第八届中国国际可靠性、维修性、安全性会议)

会议地点: 成都

会议语种:英文

页码: 108-110

在线出版日期: 2009-08-24（万方平台首次上网日期，不代表论文的发表时间）