The convergence of diagonalization algorithms for asymmetric network equilibrium problems

Michael Florian and Heinz Spiess

Transportation Research Part B: Methodological, 1982, vol. 16, issue 6, 477-483

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 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.

Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(82)90007-8
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:16:y:1982:i:6:p:477-483

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().