A link-based day-to-day traffic assignment model

Existing day-to-day traffic assignment models are all built upon path flow variables. This paper demonstrates two essential shortcomings of these path-based models. One is that their application requires a given initial path flow pattern, which is typically unidentifiable, i.e. mathematically nonunique and practically unobservable. In particular, we show that, for the path-based models, different initial path flow patterns constituting the same link flow pattern generally gives different day-to-day link flow evolutions. The other shortcoming of the path-based models is the path-overlapping problem. That is, the path-based models ignore the interdependence among paths and thus can give very unreasonable results for networks with paths overlapping with each other. These two path-based problems exist for most (if not all) deterministic day-to-day dynamics whose fixed points are the classic Wardrop user equilibrium. To avoid the two path-based problems, we propose a day-to-day traffic assignment model that directly deals with link flow variables. Our link-based model captures travelers’ cost-minimization behavior in their path finding as well as their inertia. The fixed point of our link-based dynamical system is the classic Wardrop user equilibrium.