Skip to main content

Dynamic Congestion Pricing and the Price of Fifo

  • Conference paper
Urban Traffic Networks

Part of the book series: Transportation Analysis ((TRANSANALY))

Abstract

Congestion costs and optimal tolls have long been computed from static (single period) traffic assignment models. Only recently have efforts been made to derive congestion prices from dynamic traffic assignment models (i.e., models having time-varying traffic flows). We consider this problem here, and find that in the dynamic context, congestion costs imposed by users consist of a capacity cost plus a component associated with the first-in-first-out (FIFO) property of road traffic.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.I. Ali and J.L. Kennington (1989). MODFLO User’s Guide. Technical Report 89-OR-03, Department of Operations Research and Engineering, Southern Methodist University, Dallas, TX.

    Google Scholar 

  2. M.S. Bazaraa, H.D. Sherali and C.M. Shetty (1993). Nonlinear Programming: Theory and Algorithms. Second edition. John Wiley and Sons, New York.

    Google Scholar 

  3. M. Carey (1992). “Nonconvexity of the dynamic traffic assignment problem”. Transportation Research 26B(2), 127–133.

    Google Scholar 

  4. M. Carey and A. Srinivasan (1993). “Externalities, average and marginal costs, and tolls on congested networks with time-varying flows”. Operations Research 41(1), 217–231.

    Article  Google Scholar 

  5. M. Carey and A. Srinivasan (1992). “Solving a class of network models for dynamic flow control”. Forthcoming in European Journal of Operational Research in 1994.

    Google Scholar 

  6. R.S. Garfinkel and G.L. Nemhauser (1972). Integer Programming. Wiley, New York.

    Google Scholar 

  7. J.L. Kennington and R.V. Helgason (1980). Algorithms for Network Programming. John Wiley and Sons, New York.

    Google Scholar 

  8. H.P. Williams (1990). Model Building in Mathematical Programming. John Wiley, Chichester.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Carey, M. (1995). Dynamic Congestion Pricing and the Price of Fifo. In: Gartner, N.H., Improta, G. (eds) Urban Traffic Networks. Transportation Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79641-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-79641-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-79643-2

  • Online ISBN: 978-3-642-79641-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics