Abstract
This paper studies the basic constraints of dynamic traffic assignment problem and dynamic system optimum model. First, Merchant and Nemhauser's dynamic system optimum model is analyzed in detail. Second, link exit function and other constraints in dynamic traffic assignment problem are qualified strictly. Third, a continuous dynamic system optimum model and a discrete dynamic system optimum model are developed. The models can be applied to the network with multiple origin and multiple destination. Finally, an algorithm for the discrete model is developed. Test example showed that the algorithm can solve the dynamic optimum efficiently.
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.
