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).


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Queueing at a bottleneck with single- and multi-step tolls


    Contributors:


    Publication date :

    1993-06-03


    Size :

    12 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Queueing at a bottleneck with single- and multi-step tolls

    Laih, Chen-hsiu | Online Contents | 1994



    Congestion Behavior and Tolls in a Bottleneck Model with Stochastic Capacity

    Xiao, L.-L. / Huang, H.-J. / Liu, R. | British Library Online Contents | 2015



    Analytical model of road bottleneck queueing system

    Blazek, Dalibor / Blazekova, Olga / Vojtekova, Maria | Taylor & Francis Verlag | 2022