题名 |
An Algorithm to Approximate the Reliability of a Flow Network |
并列篇名 |
流量網路可靠度之近似值演算法 |
DOI |
10.29977/JCIIE.200301.0004 |
作者 |
簡進嘉(Chin-Chia Jane);賴藝文(Yih-Wenn Laih) |
关键词 |
近似值演算法 ; 流量網路 ; 可靠度分析 ; 實例驗證 ; approximation algorithm ; flow network ; reliability ; computational experiments |
期刊名称 |
工業工程學刊 |
卷期/出版年月 |
20卷1期(2003 / 01 / 01) |
页次 |
21 - 26 |
内容语文 |
英文 |
中文摘要 |
流量網路可靠度(網路系統上供應結點能滿足需求結點所指定需求量的機率值)爲流量網路系統設計規劃時的重要參考準則之一。本文提出演算法以計算流量網路之可靠度的近似值。由於流量網路之可靠度問題為一NP-hard的問題,因此當網路系統愈大時,要計算正確的可靠度必須得花用成指數增長的時間。為求在較短時間內完成計算,本文改進Jane & Yuan近期所提出的正確互次項和的演算法,以計算流量網路之可靠度值的上限及下限,進而求得在所設定上下限差額值下的可靠度近似值。本文亦進行實例驗證,以說明及探討所提出演算法之性質。 |
英文摘要 |
This article presents dynamic lower and upper bounds for approximating the s-t reliability, the probability that source node s can supply a specified demand to sink node t, of a flow network. The proposed algorithm which is motivated by Jane and Yuan’s exact algorithm can be applied to networks with non-uniform probability of arc failure, and, in addition, can be applied to solve the well-studied NP-hard terminal-pair reliability problem. Computational experiments are conducted and discussed. Since related work on bounding the s-t reliability problem is rare, the proposed algorithm, which presents a first step in the research of efficient approximation algorithms, is worthwhile. |
主题分类 |
工程學 >
工程學總論 |
参考文献 |
|