Abstract
In this paper, the dynamic system optimal traffic assignment model is formulated as a convex control problem for general networks with many origins and many destinations. Analytical and computational difficulties caused by the nonconvexity of previous models are eliminated. The modeling of arc traffic dynamics is also improved to prohibit instantaneous flow propagation on each arc even though the concave exit functions are still employed to represent the physical process of traffic congestion. Lastly, an economic interpretation of the optimality conditions is given as a dynamic assignment principle which requires equilibration of actual marginal costs on all the paths that are used.
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.
