A Binding Algorithm of Lower Boundary Points Generation for Network Reliability Evaluation

Ding-Hsiang Huang, Cheng-Fu Huang, Yi-Kuei Lin*

*此作品的通信作者

研究成果: Article同行評審

10 引文 斯高帕斯(Scopus)

摘要

Network reliability evaluation for a stochastic flow network (SFN) can be computed in terms of all lower boundary points (LBPs). Although several algorithms have been presented in the literature as solutions for the LBP problem, the efficiency is always occurring at the present for the large SFN. In this paper, a binding technique generating binding-flow vectors is therefore developed to narrow down the searching range of flows for demand. This technique is able to reduce the loading of the candidate comparison procedure greatly. An algorithm based on this binding technique is proposed to solve the LBP problem. We compare the performance of the proposed algorithm to well-known algorithms in terms of CPU time, through three benchmark networks and a practical case. The experimental results show the functional efficiency of our proposed binding LBP algorithm.

原文English
文章編號8776630
頁(從 - 到)1087-1096
頁數10
期刊IEEE Transactions on Reliability
69
發行號3
DOIs
出版狀態Published - 25 7月 2020

指紋

深入研究「A Binding Algorithm of Lower Boundary Points Generation for Network Reliability Evaluation」主題。共同形成了獨特的指紋。

引用此