On the three-stage version of stable dynamic model

In this paper we propose a new model of the traffic assignment problem. This model joints the entropy model, flow decomposition and the Stable Dynamic model. All parameters in use have a direct physical meaning and interpretations. We show that this model reduces to a non-smooth convex optimization problem that admits natural primal-dual formulation. For completeness, we present and criticize the standard static traffic assignment models. In particular, we prove that the Beckmann model reduces to the Stable Dynamic Model as a result of some limiting process.