Queueing at a bottleneck with single- and multi-step tolls
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, a step-toll scheme has been considered as an alternative to reduce queueing time. However, previous literatures do not contain an analysis of the multi-step toll and the amount of queueing time removal that can be achieved by varying amounts of step tolls. 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-step toll. Suboptimal n-step tolls are also derived to achieve an under-n/(n + 1) quequeing removal (where n = 1, 2 and 3).
Volume (Year): 28 (1994)
Issue (Month): 3 (May)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:transa:v:28:y:1994:i:3:p:197-208. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.