Optimal Traffic Assignment with Elastic Demands: A Review Part II. Algorithmic Approaches

Nathan H. Gartner
Additional contact information
Nathan H. Gartner: University of Lowell, Lowell, Massachusetts, and Massachusetts Institute of Technology, Cambridge, Massachusetts

Transportation Science, 1980, vol. 14, issue 2, 192-208

Abstract: Part I of this study reviewed the formulation of the traffic assignment problem (TAP) in a network and identified its underlying rationale. This part examines algorithmic approaches for calculating the flow patterns resulting from the different modes of assignment. An efficient methodology for solving the elastic-demand TAP is based on remodeling it as an equivalent assignment problem in an expanded network. The variable-demand TAP is then tranformed into a fixed-demand TAP, with a trip table consisting of the potential demands, and can be solved by available fixed-demand assignment algorithms. Three alternative transformations are described.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.14.2.192 (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:14:y:1980:i:2:p:192-208

Access Statistics for this article

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