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

Abstract

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.

Keywords:

• Link-Varying Discretization
• Simulation-Based Dynamic Traffic Assignment
• Time-Dependent Shortest Path
• Time-Varying Discretization
• Variable Time Discretization

Additional information

Funding

The authors acknowledge the partial financial support from the TRB SHRP2 C10 (B) project and the earlier assistance from Yang Gao. The opinions and results expressed in this article are solely those of the authors and do not represent those of the funding agency.