Optimality Conditions for a Dynamic Traffic Assignment Model

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, 200-207

Abstract: We consider a dynamic traffic assignment model formulated as a nonlinear and noneonvex mathematical program. Necessary optimality conditions require equalization of certain marginal costs for all the paths that are being used, and these optimality conditions are shown to be a generalization of the optimality conditions of a conventional static traffic assignment problem. We also examine the behavior of the dynamic model under static demand conditions and show that in this case our model is a generalized version of a standard static model. Our model suggests a promising refinement of the objective function for the static case.

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

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.12.3.200 (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:200-207

Access Statistics for this article

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