Please use this identifier to cite or link to this item:
|Title:||Dynamic traffic assignment with rolling horizon implementation|
|Source:||Ran, B., Lee, D.-H., Shin, M.S.-I. (2002-07). Dynamic traffic assignment with rolling horizon implementation. Journal of Transportation Engineering 128 (4) : 314-322. ScholarBank@NUS Repository. https://doi.org/10.1061/(ASCE)0733-947X(2002)128:4(314)|
|Abstract:||This paper discusses an analytical dynamic traffic assignment (DTA) model with the extended capability of performing rolling horizon implementation. This model is formulated as a link-based variational inequality and can be solved efficiently to convergence by a relaxation (diagonalization) algorithm. The rolling horizon mechanism makes this proposed approach a flexible tool in evaluating simulation-based DTA models. According to different assumptions of travelers' route choice behavior, three different classes of travelers are categorized: fixed (predetermined) route class, stochastic dynamic user-optimal class. Model formulation, steps of the algorithm, and rolling horizon implementation are discussed in detail. Computational examples and results are presented and analyzed.|
|Source Title:||Journal of Transportation Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 15, 2018
WEB OF SCIENCETM
checked on Jan 30, 2018
checked on Feb 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.