Unconstrained Extremal Formulation of Some Transportation Equilibrium Problems

Carlos F. Daganzo
Additional contact information
Carlos F. Daganzo: University of California, Berkeley, California

Transportation Science, 1982, vol. 16, issue 3, 332-360

Abstract: This paper presents transportation equilibrium results that apply to both discrete choice models and network problems. Specifically, it shows that many network equilibrium problems admit an unconstrained extremal formulation and that unconstrained optimization algorithms may be used for their solution. Similar results are derived for equilibrium problems involving discrete choice models. It also shows that a certain class of stochastic networks exhibit unique equilibria and that simulation algorithms with fixed step sizes converge almost surely to the equilibrium point.

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

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.16.3.332 (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:3:p:332-360

Access Statistics for this article

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