This paper addresses the system optimum dynamic traffic assignment (SO-DTA) problem with departure time choice on a two-terminal network, where the travel cost consists of travel time and an early schedule delay cost. Under a certain condition, we show that SO-DTA reduces to the latest departure earliest arrival flow (LDEAF), and hence methodologies of LDEAF can be used to study SO-DTA. A successive shortest path (SSP) algorithm is used to solve the LDEAF problem. The benefit is that the SSP algorithm involves only the shortest path computations on a static network. System marginal costs, externalities and dynamic user equilibrium tolls are analyzed in the LDEAF context, and used to provide a better understanding of the SO-DTA problem characteristics. Further, the study findings can be used for the morning commute problem as it is a special case of the SO-DTA problem on a two-terminal network.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    System optimum dynamic traffic assignment with departure time choice on two-terminal networks


    Beteiligte:
    Zheng, Hong (Autor:in) / Peeta, Srinivas (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    29.11.2019


    Format / Umfang :

    28 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    A Capacity Increasing Paradox for a Dynamic Traffic Assignment with Departure Time Choice

    Akamatsu, T. / Kuwahara, M. | British Library Conference Proceedings | 1999


    A departure time choice model for dynamic assignment on interurban networks

    Aguilera, V. / Wagner, N. / Association for European Transport | British Library Conference Proceedings | 2009


    Linear Programming Formulations for System Optimum Dynamic Traffic Assignment with Arrival Time-Based and Departure Time-Based Demands

    Li, Y. / Ziliaskopoulos, A. K. / Waller, S. T. et al. | British Library Conference Proceedings | 1999


    Linear Programming Formulations for System Optimum Dynamic Traffic Assignment with Arrival Time-Based and Departure Time-Based Demands

    Li, Yue / Ziliaskopoulos, Athanasios K. / Waller, S. Travis | Transportation Research Record | 1999