Algorithms for distributing traffic flows

We discuss models and algorithms of distributing traffic flows in the network of a large city or an algomeration. We provide comparative analysis of different algorithms for finding an equilibrium distribution in a transportation network. We discuss the problem of ambiguity in distributing correspondences by the paths in equilibrium and the use of entropy models to avoid this ambiguity.