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

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：路網流量逐日演變之研究－在智慧型運輸系統運作情境下
作者：黃銘崇
作者(外文)：Ming-Chorng Hwang
校院名稱：國立交通大學
系所名稱：運輸科技與管理學系
指導教授：卓訓榮
學位類別：博士
出版日期：2004
主題關鍵詞：動態交通量指派；路網流量逐日演變；非線性動態系統；存在性與唯一性；穩定性；理亞普諾函數；Dynamic Traffic Assignment；Day-to-day Network Flow Evolution；Nonlinear Dynamical System；Existence and Uniqueness；Stability；Lyapunov Function
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(1) 博士論文(1) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:1
  • 共同引用共同引用:0
  • 點閱點閱:0
在智慧型運輸系統(Intelligent Transportation Systems)運作情境下，運輸資訊提供與用路人之間的互動行為是影響智慧型運輸系統能否發揮效能與效率的重要因素之一，因此，不論是實務上的交通營運管理分析或是學術上的理論性研究，如何描述與預測這個互動行為及其所對應產生的路網流量演變(evolution)便成為一個很重要的課題。
本研究即是在智慧型運輸系統運作情境下，基於「追求最小旅行時間行為假設」，及過去研究中曾實際被觀察到通勤性用路人的「逐日學習與適應性的旅運決策行為假設(day-to-day learning and adaptive behavioral assumption)」，提出「路網流量逐日演變與運輸資訊提供的互動理論」，這個理論包含路徑流量演變(path flow dynamics)、預測最小旅行時間演變(predicted minimal travel time dynamics)與這兩者的互動關係。
「路徑流量演變理論」描述用路人在接收智慧型運輸系統提供充分的路徑資訊與預測最小旅行時間後，經由逐日學習與適應演變的行為假設，進而造成路徑流量的演變。「預測最小旅行時間演變」則說明智慧型運輸系統如何經由每日實際偵測的路徑流量，同樣以學習與適應的方式預測其每日的最小旅行時間。
此外，本研究以動態系統方法(dynamical system approach)構建這個理論的數學模式，由模式的穩態(steady state)分析發現，這個數學模式的均衡解(equilibrium solution)滿足Wardrop使用者均衡(user equilibrium)的原則。經由微分方程理論的基本定理(the fundamental theorem of differential equations)，本研究提出一個輔助定理(Lipschitz lemma)證明這個數學模式滿足微分方程的基本定理，進而確認其解的存在性與唯一性(existence and uniqueness)。本研究同時也應用Lyapunov穩定性定理(Lyapunov stability theorem)，證明這個數學模式的均衡解是漸進穩定的(asymptotic stable)。
The interaction between information provision and the corresponding response of users is an important feature to functionalize the effectiveness and efficiency of ITS operations. Therefore, the ability of predicting how the travel information predicted and provided by ITS influences the time trajectory of network flows is an essential issue both in the viewpoints of theoretical analysis and in that of traffic operational improvements.
This dissertation develops a new theory of day-to-day network dynamics capable of characterizing the inter-dependence between travel information provision and network evolution with the behavioral assumptions of minimal travel time seeking and daily learning and adaptive process under the scenario of ITS services. The structure of the proposed theory includes path flow dynamics, predicted minimal travel time dynamics, and their inter-relationships
Under the two behavioral assumptions mentioned above, the theory of path flow dynamics describes the mechanism of path flow evolution resulted from the provision of path information and predicted minimal travel time by ITS services. The theory of predicted minimal travel time specifies how the minimal travel time is predicted from the detected path volumes by ITS in a origin-destination pair standpoints.
In addition, the author constructs a mathematical model for the theory by using dynamical system approach. The steady state of the model satisfies the Wardrop’s user equilibrium. The analysis of existence and uniqueness is also derived by the Lipschtitz lemma and the fundamental theorem of differential equations. Finally, a strict Lyapunov function is established to give the asymptotic stability for the equilibrium solution of the proposed model in the sense of Lyapunov stable.
Astarita, V., V. Adamo, G.E. Cantarella and E. Cascetta, “A doubly dynamic traffic assignment model for planning applications,” Proceedings of 14th International Symposium on Transportation and Traffic Theory, (Edited by A. Ceder), pp. 373-386, Pergamon Press, London, (1999).
Cantarella, G.E., and E. Cascetta, “Dynamic processes and equilibrium in transportation networks: towards a unifying theory,” Transportation Science 29, 305-329, (1995).
Carey, M., “Stability of competitive regional trade with monotone demand/supply functions,” Journal of Regional Science 20, 489-501, (1980).
Cascetta, E., and G.E. Cantarella, “A day-to-day and within day dynamic stochastic assignment model,” Transportation Research 25A, 277-291, (1991).
Chang, G.L., and H.S. Mahmassani, “Travel time prediction and departure time adjustment behavior dynamics in a congested traffic system,” Transportation Research 22B, 217-232, (1988).
Chen, H.K., and C.F. Hsueh, “A model and an algorithm for the dynamic user-optimal route choice problem,” Transportation Research 32B, 219-234, (1998).
Daganzo, C.F., “The cell-transmission model: A simple dynamic representation of highway traffic,” Transportation Research 28B, 269-287, (1994).
Friesz, T.L., D. Bernstein, N.J. Mehta, R.L. Tobin and S. Ganjalizadeh, “Day-to-day dynamic network disequilibria and idealized traveler information systems,” Operations Research 42, 1120-1136, (1994).
Friesz, T.L., D. Bernstein, N.J. Mahta, R.L. Tobin and S. Ganjalizadeh, “Dynamic network traffic assignment considered as a continuous time optimal control problem,” Operations Research 37, 893-901, (1989).
Friesz, T.L., D. Bernstein, T.E. Smith, R.L. Tobin and B.W. Wie, “A variational inequality formulation of the dynamic network user equilibrium problem,” Operations Research 41, 179-191, (1993).
Friesz, T.L., “Transportation network equilibrium, design and aggregation,” Transportation Research 19A, 413-427, (1985).
Friesz, T.L., D. Bernstein and R. Stough, “Dynamic systems, variational inequalities and control theoretic models for predicting time-varying urban network flows,” Transportation Science 30, 14-31, (1996).
Horowitz, J.L., “The stability of stochastic equilibrium in a two link transportation network,” Transportation Research 18B, 13-28, (1984).
Hu, T.Y., and H.S. Mahmassani, “Evolution of network flows under real-time information: a day-to-day dynamic simulation-assignment framework,” Transportation Research Record 1493, 46-56, (1995).
Hu, T.Y., and H.S. Mahmassani, “Evolution of network flows under real-time information and responsive signal control systems,” Transportation Research 5C, 51-69, (1997).
Janson, B.N., “Dynamic traffic assignment for urban road networks,” Transportation Research 25B, .143-161, (1991).
Jayakrishnan, R., H.S. Mahmassani, and T.Y. Hu, “An evaluation tool for advanced traffic information and management systems in urban networks,” Transportation Research 2C, 129-147, (1994).
Lo, H.K., and W.Y. Szeto, “A cell-based dynamic traffic assignment model: Formulation and properties,” Mathematical and Computer Modelling 35, 849-865, (2002).
Mahmassani, H.S., “Dynamic network traffic assignment and simulation methodology for advanced system management applications,” Networks and Spatial Economics 1(3/4), 267-292, 2001
Mahmassani, H.S., G.L. Chang, and R. Herman, “Individual decisions and collective effects in simulated traffic system,” Transportation Science 20, 258-271, (1986).
Mahmassani, H.S., “Dynamic models of commuter behavior: experimental investigation and application to the analysis of planned traffic disruptions,” Transportation Research 24A, 465-484, (1990).
Mahmassani, H.S., and S. Peeta, “Network performance under system optimal and user equilibrium dynamic assignment: implications for ATIS,” Transportation Research Record 1408, 83-93, (1993).
Merchant, D. K., and G.L. Nemhauser, “A model and an algorithm for the dynamic traffic assignment problems,” Transportation Science 12, 183-199, (1978).
Peeta, S., and A.K. Ziliaskopou;os, “Foundations of dynamic traffic assignment: the past, the present and the future,” Networks and Spatial Economics 1(3/4), pp.233-266, 2001.
Ran, B., D. Boyce and L. LeBlanc, “Toward a new class of instantaneous dynamic user-optimal traffic assignment models,” Operations Research 41, 192-202, (1993).
Ran, B., R.W. Hall, and D. Boyce, “A link-based variational inequality model for dynamic departure time/route choice,” Transportation Research 30B, 31-46, (1996).
Smith, M.J., “The existence,uniqueness, and stability of traffic equilibria,” Transportation Research 13B, 295-304, (1979).
Wardrop, J.G., “Some theoretical aspects of road traffic research,” Proceedings of the Institute of Civil Engineers Part II, pp. 325-378, (1952).
Watling, D., “A stochastic process model of day-to-day traffic assignment and information,” Behavioural and Network Impacts of Driver Information Systems, (Edited by R. Emmerink and P. Nijkamp), pp. 115-139, Ashgate Publishing Ltd., (1999).
Wei, B.W., R.L. Tobin, T.L. Friesz, and D. Berstein, “A dicrete time, nested cost operator approach to the dynamic network user equilibrium problem,” Transportation Science 29(1), pp.79-92, (1995).
Ziliaskopoulos, A.K., “A linear programming model for the single destination system optimum dynamic traffic assignment problem,” Transportation Science 34, 37-49, (2000).
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

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

目前上線人數：634（臺灣：610，外國：24） ／ 本年度總使用人次：2625314 ／ 訪客人次（自102年09月）：68436677
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上