A Model and an Algorithm for the Dynamic Traffic Assignment Problems

Deepak K. Merchant and George L. Nemhauser
Additional contact information
Deepak K. Merchant: Stanford Research Institute, Menlo Park, California
George L. Nemhauser: Cornell University, Ithaca, New York

Transportation Science, 1978, vol. 12, issue 3, 183-199

Abstract: A discrete time model is presented for dynamic traffice assignment with a single destination. Congestion is treated explicitly in the flow equations. The model is a nonlinear and nonconvex mathematical programming problem. A piecewise linear version of the model, with additional assumptions on the objective function, can be solved for a global optimum using a one-pass simplex algorithm---branch-and-bound is not required. The piecewise linear program has a staircase structure and can be solved by decomposition techniques or compactification methods for sparse matrices.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (84)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.12.3.183 (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:12:y:1978:i:3:p:183-199

Access Statistics for this article

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