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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
