English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27283/39126
Visitors : 2441542      Online Users : 36
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/25921

Title: 階梯式擁擠收費體制下最佳收費階段數之研究
Optimal Pricing Steps of the Step Toll Scheme
Authors: 賴禎秀
Chen-Hsiu Laih
Contributors: NTOU:Department of Merchant Marine
國立臺灣海洋大學:商船學系
Keywords: Queuing;Bottleneck;The step toll scheme;The optimal number of pricing steps
排隊擁擠;瓶頸路段;階梯式擁擠收費;最佳收費階段數
Date: 2001-06-30
Issue Date: 2011-10-20T08:32:50Z
Publisher: 運輸計劃季刊
Abstract: Abstract:This paper proves that there exist some regular characters to the model of the optimal n-step tolls (n=1, 2, 3, …). According to these regular results, we can then derive the optimal number of pricing steps, which minimizes the total costs for the demand and supply sides, for the step toll scheme implemented at a queuing road bottleneck These outcomes, which have not been discussed previously, not only improve the theoretical model of the step toll scheme, but also provide the authorities a rule to operate the optimal step toll in practice.
摘要:本文首先證明出n階段(n=1, 2, 3,…)的階梯式擁擠收費模式中諸項規律性特徵之存在,根據這些規律性的特徵值,則可方便吾人探討在排隊擁擠的瓶頸路段實施階梯式擁擠收費時,供方(政府)與需方(通勤者)因收費階段數之遞增所分別形成的遞增與遞減成本函數。最後在雙方之總成本最小的原則下求得階梯式擁擠收費體制下之最佳收費階段數,使階梯式擁擠收費能得到最佳運作。以上之推導結果乃是階梯式擁擠收費之理論模式中尚未被討論到的部分,故本文除了對既有理論模式之盲點有所突破外,更可提供政策執行單位在實務操作上之遵循依據。
Relation: 30(2), pp.253-274
URI: http://ntour.ntou.edu.tw/handle/987654321/25921
Appears in Collections:[商船學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML172View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback