查詢結果分析
來源資料
相關文獻
- The Stochastic Quickest Path Problem Via Minimal Paths
- 網際網路群播路由技術
- 農產品最適運輸路線之規劃--以臺中到新竹之路段為例
- Solving the Steiner Minimum Tree (SMT) Problem Using a Fast and Efficient 2-Step Heuristic Algorithm
- The Shortest Path of a Sparse Graph--Nearest Service Searching of Vehicle Navigation System
- 運輸網路中邊長改變的最短路徑矩陣算法
- 以Connector為基的產品成本預估模式
- 開放與限制--範文編選的時間限制與設計模式的空間限制
- SWOT與SPT在貨運業之應用--以某貨運公司為例
- 汽車自動導航系統與無線網路通訊技術之研究
頁籤選單縮合
題名 | The Stochastic Quickest Path Problem Via Minimal Paths=利用最短路徑求解隨機型最快速路徑問題 |
---|---|
作者姓名(中文) | 林義貴; | 書刊名 | 工業工程學刊 |
卷期 | 27:2 2010.03[民99.03] |
頁次 | 頁132-139 |
分類號 | 440.2 |
關鍵詞 | 隨機最快路徑問題; 最短路徑; 時間限制; 交集互斥法; Stochastic quickest path problem; Minimal paths; Time constraint; (d,T)-MP; Inclusion– exclusion; |
語文 | 英文(English) |
英文摘要 | 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. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。