含先進先出及流出率容量限制之動態用路人均衡模型之研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：161

、訪客IP：3.135.198.150

姓名

劉士豪(Sh-Hao Lui ) 查詢紙本館藏

畢業系所

土木工程研究所

論文名稱

含先進先出及流出率容量限制之動態用路人均衡模型之研究

相關論文

★ 圖書館系統通閱移送書籍之車輛途程問題	★ 起迄對旅行時間目標下高速公路匝道儀控之研究
★ 結合限制規劃法與螞蟻演算法求解運動排程問題	★ 共同邊界資料包絡分析法在運輸業之應用-以國內航線之經營效率為例
★ 雙北市公車乘客知覺服務品質、知覺價值、滿意度、行為意向路線與乘客之跨層次中介效果與調節式中介效果	★ 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	★ Inferring transportation modes (bus or vehicle) from mobile phone data using support vector machine and deep neural network.
★ 混合羅吉特模型於運具選擇之應用-以中央大學到桃園高鐵站為例	★ Preprocessing of mobile phone signal data for vehicle mode identification using map-matching technique
★ 含額外限制式動態用路人均衡模型之研究	★ 動態起迄旅次矩陣推估模型之研究
★ 動態號誌時制控制模型求解演算法之研究	★ 不同決策變數下動態用路人均衡路徑選擇模型之研究

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

本研究分別構建出含先進先出限制之動態用路人均衡模型，與含先進先出及流出率容量限制之動態用路人均衡模型，並利用修正過之流線對角法與拉氏法，以測試例測試其正確性。
本研究對黃士沛(2000)提出之流線對角法進行修正，構建出綜合流線觀念與巢化對角法之新流線對角法，同時驗證其求解效率較傳統巢化對角法為佳。並對拉氏法在動態用路人均衡模型上之應用提出較合理之解釋，繼之證明含額外限制之動態用路人均衡模型與一般化成本之動態用路人均衡亦具有對等性。

摘要(英)

This thesis build Dynamic User-Optimal Equilibrium Model with First-In-First-Out Requirement and Dynamic exit-capacitated User-Optimal Equilibrium Model whit First-In-First-Out Requirement individually. Lastly verify the correction of two models with simple numerical examples by employing corrected Streamlined Diagonalization Method and Lagrangian method .
This thesis corrects Streamlined Diagonalization Method (Huang, 2000), and supplies new algorithm combined the concepts of Streamlined and Nested Diagonalization method with better efficiency than traditional Nested Diagonalization method. Then bring up reasonable explain about Lagrangian method in Dynamic User-Optimal Equilibrium Model, and prove there is equivalence between user-optimal conditions with generalization cost and Dynamic User-Optimal Equilibrium Model.

關鍵字(中)

★ 先進先出
★ 動態用路人均衡
★ 容量限制
★ 巢化對角法
★ 拉氏法
★ 流線
★ 變分不等式

關鍵字(英)

論文目次

摘要i
Abstract ii
誌謝iii
目錄vi
圖目錄ix
表目錄x
第一章緒論1
1.1 研究動機1
1.2 研究目的1
1.3 研究範圍與假設2
1.3.1 研究範圍2
1.3.2 研究假設2
1.4 研究流程2
第二章文獻回顧5
2.1 動態用路人均衡模型5
2.2 路段流出率容量限制9
第三章含額外限制式之動態用路人均衡模型12
3.1 動態用路人均衡模型12
3.1.1 均衡條件16
3.1.2 模型建立18
3.1.3 流線對角演算法步驟19
3.1.4 測試例21
3.1.5 流線對角（梯度投影）法與巢化對角（梯度投影）
法效率比較27
3.2 含額外限制式之動態用路人均衡模型28
3.2.1 均衡條件29
3.2.2 模型建立30
3.2.3 最佳化條件31
3.2.4 對等性證明32
3.2.5 拉氏法及流線對角拉氏演算法步驟37
3.2.5.1 拉氏參數之定義38
3.2.5.2 拉氏參數之更新40
3.2.5.3流線對角拉氏演算法步驟42
3.3 小結45
第四章含先進先出限制之動態用路人均衡模型48
4.1 均衡條件49
4.2 模型建立50
4.3 最佳化條件51
4.4 先進先出限制54
4.5 流線對角拉氏演算法步驟58
4.6 測試例61
4.6.1 動態用路人均衡模型求解結果(未加入先進先出限
制式)61
4.6.2 動態用路人均衡模型求解結果(含先進先出限制)63
4.7 小結65
第五章含先進先出與流出率容量限制之動態用路人均衡模型66
5.1 均衡條件66
5.2 模型建立67
5.3 最佳化條件68
5.4 流線對角拉氏演算法步驟72
5.5 測試例76
5.6 小結82
第六章結論與建議83
6.1 結論83
6.2 建議85
變數說明86
參考文獻89

參考文獻

1.陳惠國，劉士豪，2000，「路段流出率容量限制和先進先出限制下的動態用路人均衡模型研究」，中華民國第五屆運輸網路研討會論文集，台中，15-26。
2.黃士沛，2000，不同決策變數下動態用路人均衡路徑選擇模型之研究，國立中央大學土木工程學系碩士論文，中壢。

3.李宗益，2000，含額外限制式動態用路人均衡模型之研究，國立中央大學土木工程學系碩士論文，中壢。

4.王中允，1999，路段容量限制動態用路人旅運選擇模型之研究，國立中央大學土木工程學系博士論文，中壢。

