English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26988/38789
Visitors : 2324049      Online Users : 54
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/25809

Title: Queueing at a Bottleneck with Single- and Multi-Step Tolls
Authors: Chen-Hsiu Laih
Contributors: NTOU:Department of Merchant Marine
國立臺灣海洋大學:商船學系
Date: 1994-05
Issue Date: 2011-10-20T08:32:31Z
Publisher: Transportation Research Part A: Policy and Practice
Abstract: Abstract:We consider toll systems designed to alleviate queueing problems that result from a road bottleneck. Optimal road pricing is capable of eliminating queueing time completely, but has practical difficulties because it requires continuously changeable charges. Because of these difficulties, astep-toll scheme has been considered as an alternative to reduce queueing time. However, previous literatures do not contain an analysis of the multi-steptoll and the amount of queueing time removal that can be achieved by varying amounts of steptolls. They may be important for policy makers who are considering the introduction of step pricing under some circumstances. This paper is proposed to solve these problems. We show that at most n/(n + 1) of the total queueing time can be eliminated with the optimal n-steptoll. Suboptimal n-steptolls are also derived to achieve an under-n/(n + 1) quequeing removal (where n = 1, 2 and 3).
Relation: 28(3), pp.197–208
URI: http://ntour.ntou.edu.tw/handle/987654321/25809
Appears in Collections:[商船學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML249View/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