Within the simulation-based dynamic traffic assignment (SBDTA) model, the time-dependent shortest path (TDSP) algorithm plays a crucial role in the path-set update procedure by solving for the current optimal auxiliary solution (shortest path). Common types of TDSP algorithms require temporal discretization of link/node time/cost data, and the discretization could affect the solution quality of TDSP and of the overall SBDTA as well. This article introduces two variable time-discretization strategies applicable to TDSP algorithms. The strategies are aimed at determining the optimal time discretization for time-dependent links/nodes travel time data. The first proposed strategy produces a specific discretization interval for each link. The second proposed strategy generates time-varying intervals for the same link over the analysis period. The proposed strategies are implemented in a link-based time-dependent A* algorithm in a SBDTA model DynusT and tested with two numerical experiments on two traffic networks. The results show that the proposed discretization methods achieve the research goal—to flexibly and scalably balance the memory usage and run time for SBDTA without degrading the convergence. This property is rather important when dealing with a large real-world network with a long analysis period.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Variable Time-Discretization Strategies-Based, Time-Dependent Shortest Path Algorithm for Dynamic Traffic Assignment


    Contributors:
    Tian, Ye (author) / Chiu, Yi-Chang (author)

    Published in:

    Publication date :

    2014-10-02


    Size :

    13 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Traffic assignment by shortest path method using TD factor

    Benesh, A.H. | Engineering Index Backfile | 1967


    Path-based capacity-restrained dynamic traffic assignment algorithm

    Javani, Babak / Babazadeh, Abbas / Ceder, Avishai (Avi) | Taylor & Francis Verlag | 2019



    Distributable time-dependent traffic assignment

    Taylor, N. B. / Carmichael, S. / Planning and Transport Research and Computation International Association | British Library Conference Proceedings | 1995


    Reversibility of the time-dependent shortest path problem

    Daganzo, Carlos F. | Online Contents | 2002