The Stochastic Quickest Path Problem Via Minimal Paths__臺灣人文及社會科學引文索引資料庫

:::

詳目顯示

第 1 筆 / 總合 1 筆

/1頁

來源文獻資料
外文摘要
引文資料

題名：	The Stochastic Quickest Path Problem Via Minimal Paths
書刊名：	工業工程學刊
作者：	林義貴
作者(外文)：	Lin, Yi-kuei
出版日期：	2010
卷期：	27:2
頁次：	頁132-139
主題關鍵詞：	隨機最快路徑問題；最短路徑；時間限制；交集互斥法；Stochastic quickest path problem；Minimal paths；Time constraint；(d,T)-MP；Inclusion– exclusion
原始連結：	連回原系統網址
相關次數：	被引用次數:期刊(3) 博士論文(0) 專書(0) 專書論文(0) 排除自我引用:1 共同引用:0 點閱:14

The quickest path problem, a version of the shortest path problem, is to find a single quickest path that sends a given amount of data from the source to the sink with minimum transmission time. More specifically, the capacity of each arc in a network is assumed to be deterministic. However, in many real-life networks, such as computer systems, telecommunication systems, etc., the capacity of each arc is stochastic due to failure, maintenance, etc. Such a network is named a stochastic-flow network. Therefore, the minimum transmission time is not a fixed number. The transmission time can be reduced if the data are transmitted through several minimal paths simultaneously. Focusing on a stochastic flow network with multistate arcs, this article studies the stochastic quickest path problem. We evaluate the probability that d units of data can be sent through two minimal paths (MPs) simultaneously under time constraint T. Such a probability is named the system reliability. A simple algorithm is proposed to generate all (d, T)-MPs and the system reliability can then be computed in terms of (d,T)-MPs by applying inclusion–exclusion.

以文找文

期刊論文
1.	Lin, Y. K.(2003)。Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network。Computers and Operations Research，30，567-575。
2.	Chen, G. H.、Hung, Y. C.(1994)。Algorithms for the constrained quickest path problem and the enumeration of quickest paths。Computers & Operations Research，21(2)，113-118。
3.	Climaco, J. C. N.、Pascoal, M. M. B.、Craveirinha, J. M. F.、Captivo, M. E. V.(2007)。Internet packet routing: application of a K-quickest path algorithm。European Journal of Operational Research，181(3)，1045-1054。
4.	Alexopoulos, C.(1995)。A note on state-space decomposition methods for analyzing stochastic flow networks。IEEE Transactions on Reliability，44(2)，354-357。
5.	Aven, T.(1985)。Reliability evaluation of multistate systems with multistate components。IEEE Transactions on Reliability，34(5)，473-479。
6.	Hudson, J. C.、Kapur, K. C.(1985)。Reliability bounds for multistate systems with multistate components。Operations Research，33(1)，153-160。
7.	Lin, J.-S.、Jane, C.-C.、Yuan, J.(1995)。On reliability evaluation of a capacitated-flow network in terms of minimal pathsets。Networks，25(3)，131-138。
8.	Xue, J.(1985)。On multistate system analysis。IEEE Transactions on Reliability，R-34(4)，329-337。
9.	Yarlagadda, R.、Hershey, J.(1991)。Fast algorithm for computing the reliability of communication network。International Journal of Electronics，70(3)，549-564。
10.	Lin, Y. K.(2007)。On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint。European Journal of Operational Research，176，347-360。
11.	Yeh, W. C.(2008)。A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability。Reliability Engineering & System Safety，93(1)，125-136。
12.	Chen, Y. L.、Chin, Y. H.(1990)。The quickest path problem。Computers & Operations Research，17(2)，153-161。
13.	Chen, G. H.、Hung, Y. C.(1993)。On the quickest path problem。Information Processing Letters，46(3)，125-128。
14.	Chen, Y. L.(1993)。An algorithm for finding the k quickest paths in a network。Computers & Operations Research，20，59-65。
15.	Chen, Y. L.、Tang, K.(1998)。Minimum time paths in a network with mixed time constraints。Computers & Operations Research，25(10)，793-805。
16.	Jane, C.-C.、Lin, J.-S.、Yuan, J.(1993)。Reliability evaluation of a limited-flow network in terms of minimal cutsets。IEEE Transactions on Reliability，42(3)，354-361+368。
17.	Lee, D. T.、Papadopoulou, E.(1993)。The all-pairs quickest path problem。Information Processing Letters，45(5)，261-267。
18.	Martins, E. D. Q. V.、Santos, J. L. E. D.(1997)。An algorithm for the quickest path problem。Operations Research Letters，20(4)，195-198。
19.	Park, C. K.、Lee, S.、Park, S.(2004)。A label-setting algorithm for finding a quickest path。Computers & Operations Research，31，2405-2418。
20.	Pascoal, M. M. B.、Captivo, M. E. V.、Cl'imaco, J. C. N.(2005)。An algorithm for ranking quickest simple paths。Computers and Operations Research，32(3)，509-520。
21.	Fredman, Michael L.、Tarjan, Robert Endre(1987)。Fibonacci heaps and their uses in improved network optimization algorithms。Journal of the Association for Computing Machinery，34(3)，596-615。
22.	Bodin, L.、Golden, B. L.、Assad, A.、Ball, M.(1983)。Routing and scheduling of vehicles and crews: The state of the art。Computers and Operations Research，10(2)，63-211。

其他
1.	Ahuja, R. K.(1998)。Minimum cost-reliability ratio problem。
2.	Chen, Y. L.(1994)。Finding the k quickest simples paths in a network。
3.	Golden, B. L. ; Magnanti, T. L.(1977)。Deterministic network optimization: a bibliography。
4.	Hung, Y. C. ; Chen, G. H.(1992)。Distributed algorithms for the quickest path problem。
5.	Lin, Y. K.(2001)。On reliability evaluation of a stochasticflow network in terms of minimal cuts。
6.	Lin, Y. K.(2003)。On the multicommodity reliability for a stochastic-flow network with node failure under budget constraint。
7.	Lin, Y. K.(2004)。Reliability of a stochastic-flow network with unreliable branches and nodes under budget constraints。
8.	Lin, Y. K.(2007)。Reliability evaluation for an information network with node failure under cost constraint。

推文
推薦
引用網址
引用嵌入語法
轉寄

top

:::

相關期刊
相關論文
相關專書
相關著作
熱門點閱

1.	Considering Retransmission Mechanism and Latency for Network Reliability Evaluation in a Stochastic Computer Network
2.	A Multi-State Computer Network Within Transmission Error Rate and Time Constraints
3.	Evaluation of System Reliability of Electronic Transaction in Commercial Banks

無相關博士論文

無相關書籍

無相關著作

無相關點閱

QR Code

臺灣人文及社會科學引文索引資料庫系統

詳目顯示

臺灣人文及社會科學引文索引資料庫