博碩士論文 92322078 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:6 、訪客IP:35.175.201.14
姓名 莊英鴻(Ying-Hong Zhuang)  查詢紙本館藏   畢業系所 土木工程學系
論文名稱 先進先出動態旅行時間函數以及起點基礎之交通量指派演算法之研究
(First-in-first-out Dynamic Travel Time Functions and Origin-based Tarffic Assignment Algorithm)
相關論文
★ 圖書館系統通閱移送書籍之車輛途程問題★ 起迄對旅行時間目標下高速公路匝道儀控之研究
★ 結合限制規劃法與螞蟻演算法求解運動排程問題★ 共同邊界資料包絡分析法在運輸業之應用-以國內航線之經營效率為例
★ 雙北市公車乘客知覺服務品質、知覺價值、滿意度、行為意向路線與乘客之跨層次中介效果與調節式中介效果★ Investigating the influential factors of public bicycle system and cyclist heterogeneity
★ A Mixed Integer Programming Formulation for the Three-Dimensional Unit Load Device Packing Problem★ 高速公路旅行時間預測之研究--函數資料分析之應用
★ Behavior Intention and its Influential Factors for Motorcycle Express Service★ 含額外限制式動態用路人均衡模型之研究
★ 動態起迄旅次矩陣推估模型之研究★ 動態號誌時制控制模型求解演算法之研究
★ 不同決策變數下動態用路人均衡路徑選擇模型之研究★ 動態人口分布最佳化控制之研究-雙層規劃模型之應用
★ 含容量限制之軟時窗動態用路人出發時間/路徑選擇雙層模型之研究★ 普羅比機率型動態用路人均衡模型演算法求解效率之比較
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 本研究利用含先進先出之路段旅行時間成本函數,應用於動態用路人均衡模型之中,並結合OBTAIN法於動態用路人均衡演算法中,以測試例檢測其正確性。
本研究利用Carey(2003)所推導出路段旅行時間成本函數,結合Chen and Hsueh(1996)所提出之觀念,將流出率、路段車輛數轉成流入率之型式,利用巢化對角法之方法求解動態用路人均衡模型,並驗証其結果是否符合先進先出條件。
摘要(英) We employed this type of travel time functions with first-in-first-out (FIFO) property to resolve dynamic traffic assignment problems, and combine OBTAIN algorithm with the algorithm of dynamic traffic assignment. We will examine the correction of test example.
Here we applied this type of travel time functions showed by Carey(2003), and then combine the function with nested diagonalization algorithm of dynamic traffic assignment by Chen and Hsueh(1996). And we will convert outflow variable and number of vehicle into functions of inflow variable. After we should confirm the result if matched the FIFO condition.
關鍵字(中) ★ 起點為基礎之演算法
★ 旅行時間函數
★ 先進先出
關鍵字(英) ★ OBTAIN
★ travel time function
★ F.I.F.O.
論文目次 摘要 i
Abstract ii
目錄 iv
圖目錄 vi
表目錄 vii
第一章 緒論 1
1.1 研究動機 1
1.2 研究目的 1
1.3 研究範圍與假設 2
1.3.1 研究假設 2
1.3.2 研究範圍與內容 2
1.4 研究流程 3
第二章 文獻回顧 4
2.1 用路人均衡模型演算法 4
2.1.1 Frank-Wolfe演算法 4
2.1.2 梯度投影法 4
2.1.3 OBTAIN演算法 5
2.1.4 演算法比較 5
2.2 動態用路人均衡模型 6
2.3 路段旅行時間成本函數 7
第三章 OBTAIN求解演算法 13
3.1 模式建立 13
3.2 最佳化條件 13
3.3 限制性子路網 16
3.4 以起點為基礎之路段流量比例 17
3.5 演算法流程 22
3.6 小結 23
第四章 路段先進先出之條件 24
4.1 先進先出之條件 24
4.2 先進先出路段成本函數 25
4.3 求解演算法 27
4.3.1 動態交通量指派模型 27
4.3.2 演算法步驟: 28
4.4 測試例 29
4.4.1 不含先進先出條件之成本函數 30
4.4.2 含先進先出條件之成本函數 31
4.5 小結 33
第五章 結論與建議 34
5.1 結論 34
5.2 建議 34
參考文獻 35
符號說明 38
參考文獻 1. 張佳偉,1997, 路徑變數產生法求解動態交通量指派模型之效率比較,國立中央大學土木工程學系碩士論文,中壢。
2. Adamo V., Astarita V., Florian M., Mahut M. and Wu J.H., 1999, “Modelling The Spill-Back Of Congestion In Link Based Dynamic Network Loading Models: A Simulation Model With Application,” In: 14th International Symposium on Theory of Traffic Flow, Jerusalem, July 1999, Elsevier, Amsterdam, 555-573. Also In: Lesort, J.B. (Ed.), Transportation and Traffic Theory, Pergamon, Oxford, 79-102.
3. Akamatsu T., 2001, “An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues,” Transportation Science 35(4), 389-404.
4. Astarita V. 1995, “Flow Propagation Description in Dynamic Network Loading Models,” In: Proceedings of IV International Conference on Application of Advanced Technologies in Transportation Engineering (AATT), 27-30, June 1995, American Society of Civil Engineers, 599-603.
5. Astarita V., 1996, “A Continuous Time Link Model For Dynamic Network Loading Based On Travel Time Function,” In: 13th International Conference Symposium on Theory of Traffic Flow, Lyon, July 1996, Elsevier, Amsterdam, 79-102.
6. Bar-Gera H., 1999, “Origin-based algorithms for transportation network modeling,” PhD thesis, University of Illinois at Chicago, Illinois.
7. Bar-Gera H., 2002, “Origin-based algorithm for the traffic assignment problem,” Transportation Science, 36(4), 398-417.
8. Beckmann M.J., C.B. McGuire, and C.B. Winsten., 1956, Studies in the Economics of Transportation, Yale University Press, New Haven, Conn.
9. Bliemer M., Bovy P. 2003, “Quasi-Variational Inequality Formulation of the Multiclass Dynamic Traffic Assignment Problem,” Transportation Research B, 37, 501-519.
10. Carey M., and Ge Y.E., 2003, “Comparing Whole Link Travel Time Models,” Transportation Research B, 37, 905-926.
11. Carey M., Ge Y.E. and McCartney M., 2003, “A Whole-Link Travel-Time Model with Desirable Properties,” Transportation Science, 37(1), 83-96.
12. Carey M. and McCartney M., 2002, “Behavior of a Whole-Link Travel Time Model Used In Dynamic Traffic Assignment,” Transportation Research B, 36, 83-95.
13. Carey M. and McCartney M., 2003, “Pseudo-Periodicity in a Travel-Time Model Used In Dynamic Traffic Assignment,” Transportation Research B, 37, 769-792.
14. Chen H.K. and Chou H.W., 2005, “OBTAIN Algorithm for the Supply Chain Network Equilibrium Problem,” Presented at the 6th EASTS Conference, Bangkok, Tailand, Vol. 6, pp. 2046-2059.
15. Chen H.K., 2004, “Travel Time Functions for Dynamic Traffic Assignment,” 第一屆台灣作業研究學會學術研討會暨2004年科技與管理學術研討會,國立台北科技大學,台北.
16. Chen H.K. and Hsueh C.F., 1996, “A Dynamic User-Optimal Route Choice Problem Using a Link-Based Variational Inequality Formulation,” Paper Presented at The 5th World Congress of the RSAI Conference, Tokyo, Japan.
15. Chen H.K., 1999, Dynamic Travel Choice Models: A Variational Inequality Approach, Springer-Verlag, Berlin.
16. Daganzo C.F., 1995, “Properties of Link Travel Time Functions under Dynamic Loads,” Transportation Research B, 29(2), 95-98.
17. Frank M. and Wolfe P., 1956, “An Algorithm for Quadratic Programming,” Naval Research Logistics Quarterly, 3, 95-110.
18. Friesz T.L., Bernstein D., Smith T.E., Tobin R.L. and Wie B.W., 1993, “A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem,” Operations Research, 41(1), 179-191.
19. Han S., 2003, “Dynamic Traffic Modelling and Dynamic Stochastic User Equilibrium Assignment for General Road Networks,” Transportation Research B, 37, 225-249.
20. Huang H.J. and Lan W.H.K., 2002, “Modeling and Solving the Dynamic User Equilibrium Route and Departure Time Choice Problem in Network with Queues,” Transportation Research B, 36, 253-273.
21. Jayakrishnan R., Tsai W.K., Prashker J.N. and Rajadhyaksha S., 1994., “A Faster Path-Based Algorithm for Traffic Assignment,” Presented at the Transportation Research Board 73rd Annual Meeting, Washington, D. C.,U.S.A.
22. Kupsizewska D. and D. Van Vliet, 1999, “101 Uses for Path-based Assignment,” Transport Planning Methods: Proceedings of seminar C, PTRC Planning and Transport Summer Annual Meeting, University of Sussex, UK.
23. Li J., Kawakami S., and Fujiwara O., 2002, “A Reactive Dynamic User Equilibrium Model in Network with Queues,” Transportation Research 34B(8), 605-624.
24. Lighthill M.J. and Whitham G.B., 1955, “On Kinematic Waves. I: Flow Movement in Long Rivers II: A Theory of Traffic Flow on Long Crowded Roads,”. Proceeding of the Royal Society, Series A, 229, 281-345.
25. Lim Y. and Heydecker B., 2005, “Dynamic Departure Time and Stochastic User Equilibrium Assignment,” Transportation Research 39B, 97-118.
26. Newell G.F., 1982, Application of Queuing Theory. Chapman and Hall, London.
27. Ran B., Boyce D.E. and LeBlanc L.J., 1993, “A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models,” Operations Research 41(1), 192-202.
28. Ran B. and Boyce D.E., 1994, Dynamic Urban Transportation Network Models: Theory and Implications for Intelligent Vehicle Highway Systems, Lecture Notes in Economics and Mathematical Systems 417, Springer-Verlag, New York.
29. Ran B., Hall R.W. and Boyce D.E., 1996, “A Link-Based Variational Inequality Model for Dynamic Departure Time/Route Choice," Transportation Research, 30B( 1), 31-46.
30. Ran B., Rouphail, N.M., Tarko A. and Boyce D.E., 1997, “Toward A Class of Link Travel Time Functions for Dynamic Assignment Models on Signalized Networks,” Transportation Research B, 31(4), 277-290.
31. Richards P.I., 1956, “Shock Waves on the Highway,” Operations Research 4, 42-51.
32. Smith M.J., 1993, “A New Dynamic Traffic Model and the Existence and Calculation of Dynamic User Equilibria on Congested Capacity-Constrained Road Networks,” Transportation Research, Vol. 27B, pp. 49-63.
33. Wie B.W., Tobin R.L. and Carey M., 2002, “The Existence, Uniqueness and Computation of an Arc-Based Dynamic Network User Equilibrium Formulation,” Transportation Research 36B, 897-918.
34. Wu J.H., Chen Y. and Florian M., 1998, “The Continuous Dynamic Network Loading Problem: A Mathematical Formulation and Solution Method,” Transportation Research 32B, 173-187.
35. Xu Y.W., Wu J.H., Florian M., Marcotte P. and Zhu D.L., 1999, “Advances in the Continuous Dynamic Network Loading Problem,” Transportation Science 33(4), 341-353.
指導教授 陳惠國(Huey-Kuo Chen) 審核日期 2006-7-23
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明