Skip to main content

Traffic Assignments to Transportation Networks

  • Chapter
  • First Online:
Introduction to Transportation Analysis, Modeling and Simulation

Part of the book series: Simulation Foundations, Methods and Applications ((SFMA))

  • 1980 Accesses

Abstract

This chapter begins with a brief overview of traffic assignment in transportation systems. Section 3.1 introduces the assignment problem in transportation as the distribution of traffic in a network considering the demand between locations and the transport supply of the network. Four trip assignment models relevant to transportation are presented and characterized. Section 3.2 covers traffic assignment to uncongested networks based on the assumption that cost does not depend on traffic flow. Section 3.3 introduces the topic of traffic assignment and congested models based on assumptions from traffic flow modeling, e.g., each vehicle is traveling at the legal velocity, v, and each vehicle driver is following the preceding vehicle at a legal safe velocity. Section 3.4 covers the important topic of equilibrium assignment which can be expressed by the so-called fixed-point models where origin to destination (O-D) demands are fixed, representing systems of nonlinear equations or variational inequalities. Equilibrium models are also used to predict traffic patterns in transportation networks that are subject to congestion phenomena. Section 3.5 presents the topic of multiclass assignment, which is based on the assumption that travel demand can be allocated as a number of distinct classes which share behavioral characteristics. In Sect. 3.6, dynamic traffic assignment is introduced which allows the simultaneous determination of a traveler’s choice of departure time and path. With this approach, phenomenon such as peak spreading in response to congestion dynamics or time-varying tolls can be directly analyzed. In Sect. 3.7, transportation network synthesis is introduced which focuses on the modification of a transportation road network to fit a required demand. Section 3.8 covers a case study involving a diverging diamond interchange (DDI), an interchange in which the two directions of traffic on a nonfreeway road cross to the opposite side on both sides of a freeway overpass. The DDI requires traffic on the freeway overpass (or underpass) to briefly drive on the opposite side of the road. Section 3.9 contains comprehensive questions from the transportation system area. A final section includes references and suggestions for further reading.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover 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

Similar content being viewed by others

References and Further Readings

  • Bando M, Hasebe K, Nakayama A, Shibata A, Sugiyama Y (1995) Dynamic model of traffic congestion and numerical simulation. Phys Rev E 51(2):1035–1042

    Article  Google Scholar 

  • Bliemer MCJ (2001) Analytical dynamic traffic assignment with interacting user-classes: theoretical advances and applications using a variational inequality approach. PhD thesis, Delft University of Technology, The Netherlands

    Google Scholar 

  • Bliemer MCJ, Castenmiller RJ, Bovy PHL (2002) Analytical multiclass dynamic traffic assignment using a dynamic network loading procedure. In: Proceedings of the 9th meeting EURO Working Group on Transportation. Tayler & Francis Publication, pp 473–477

    Google Scholar 

  • Cascetta E (2009) Transportation systems analysis: models and application. Springer Science + Business Media, LLV, New York

    Book  Google Scholar 

  • Chiu YC, Bottom J, Mahut M, Paz A, Balakrishna R, Waller T, Hicks J (2011) Dynamic Traffic Assignment, A Primer for the Transportation Network Modeling Committee, Transportation Research Circular, Number E-C153, June 2011

    Google Scholar 

  • Chlewicki G (2003) New interchange and intersection designs: the synchronized split-phasing intersection and the diverging diamond interchange. In: Proceedings of the 2nd urban street symposium, Anaheim

    Google Scholar 

  • Correa ER, Stier-Moses NE (2010) Wardrop equilibria. In: Cochran JJ (ed) Encyclopedia of operations research and management science. Wiley, Hoboken

    Google Scholar 

  • Dafermos SC, Sparrow FT (1969) The traffic assignment problem for a general network. J Res US Nat Bur Stand 73B:91–118

    Article  MathSciNet  Google Scholar 

  • Dubois D, Bel G, Llibre M (1979) A set of methods in transportation network synthesis and analysis. J Opl Res Soc 30(9):797–808

    Article  Google Scholar 

  • Florian M (1999) Untangling traffic congestion: application of network equilibrium models in transportation planning. OR/MS Today 26(2):52–57

    MathSciNet  Google Scholar 

  • Florian M, Hearn DW (2008) Traffic assignment: equilibrium models. In: Optimization and its applications, vol 17. Springer Publ., pp 571–592

    Google Scholar 

  • Hughes W, Jagannathan R (2010) Double crossover diamond interchange. TECHBRIEF FHWA-HRT-09-054, U.S. Department of Transportation, Federal Highway Administration, Washington, DC, FHWA contact: J. Bared, 202-493-3314

    Google Scholar 

  • Inman V, Williams J, Cartwright R, Wallick B, Chou P, Baumgartner M (2010) Drivers’ evaluation of the diverging diamond interchange. TECHBRIEF FHWA-HRT-07-048, U.S. Department of Transportation, Federal Highway Administration, Washington, DC. FHWA contact: J. Bared, 202-493-3314

    Google Scholar 

  • Knight FH (1924) Some fallacies in the interpretation of social cost. Q J Econ 38:582–606

    Article  Google Scholar 

  • Larsson T, Patriksson M (1999) Side constrained traffic equilibrium models—analysis, computation and applications. Transport Res 33B:233–264

    Article  Google Scholar 

  • Lozovanu D, Solomon J (1995) The problem of the synthesis of a transport network with a single source and the algorithm for its solution. Comput Sci J Moldova 3(2(8)):161–167

    MathSciNet  MATH  Google Scholar 

  • ProcessModel (1999) Users Manual, ProcessModel Corporation, Provo, UT

    Google Scholar 

  • Rodrigus J-P (2013) The geography of transportation systems. Taylor & Francis, Routledge

    Google Scholar 

  • Steinmetz K (2011) How it works, traffic gem, diverging-diamond interchanges can save time and lives. Time Magazine, pp. 54–55, 7 Feb 2011

    Google Scholar 

  • Wardrop JG (1952) Some theoretical aspects of road traffic research. In: Proceedings of the institute of civil engineers, Part II, vol 1, ICE Virtual Library, Thomas Telford Limited, pp 325–378

    Google Scholar 

  • Wilson AG (1967) A statistical theory of spatial distribution models. Transport Res 1:253–269

    Article  Google Scholar 

  • Yang H, Huang H-J (2004) The multi-class multi-criteria traffic network equilibrium and systems optimum problem. Transport Res Part B 38:1–15

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag London

About this chapter

Cite this chapter

Möller, D.P.F. (2014). Traffic Assignments to Transportation Networks. In: Introduction to Transportation Analysis, Modeling and Simulation. Simulation Foundations, Methods and Applications. Springer, London. https://doi.org/10.1007/978-1-4471-5637-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-5637-6_3

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-5636-9

  • Online ISBN: 978-1-4471-5637-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics