A first best toll pricing framework for variable demand traffic assignment problems
In this paper, we present a toll pricing framework for a general variable demand traffic assignment problem with side constraints, where the demand between an origin destination pair is a function of the least total travel cost for making the trip. This general demand model unifies earlier toll pricing treatments of the variable demand models including elastic demand traffic assignment problems and combined distribution assignment problems. All of these models have the constant toll revenue property. Given that users experience the side constraints, we show that when they are charged by a toll vector in the first best toll set, the system optimal flows and demands are achieved. We then present a toll pricing framework by which a traffic planner might find the most appropriate toll vector given certain restrictions and objectives on the network. Finally, we derive the toll sets and illustrate the toll pricing framework for specific instances of the general variable demand models.
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): 39 (2005)
Issue (Month): 8 (September)
|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|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Ferrari, Paolo, 1995. "Road pricing and network equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 29(5), pages 357-372, October.
- Larsson, Torbjörn & Patriksson, Michael, 1995. "An augmented lagrangean dual algorithm for link capacity side constrained traffic assignment problems," Transportation Research Part B: Methodological, Elsevier, vol. 29(6), pages 433-455, December.
- Larsson, Torbjörn & Patriksson, Michael, 1999. "Side constrained traffic equilibrium models-- analysis, computation and applications," Transportation Research Part B: Methodological, Elsevier, vol. 33(4), pages 233-264, May.
- Yang, Hai & Huang, Hai-Jun, 1998. "Principle of marginal-cost pricing: how does it work in a general road network?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(1), pages 45-54, January.
- Yang, Hai & Bell, Michael G. H., 1997. "Traffic restraint, road pricing and network equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 303-314, August.
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:39:y:2005:i:8:p:659-678. 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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.