A simultaneous route and departure time choice equilibrium model on dynamic networks

In this paper, we are concerned with modeling dynamic networks, when drivers simultaneously optimize their departure time and route choice. We state equilibrium conditions and propose a simulation-based model that can solve large networks accounting for many realities of actual networks. The main components of the model are a time-dependent shortest path algorithm for fixed arrival times and a traffic simulator. The proposed model has the potential to realistically capture user decisions when arrival time based origin–destination tables are easier to obtain than the departure time based ones, e.g. in the morning peak and in special events. Two solution methodologies are designed and tested: the first emulates users' day-to-day dynamic behavior and does not guarantee convergence; the second is a heuristic approach that adjusts link travel times and always converges to an equilibrium solution, although not at the desired level of schedule delay. Computational experiments on a small street network are presented.