Approximate solution procedure for dynamic traffic assignment
Document Type
Article
Publication Date
8-13-2013
Abstract
This paper proposes an approximate dynamic traffic assignment algorithm for the analysis of traffic conditions in large-scale road networks over several days. The time-dependent origin-destination trips are assumed to be known. A case study for evacuation of the New Orleans metropolitan area prior to the landfall of Hurricane Katrina is presented to test the efficiency and effectiveness of the proposed procedure. The model results are compared to the traffic counts collected during the evacuation and then further tested by the mesoscopic simulation-based model, DynusT. The study shows that the traffic pattern produced by the proposed procedure is a good approximation to traffic count data and that the algorithm provides a good approximation to the computations performed by DynusT ©2013 American Society of Civil Engineers.
Publication Source (Journal or Book title)
Journal of Transportation Engineering
First Page
822
Last Page
832
Recommended Citation
Li, A., Nozick, L., Davidson, R., Brown, N., Jones, D., & Wolshon, B. (2013). Approximate solution procedure for dynamic traffic assignment. Journal of Transportation Engineering, 139 (8), 822-832. https://doi.org/10.1061/(ASCE)TE.1943-5436.0000518