-
- Deepak K. Merchant
- Stanford Research Institute, Menlo Park, California
-
- George L. Nemhauser
- Cornell University, Ithaca, New York
書誌事項
- 公開日
- 1978-08
- DOI
-
- 10.1287/trsc.12.3.200
- 公開者
- Institute for Operations Research and the Management Sciences (INFORMS)
この論文をさがす
説明
<jats:p> 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. </jats:p>
収録刊行物
-
- Transportation Science
-
Transportation Science 12 (3), 200-207, 1978-08
Institute for Operations Research and the Management Sciences (INFORMS)
