AbstractThis paper investigates the cordon-based second-best congestion-pricing problems on road networks, including optimal selection of both toll levels and toll locations. A road network is viewed as a directed graph and the cutset concept in graph theory is used to describe the mathematical properties of a toll cordon by examining the incidence matrix of the network. Maximization of social welfare is sought subject to the elastic-demand traffic equilibrium constraint. A mathematical programming model with mixed (integer and continuous) variables is formulated and solved by a combined use of a binary genetic algorithm and a grid search method for simultaneous determination of the toll levels and cordon locations on the networks. The model and algorithm are demonstrated with a numerical example.
The optimal cordon-based network congestion pricing problem
Transportation Research Part B: Methodological ; 38 , 6 ; 517-537
2003-08-05
21 pages
Article (Journal)
Electronic Resource
English
The optimal cordon-based network congestion pricing problem
Online Contents | 2004
|Cordon-Based Optimal Congestion Pricing
ASCE | 2002
|Cordon-Based Optimal Congestion Pricing
British Library Conference Proceedings | 2002
|Optimal joint distance and time toll for cordon-based congestion pricing
Online Contents | 2014
|Optimal joint distance and time toll for cordon-based congestion pricing
Elsevier | 2014
|