Show simple item record

contributor authorA. K. Ziliaskopoulos
contributor authorS. T. Waller
contributor authorY. Li
contributor authorM. Byram
date accessioned2017-05-08T21:04:30Z
date available2017-05-08T21:04:30Z
date copyrightSeptember 2004
date issued2004
identifier other%28asce%290733-947x%282004%29130%3A5%28585%29.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/37643
description abstractThis paper is concerned with implementation challenges related to using dynamic traffic assignment on actual large urban networks. Such challenges include the manipulation of network and demand data, the modeling of turning movements, the efficient computation of link travel times, and the handling of complex path data. The basic simulation-assignment based approach introduced by Mahmassani et al. in 1993 was enhanced to address the challenges outlined above. The model is used on applications presently performed by agencies with static transportation planning models, such as infrastructure improvements, demand management, and congestion pricing. In addition, various applications that are difficult to perform with static models are explored, such as the evaluation of Intelligent Transportation Systems technologies. Computational tests are performed on the Columbus, Ohio urban network and the results are analyzed.
publisherAmerican Society of Civil Engineers
titleLarge-Scale Dynamic Traffic Assignment: Implementation Issues and Computational Analysis
typeJournal Paper
journal volume130
journal issue5
journal titleJournal of Transportation Engineering, Part A: Systems
identifier doi10.1061/(ASCE)0733-947X(2004)130:5(585)
treeJournal of Transportation Engineering, Part A: Systems:;2004:;Volume ( 130 ):;issue: 005
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record