Relaxation Algorithms for the General Asymmetric Traffic Equilibrium Problem

In this paper we establish the convergence of two relaxation algorithms designed to solve, respectively, the extended single-mode and the general multimodal network equilibrium problems. Both algorithms are shown to converge linearly; the first under the assumption that the cost functions are not too asymmetric; the second under the assumption that the cost interaction among the different modes is relatively weak.