A Unified Description of Iterative Algorithms for Traffic Equilibria

Michael Patriksson
Department of Mathematics,
Linköping Institute of Technology,
S-581 83 Linköping, Sweden

ABSTRACT:

The purpose of this paper is to provide a unified description of 
iterative algorithms for the solution of traffic equilibrium problems. 
We demonstrate 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 algorithms within the framework is
also discussed.

KEY WORDS: Transportation, Networks, Mathematical Programming