Step tolling with bottleneck queuing congestion

Revision as of 10:06, 16 February 2021

Abstract

In most dynamic traffic congestion models, congestion tolls must vary continuously over time to achieve the full optimum. This is also the case in . Vickrey (1969) 'bottleneck model'. To date, the closest approximations of this ideal in practice have so-called 'step tolls', in which the toll takes on different values over discrete time intervals, but is constant within each interval. Given the prevalence of step-tolling schemes they have received surprisingly little attention in the literature. This paper compares two step-toll schemes that have been studied using the bottleneck model by . Arnott et al. (1990) and Laih (1994). It also proposes a third scheme in which late in the rush hour drivers slow down or stop just before reaching a tolling point, and wait until the toll is lowered from one step to the next step. Such 'braking' behaviour has been observed in practice. Analytical derivations and numerical modelling show that the three tolling schemes have different optimal toll schedules and reduce total social costs by different percentages. These differences persist even in the limit as the number of steps approaches infinity. Braking lowers the welfare gain from tolling by 14% to 21% in the numerical example. Therefore, preventing or limiting braking seems important in designing step-toll systems. © 2012 Elsevier Inc.