The optimal cordon-based network congestion pricing problem
This 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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 38 (2004)
Issue (Month): 6 (July)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description |
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:38:y:2004:i:6:p:517-537. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.