A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Queueing at a bottleneck with single- and multi-step tolls
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, 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).
Queueing at a bottleneck with single- and multi-step tolls
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, 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).
Queueing at a bottleneck with single- and multi-step tolls
Laih, Chen-Hsiu (author)
Transportation Research Part A: Policy and Practice ; 28 ; 197-208
1993-06-03
12 pages
Article (Journal)
Electronic Resource
English
Queueing at a bottleneck with single- and multi-step tolls
| Online Contents | 1994
Optimal road tolls under conditions of queueing and congestion
| Online Contents | 1996
Choosing Congestion Pricing Policy: Cordon Tolls Versus Link-Based Tolls
| British Library Online Contents | 2005
Traffic control - Tolls on trial
Online Contents | 1996