Are We Really Solving the Dynamic Traffic Equilibrium Problem with a Departure Time Choice?

The dynamic traffic equilibrium problem has been a pivotal area of research in transportation for a few decades. The current state-of-the-art research in this area generally considers simultaneous departure time and route choice. In this paper, we theoretically prove that, in the simplest standard bottleneck model with a sufficient number of commuters, a dynamic user equilibrium (DUE) cannot be reached through a day-to-day evolution process of travelers' departure rate--a central idea behind the iterative dynamic traffic equilibrium algorithms prevalent in the literature. We carry out our exploration with the proportional swap system and then extend our analysis to other typical dynamic equilibrium algorithms such as the network tatonnement process, the simplex gravity flow dynamics, the projected dynamical system, and the evolutionary traffic dynamics. Our investigation indicates that any algorithm analogous to the five categories of systems must be cautious in terms of convergence when it is applied to solve the DUE problem with a departure time choice, and hence puts forward a general question: Are we really solving the DUE problem with a departure time choice? [ABSTRACT FROM AUTHOR]