5.張美香，1998，動態旅運選擇模型之課題研究，國立中央大學土木工程學系博士論文，中壢。

6.陳惠國，張美香，1997，「離散型動態用路人最佳化路徑選擇模型之不收斂現象探討」，中華民國第二屆運輸網路研討會論文集，中壢，33-44。
7.張佳偉，1997，路徑變數產生法求解動態交通量指派模型之效率比較，國立中央大學土木工程學系碩士論文，中壢。

8.薛哲夫，1996，明確型動態旅運選擇模型之應用，國立中央大學土木工程學系碩士論文，中壢。

9.陳璐芳，1992，變分不等式在有限空間上的數值方法，國立清華大學應用數學研究所碩士論文，新竹。

10.Larsson, T. and Patriksson, M., 1999, “Side constrained traffic equilibrium models-analysis, computation and applications,” Transportation Research, 33B,233-264.
11.Bertsekas, D. P., 1976, “On the Goldstein-Levitin-Polyak Gradient Projection Method,” IEEE Transactions on Automatic Control, ac21, 174-184.
12.Border, K. C., 1989, Fixed Point Theorems with Applications to Economics and Game Theory, Cambridge University Press, Cambridge, New York.
13.Chen, H. K. and Chang, M. S., 2000, “Dynamic User-Optimal Departure Time/Route Choice Problem with Time-Window,” Journal of the Chinese Institute of Engineers, 23, 71-81.
14.Chen, H. K. and Wang, C. Y., 1999a, “Dynamic Capacitated User-Optimal Route Choice Problem,” Transportation Research Record 1667, 16-24.
15.Chen, H. K., 1999, Dynamic Travel Choice Models: A Variational Inequality Approach, Springer-Verlag, Berlin.
16.Chen, H. K. and Wang, C. Y., 1999b, “Dynamic User-Optimal Route Choice Problem with First-In-First-Out Requirement,” working paper at National Central University .
17.Florian, M. and Spiess, H., 1982, “The Convergence of Diagonalization Algorithms for Asymmetric Network Equilibrium Problems,” Transportation Research, 16B, 477-483.
18.Friesz, T. L., Bernstein, D. and Stough, R., 1996, “Dynamic Systems, Variational Inequalities and Control Theoretic Models for Predicting Time-Varying Urban Network Flows,” Transportation Science, 30, 14-31.
19.Friesz, T. L., Tobin, R. L. and Wie, B. W., 1994, “The Augmented Lagrangian Method for Solving Dynamic Network Traffic Assignment Models in Discrete Time,” Transportation Science, 28, 204-220.
20.Friesz, T. L., Bernstein, D., Smith, T. E., Tobin, R. L. and Wie, B. W., 1993, “A Variational Inequality Formulation of Dynamic Network User Equilibrium Problem,” Operations Research, 41, 179-191.
21.Friesz, T. L., Luque, F. J., Tobin, R. L. and Wie, B.W., 1989, “Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem,” Operations Research, 37, 893-901.
22.Kachroo, P. and Ozbay, K., 1998, “Solution to the User Equilibrium Dynamic Traffic Routing Problem Using Feedback Linearization,” Transportation Research, 32B, 343-360.
23.Karamardian, S., 1974, Fixed Points Algorithms and Applications, Academic Press, Inc., New York.
24.Larsson, T. and Patriksson, M., 1995, “An Augmented Lagrangean Dual Algorithm for Link Capacity Side Constrained Traffic Assignment Problems,” Transportation Research, 29B, 433-455.
25.Nagurney, A., 1993, Network Economics: A Variational Inequality Approach, Kluwer Academic Publishers, Boston.
26.Patriksson, M., 1994, The Traffic Assignment Problem: Models and Methods, Utrecht, The Netherlands.
27.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.
28.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, 31B, 277-290.
29.Sheffi, Y., 1984, Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods, Prentice- Hall, Inc., Englewood Cliffs.
30.Singh, S., Watson, B. and Srivastava, P., 1997, Fixed Point Theory and Best Approximation: The KKM-map Principle, Kluwer Academic, Boston.
31.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, 27B, 49-63.
32.Wie, B. W., Tobin, R. L., Bernstein, D. and Friesz, T. L., 1995, “A Comparison of System Optimum and User Equilibrium Dynamic Traffic Assignments with Schedule Delays,” Transportation Research, 3C, 389-411.
33.Wie, B. W., Tobin, R. L., Bernstein, D. and Friesz, T. L., 1995, “A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium Problem,” Transportation Science, 29, 79-92.
34.Wie, B. W., Tobin, R. L., Bernstein, D., Smith, T. E and Friesz, T. L., 1993, “A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem,” Operations Research, 41, 179-191.
35.Wie, B.W., Friesz, T. L. and Tobin, R. L., 1990, “Dynamic User Optimal Traffic Assignment On Congested Multidestination Networks,” Transportation Research, 24B, 431-442.
36.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-188.
37.Yang, H. and Qiang, M., 1998, “Departure Time, Route Choice and Congestion Toll in a Queuing Network with Elastic Demand,” Transportation Research, 32B, 247-260.
38.Yao, J. C. and Guo, J. S., 1994, “Variational and Generalized Variational Inequalities with Discontinuous Mappings,” Journal of Mathematical Analysis and Application, 182, 371-392.
Yao, J. C. and Guo, J. S., 1994, “Variational Inequalities with Nonmonotone Operators,” Journal of Optimization Theory and Applications, 80, 63-74.

指導教授

陳惠國(Huey-Kuo Chen)

審核日期

2001-7-9

推文