The convergence of diagonalization algorithms for asymmetric network equilibrium problems

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 D(v*) > 0 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.

MoreLess

Year of publication:	1982
Authors:	Florian, Michael ; Spiess, Heinz
Published in:	Transportation Research Part B: Methodological. - Elsevier, ISSN 0191-2615. - Vol. 16.1982, 6, p. 477-483
Publisher:	Elsevier

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005115187