Abstract We provide a sufficient condition for the convergence of diagonalization algorithms for equilibrium traffic assignment problems with asymmetric Jacobian matrix B(v) of the link user cost mapping s(v) of the flow v. When , where is the diagonal of B(v ∗) and v ∗ is the equilibrium flow, we demonstrate a local convergence theorem for nonlinear cost functions. The implication of this result for practical applications of the model are outlined.
The convergence of diagonalization algorithms for asymmetric network equilibrium problems
Transportation Research Part B: Methodological ; 16 , 6 ; 477-483
18.12.1981
7 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Solving Asymmetric Network Equilibrium Problems with Genetic Algorithms
British Library Conference Proceedings | 1998
|Diagonalization by Group Matrices
NTIS | 1978
|