Analysis of a joint entry- and distance-based cordon pricing scheme: a dynamic modeling approach

Shahbandi, Mehrdad Gholami; Babazadeh, Abbas · 2018 · OpenAlex-citations

DOI: 10.1007/s40534-018-0176-8

archive: archived pipeline: cataloged verified

Get this paper ↗ (DOI — opens at the source; we link to it, we don't host it)

Summary

This paper addresses the limitations of existing cordon-based congestion pricing schemes, specifically entry-based and distance-based models, by proposing a joint entry- and distance-based pricing strategy. While entry-based pricing is socially acceptable and practical, it fails to account for the distance traveled within the cordoned area, leading to inequity. Conversely, distance-based pricing promotes equity but may encourage drivers to take shorter, more congested routes to minimize tolls, potentially causing congestion near the cordon boundary. The authors aim to circumvent these deficiencies by developing a hybrid scheme that combines an entry charge with a fee proportional to the distance traveled inside the zone. Furthermore, the study critiques the prevalent use of static traffic assignment models in previous research, arguing that dynamic modeling is necessary to realistically capture flow variations and congestion effects. To evaluate this hybrid scheme, the authors develop a dynamic tolled network loading model based on a path-based capacity-restrained dynamic traffic assignment framework. The mathematical formulation minimizes total travel time while accounting for toll revenues and user equilibrium constraints. The toll structure consists of a fixed entry charge and a variable charge per unit distance. The optimization problem is solved using an iterative algorithm that decomposes the model into subproblems for path flows and path-link incidence variables, utilizing column generation techniques. The methodology is applied to the Sioux Falls network, where the optimal joint design is compared against distinct entry-based and distance-based schemes using both dynamic and static modeling approaches. The numerical experiments demonstrate that the joint tolling scheme outperforms the distinct entry-based and distance-based strategies. Specifically, the hybrid approach achieves the best performance in reducing total travel time for travelers and alleviating congestion levels within the cordoned area, while simultaneously generating higher toll revenue. Theoretical analysis confirms that the hybrid model’s solution space encompasses those of the individual schemes, providing a lower bound for the objective function. Crucially, the results highlight the unreliability of static modeling approaches in this context, showing significant discrepancies when compared to the dynamic model. The dynamic approach proves more realistic for capturing the complex interactions of time-varying traffic flows and congestion pricing impacts. The significance of this work lies in its contribution to transportation demand management strategies by offering a more equitable and efficient congestion pricing mechanism. By integrating entry and distance charges, the proposed scheme mitigates the behavioral distortions associated with single-mode pricing, such as route shortening or boundary congestion. Additionally, the study underscores the importance of adopting dynamic traffic assignment models over static ones for evaluating congestion pricing policies, particularly in congested networks where junction blockage and time-varying flows are prevalent. This research provides a robust framework for network authorities to design second-best pricing strategies that balance social welfare, equity, and revenue generation.

Provenance

The full processing record for this entry. Every stage of this paper's journey through the pipeline is logged — what ran, with which tool and model, how many attempts it took, and when it last completed.

Summary generated by qwen3.6-27b-prismaquant on 2026-06-26; verification: verified.

Topics

Ranked by relevance to this paper. Hover a topic for its definition.

• speed management