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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Traffic Assignments to Transportation Networks


    Weitere Titelangaben:

    Simulation Foundations, Meth., Applicat.


    Beteiligte:


    Erscheinungsdatum :

    2014-08-12


    Format / Umfang :

    29 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    New approach -- Toll traffic assignments

    Wood, Jr., H.E. | Engineering Index Backfile | 1965


    Calculation of dynamic traffic equilibrium assignments

    Heydecker, B. / Verlander, N. / Association for European Transport | British Library Conference Proceedings | 1999


    Traffic flow on transportation networks

    Newell, Gordon Frank | SLUB | 1980


    Traffic flow on transportation networks

    Newell, Gordon Frank | TIBKAT | 1980