Abstract
We develop and test an augmented Lagrangian method for solving dynamic traffic assignment models formulated as optimal control problems. Our presentation is in terms of the discrete time, system optimal traffic assignment problem. However, the basic ideas presented here are readily applied to continuous time models and to other behavioral assumptions regarding traffic assignment which may be expressed as optimal control problems. The proposed algorithm obviates the need for path enumeration and exploits the natural decomposition of the traffic assignment problem by time period which is possible when an optimal control formulation is employed.
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.
