English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 42723080      線上人數 : 1237
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/69361


    題名: 高速公路依時性道路收費雙層規劃模型;A Time-Dependent Bi-Level Model for Road Pricing on Freeways
    作者: 嚴國基;Yen,Kuo-Chi
    貢獻者: 土木工程學系
    關鍵詞: 道路定價問題;雙層規劃問題;依時性用路人路徑選擇最佳化問題;road pricing problem;bi-level planning problem;the dynamic user-optimal route choice model problem
    日期: 2016-01-28
    上傳時間: 2016-03-17 19:03:42 (UTC+8)
    出版者: 國立中央大學
    摘要: 近年來私人運具快速成長且缺乏有效的道路費率定價政策,導致目前國道高速公路在尖峰時間道路容量與服務水準嚴重不足。因此衍生「國道差別費率」的需求管理措施,期望透過差別費率舒緩尖峰車流,然而,策略目標並不如預期顯著。主管機關應細緻的規劃推動國道定價策略,以系統化的角度進行思考如何確實反映尖峰時間使用國道所應付出的價格。費率定價的制定必須能夠達到「替代效果」,此替代效果包含時間替代、道路替代以及運輸工具的替代。鑒此本研究建立以依時性用路人路徑選擇最佳化模型為基礎的費率規劃方式導入時間向度、路徑選擇以及運具選擇等因素,藉由落實使用者付費,使得用路人因有效的道路定價產生道路替代、運具替代以及出發時間替代的效果。進而規劃出切實有效的最佳化費率作為公務部門政策推行的依據。
    本研究將以四個階段進行討論,首先以B演算法應用求解依時性用路人路徑選擇最佳化模型以說明該演算法的特性與運算績效;第二階段,則是探討含流出率容量限制與先進先出限制之依時性用路人最佳化模型以說明依時性模型所遭遇的問題並提出解決方式,以更一般化的模型詮釋依時性用路人路徑選擇行為。由於收費政策的推行期望達成時間替代、道路替代以及運輸工具替代等效果,因此第三階段討論依時性用路人最佳化運具選擇/路徑選擇/出發時間選擇問題,並且加入第二階段的限制條件以構建含額外限制之依時性用路人最佳化運具選擇/路徑選擇/出發時間選擇模型。最後於第四階段討論道路收費定價問題,建構國道收費定價最佳化設計雙層規劃模型。由於本研究屬網路設計問題之範疇,因此建立雙層規劃模型,上層為系統最佳化,追求路網總成本最小為目標;下層問題則利用含額外限制之依時性用路人最佳化運具選擇/路徑選擇/出發時間選擇模型的特性,分析最佳化費率下依時性用路人旅運行為。藉此提供政府相關權責單位有效的決策支援。
    ;Rapid growth in private vehicle ownership and the lack of an effective pricing policy for road tolls has led to congestion and inadequate service on freeways, especially during peak hours. Differential toll rates have been introduced in an attempt to stem traffic flows during peak hours; however, results have failed to meet expectations. To overcome this, the authorities should promote the road pricing strategy that accurately reflects the cost of using the freeway during peak hours is required. The pricing strategy must achieve the “alternative effect” which includes departure time replacement, path substitute and modes alternative. This study try to formulate the dynamic user-optimal route choice model integrates time dimension, route choice and mode choice factors. The users will be affecting by efficiency road pricing and changing the behavior. This model can be used as reference in establishing public policies that facilitate effective toll rates.
    This research was conducted in four stages. We first demonstrated the features and performance of Algorithm B by applying it to solve the dynamic user-optimal route choice model. Second, we discussed the problems of exit-capacity and first-in-first-out constraints, and proposed countermeasures in order to explain the dynamic user behavior more exactly. Since the roed pricing policy must achieve the above three substitution efficacy. In the third stage the dynamic user-optimal mode choice/departure time/route choice model with side-constraints will be discussed. In Stage 4, the dynamic bi-level optimal toll design model for superhighway has been formulated. Our study is in the field of network design, which is formulated network design field as a Bi-level programming model. The upper level objective of the model is to minimize the total network costs. The objective of the lower level is to apply the dynamic user-optimal mode choice/departure time/route choice model with side-constraints to analyze the behavior of the travelers under optimal toll rates. By solving the problem, the variational inequality sensitivity analysis method, generalized inverse matrix method, and Lagrangian-B algorithm are adopted to provide the algorithms for the bi-level method. The results of this study serve as reference for policy-making authorities.
    顯示於類別:[土木工程研究所] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML534檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明