A unified description of iterative algorithms for traffic equilibria

The purpose of this paper is to provide a unified description of iterative algorithms for the solution of traffic equilibrium problems. The paper demonstrates that a large number of well known solution techniques can be described in a unified manner through the concept of partial linearization and establish close relationships with other algorithmic classes for nonlinear programming and variational inequalities. In the case of nonseparable travel costs, the class of partial linearization algorithms are shown to yield new results in the theory of finite-dimensional variational inequalities. The possibility of applying truncated agorithms within the framework is also discussed.