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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Approximate Solution Procedure for Dynamic Traffic Assignment


    Contributors:

    Published in:

    Publication date :

    2012-11-03


    Size :

    112013-01-01 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Approximate Solution Procedure for Dynamic Traffic Assignment

    Li, A.C.Y. / Nozick, L. / Davidson, R. et al. | British Library Online Contents | 2013



    Dynamic Traffic Assignment

    De Romph, E. | British Library Conference Proceedings | 1996


    Dynamic Traffic Assignment and Dynamic Traffic Control

    Smith, M. J. / Ghali, M. O. | British Library Conference Proceedings | 1990


    Doubly Dynamic Traffic Assignment

    Balijepalli, N. C. / Watling, D. P. / Liu, R. | Transportation Research Record | 2007