Show simple item record

contributor authorAnna C. Y. Li
contributor authorLinda Nozick
contributor authorRachel Davidson
contributor authorNathanael Brown
contributor authorDean A. Jones
contributor authorBrian Wolshon
date accessioned2017-05-08T22:02:24Z
date available2017-05-08T22:02:24Z
date copyrightAugust 2013
date issued2013
identifier other%28asce%29te%2E1943-5436%2E0000563.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/69543
description abstractThis 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.
publisherAmerican Society of Civil Engineers
titleApproximate Solution Procedure for Dynamic Traffic Assignment
typeJournal Paper
journal volume139
journal issue8
journal titleJournal of Transportation Engineering, Part A: Systems
identifier doi10.1061/(ASCE)TE.1943-5436.0000518
treeJournal of Transportation Engineering, Part A: Systems:;2013:;Volume ( 139 ):;issue: 008
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record