Minimal Revenue Network Tolling: System Optimisation under Stochastic Assignment

Abstract

The classical road tolling problem is to toll network links such that, under the principles of Wardropian User Equilibrium (UE) assignment, a System Optimising (SO) flow pattern is obtained. Such toll sets are however non-unique, and further optimisation is possible: for example, minimal revenue tolls create the desired SO flow pattern at minimal additional cost to the users. In the case of deterministic assignment, the minimal revenue toll problem is capable of solution by various methods, such as linear programming [BHR97] and heuristically by reduction to a multi-commodity max-flow problem [Dia00]. However, it is generally accepted that deterministic models are less realistic than stochastic, and thus it is of interest to investigate the principles of tolling under stochastic modelling conditions. This paper develops methodologies to examine the minimal revenue toll problem in the case of Stochastic User Equilibrium. Tolling solutions for both ‘true’ System Optimum and Stochastic System Optimum under SUE are derived, using both logit and probit assignment methods.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 7 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.