Parallel and Serial Successive Overrelaxation for Multicommodity Spatial Price Equilibrium Problems

Faruk Güder, James G. Morris and Seok H. Yoon
Additional contact information
Faruk Güder: Loyal University of Chicago, Chicago, Illinois 60611
James G. Morris: University of Wisconsin-Madison, Madison, Wisconsin 53706
Seok H. Yoon: University of Wisconsin-Madison, Madison, Wisconsin 53706

Transportation Science, 1992, vol. 26, issue 1, 48-58

Abstract: Computational experience is reported for various serial implementations of successive overrelaxation (SOR) applied to a linear multicommodity spatial price equilibrium problem posed as linear complementarity problem. Computational schemes that neglect the vast majority of the variables during most iterations are shown to be relatively efficient. A parallel implementation based on the same neglect is shown to exhibit encouraging average speedup over the single processor case. The SOR approach is shown empirically to converge for nonsymmetric problems. Dense network problems with up to 60 regions (each a potential supply or demand region) and 10 commodities, representing on the order of 36,000 variables, as well as sparse network problems with up to 140 regions, are typically solved in a few seconds of CPU time.

Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.26.1.48 (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:26:y:1992:i:1:p:48-58

Access Statistics for this article

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