Trial-and-error method for congestion pricing scheme under side-constrained probit-based stochastic user equilibrium conditions
No abstract is available for this item.
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 (2011)
Issue (Month): 5 (September)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/regional+science/journal/11116/PS2|
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.:
- Maher, Mike & Stewart, Kathryn & Rosa, Andrea, 2005. "Stochastic social optimum traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 39(8), pages 753-767, September.
- Yang, Hai & Meng, Qiang & Lee, Der-Horng, 2004. "Trial-and-error implementation of marginal-cost pricing on networks in the absence of demand functions," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 477-493, July.
- Verhoef, Erik T., 2002. "Second-best congestion pricing in general networks. Heuristic algorithms for finding second-best optimal toll levels and toll points," Transportation Research Part B: Methodological, Elsevier, vol. 36(8), pages 707-729, September.
- Li, Michael Z. F., 2002. "The role of speed-flow relationship in congestion pricing implementation with an application to Singapore," Transportation Research Part B: Methodological, Elsevier, vol. 36(8), pages 731-754, September.
- Bellei, Giuseppe & Gentile, Guido & Papola, Natale, 2002. "Network pricing optimization in multi-user and multimodal context with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 36(9), pages 779-798, November.
- Ferrari, Paolo, 1997. "Capacity constraints in urban transport networks," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 291-301, August.
- Ferrari, Paolo, 1995. "Road pricing and network equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 29(5), pages 357-372, October.
- Theodore Tsekeris & Stefan Voß, 2009. "Design and evaluation of road pricing: state-of-the-art and methodological advances," Netnomics, Springer, vol. 10(1), pages 5-52, April.
- Zhang, Xiaoning & Yang, Hai, 2004. "The optimal cordon-based network congestion pricing problem," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 517-537, July.
When requesting a correction, please mention this item's handle: RePEc:kap:transp:v:38:y:2011:i:5:p:819-843. 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: (Sonal Shukla)or (Rebekah McClure)
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.