.png){kind=icon}
返回
A Fast Algorithm for Quickest Path Reliability Evaluations in Multi-State Flow Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TR.2015.2452580.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many real-world multi-state systems can be modeled as multistate flow networks (MFN) such that the net flow into and out of a node (excluding the source and target nodes) is equal to zero, e.g., distribution systems and supply chains. The quickest path (QP) reliability problem is to evaluate the probability, i.e., R-(d,R-t)-QP, that at least units of data can be sent from the source node to the sink node through a single special minimal path (MP) within units of time in an MFN. Such a special MP is called a (d, t)-QP here. In this study, a novel algorithm based on depth-first-search (DFS) is proposed to search for all (d, t)-QPs without solving two NP-hard problems: finding all minimal paths (MPs) in advance, and removing all infeasible (d, t)-QPs candidates. The correctness of the proposed Depth-First-Search (DFS)-based algorithm is proven, and an example is provided to illustrate the generation of all (d, t)-QPs. Furthermore, the analysis of the algorithm's computational complexity and computer experiments indicate that it is more efficient than known algorithms.
Keyword:
Network reliability
minimal paths
quickest paths
multi-state flow network
depth-first-search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
2.8K
被引数:
8.5K
机构
引用论文
Correlation of an Adenine-Specific Conformational Change with the ATP-Dependent Peptidase Activity ofEscherichia coliLon.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏
分享收藏
查看更多内容