政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/67474

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/67474

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 113656/144643 (79%)
造訪人次 : 51759867 線上人數 : 589

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜尋範圍

查詢小技巧：

您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果

若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料

進階搜尋

主頁 ‧ 登入 ‧ 上傳 ‧ 說明 ‧ 關於政大典藏 ‧ 管理

到手機版

政大機構典藏 > 商學院 > 統計學系 > 學位論文 > Item 140.119/67474

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/67474

題名:	車輛服務系統之最佳路由策略 Optimal Routing for General Vehicle Service Systems
作者:	林建佑
貢獻者:	洪英超林建佑
關鍵詞:	車輛路由策略系統穩定性佇列吞吐量
日期:	2013
上傳時間:	2014-07-14 11:30:16 (UTC+8)
摘要:	在本文中我們探討具有K座服務站的車輛平行處理系統(Parallel processing system)，並且對於系統的假設更加一般化。車輛在抵達該區域時會面臨選擇服務站的問題，所以路由策略的使用對於系統中車輛滯留時間的表現值顯得更加重要。我們藉由系統的穩定條件(Stability conditions)來比較文獻中常見的車輛路由策略以及我們提出的動態策略(Dynamic policy)之間的差異性，並且探討隨機車輛服務系統(Stochastic vehicle service system)的輸入強度之表現。我們提出一種全新的車輛路由策略：“最小加權佇列長度策略”(Join-the-Weighted-Shortest-Queue Policy)，並且證明了在系統的一般性假設之下此策略可以維持系統的強穩定性，間接也證明了本策略為一種最大吞吐量策略。其證明方式主要是以偏離分析(Drift analysis)作為基礎，並搭配相關的定理結果來證明。此外，我們也對於不同的最大吞吐量策略之下的車輛滯留時間平均值與第九十五百分位數的表現做出評估。最後，我們會對於各種不同的車輛輸入強度以及行駛速度之下，提出路由策略的建議方針。
參考文獻:	[1] B. Hajek (1982). Hitting time and occupation time bounds implied by drift analysis with applications. Adv. Appl. Prob., 14(3), pp.502-525. [2] D. Bertsimas and D. Nakazato (1995). The distributional Little`s law and its applications. Operations Research, 43(2), pp. 298-310. [3] D. J. Bertsimas and G. Van Ryzin (1991). A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operations Research, 39(4), pp.601-615. [4] D. J. Bertsimas and G. Van Ryzin (1993). Stochastic and dynamic vehicle routing with general demand and interarrival time distributions. Advances in Applied Probability, pp.947-978. [5] D. L. Iglehart and W. Whitt (1970). Multiple Channel Queues in heavy traffic, I. Adv. Appi. Prob, 2, pp.150-177 [6] E. Leonardi, M. Mellia, F. Neri and M. Ajmone Marsan (2001). On the stability of input-queued switches with speed-up. Networking, IEEE/ACM Transactions on, 9(1), pp.104-118. [7] F. Jensen and N. E. Petersen (1982). Burn-in: an engineering approach to the design and analysis of burn-in procedures. [8] H.N. Psaraftis (1988). Dynamic vehicle routing problems. Vehicle routing: Methods and studies, 16, pp. 223-248. [9] J.G. Dai (1995). On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. The Annals of Applied Probability, 5(1), pp.49-77. [10] J. Walrand (1988). Introduction to queueing networks. Englewood Cliffs, Prentice Hall. [11] R. Pemantle and J.S. Rosenthal (1999). Moment conditions for a sequence with negative drift to be uniformly bounded in . Stochastic Processes and their Applications, 82(1), pp.143-155. [12] R.W. Wolff (1982). Poisson arrivals see time averages. Operations Research, 30(2), pp. 223-231. [13] S. L. Bell and R. J. Williams (2001). Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy. The Annals of Applied Probability, 11(3), pp.608-649. [14] S. P. Meyn (1996). Stability and optimization of queueing networks and their fluid models. The Mathematics of Stochastic Manufacturing Systems, pp.17-21. [15] Y. C. Hung and C.C. Chang (2008). Dynamic scheduling for switched processing systems with substantial service-mode switching times. Queueing systems, 60(1-2), pp.87-109. [16] Y. C. Hung and G. Michailidis (2008). Modeling, scheduling, and simulation of switched processing systems. ACM Transactions on Modeling and Computer Simulation (TOMACS), 18(3), 12. [17] Y. C. Hung and G. Michailidis (2012). Stability and control of acyclic stochastic processing networks with shared resources. Automatic Control, IEEE Transactions on, 57(2), pp.489-494.
描述:	碩士國立政治大學統計研究所 101354017 102
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G1013540171
資料類型:	thesis
顯示於類別:	[統計學系] 學位論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
017101.pdf	1020Kb	Adobe PDF2	201	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回饋