Relaxation Algorithms for the General Asymmetric Traffic Equilibrium Problem

Stella Dafermos
Additional contact information
Stella Dafermos: Brown University, Providence, Rhode Island

Transportation Science, 1982, vol. 16, issue 2, 231-240

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

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

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.16.2.231 (application/pdf)

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:inm:ortrsc:v:16:y:1982:i:2:p:231-240

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().