Dynamic departure time and stochastic user equilibrium assignment

This paper investigates a logit-based combined departure time and dynamic stochastic user equilibrium assignment (DDSUE) problem and shows the existence of DDSUE condition as well as exploring its properties: a novel invariant quantity of DDSUE assignments is established. The relations between daily volume of traffic and cost incurred from travelling are also investigated. In order to calculate the equilibrium, we propose a solution algorithm that can solve the problem directly, and without appealing to an equivalent mathematical programme. Since the model is based on paths where all feasible paths are enumerated in advance, we propose an efficient method that works within a reasonable path set. Through two numerical examples, we show the DDSUE and some valuable results from the model such as relation between departure flow (or path inflow) and departure cost (or path cost). Sensitivity analysis of travel volumes with respect to travel costs and model parameters is also undertaken.