Abstract
A gradient projection method is presented to solve the problem with dynamic traffic assignment. The gradient projection scheme is a feasible direction algorithm that operates directly in the space of path flows. The algorithm was applied to a simulation-based model for dynamic traffic assignment that used microscopic simulation for supply-side modeling. The formulation used link cost functions that were separate for moving and queuing vehicles on each link, so that the formulation could effectively capture the effects of traffic dynamic characteristics on each group, especially in arterial networks. The model and solution algorithm were applied to a small real-world network, and the performance was studied. The gradient projection algorithm avoided the problem of convergence to nonoptimal conditions shown by the prevalent method of successive averages and demonstrated significantly faster convergence.
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 callMore From: Transportation Research Record: Journal of the Transportation Research Board
Disclaimer: 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.
