.png){kind=icon}
返回
A Sequential Decomposition Method for Estimating Flow in a Multi-Commodity, Multistate Network
.png){kind=icon}
PRE
AI
DOI：10.1109/TR.2011.2161030.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The weighted multi-commodity multistate unreliable network (WMMUN) is an extension of the multistate network. It is a new network composed of multistate unreliable components (such as arcs and nodes) with various weight capacities which is able to transmit different types of commodities. Currently, the method used to calculate the direct WMMUN reliability is derived from algorithms based on D-minimal path (D-MP). The best-known method may fail to find real D-MPs, and therefore requires more comparison and verification. A very simple algorithm based on the sequential decomposition method has been developed for finding all real D-MPs before calculating the WMMUN reliability. The relationships among the different versions of WMMUN reliability problems have also been clarified. The correctness and computational complexity of the proposed algorithm will be analysed and proven in this paper. An example will be given to illustrate how the WMMUN reliability is evaluated using the proposed algorithm. Computational results compare favorably with existing methods in terms of the running time, the number of d-MPs, and the number of D-MP candidates.
Keyword:
Flow network reliability
minimal path
multi-commodity
multistate
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
2.8K
被引数:
8.5K
机构
暂无机构信息
引用论文
Generalised importance measures for multi-state elements based on performance level restrictions基于性能水平限制的多状态元素广义重要性度量
.png){kind=icon}
PREAI
分享收藏分享收藏A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability估计加权多商品多状态不可靠网络可靠性的一种简单最小路径方法
PREAI
分享收藏
查看更多内容