Please use this identifier to cite or link to this item:
|Title:||New algorithm for a multiclass dynamic traffic assignment model|
|Citation:||Ran, B., Lee, D.-H., Shin, M.S.-I. (2002-07). New algorithm for a multiclass dynamic traffic assignment model. Journal of Transportation Engineering 128 (4) : 323-335. ScholarBank@NUS Repository. https://doi.org/10.1061/(ASCE)0733-947X(2002)128:4(323)|
|Abstract:||In this paper, three traveler classes are classified according to different assumptions of travelers' route choice behavior, including fixed route, stochastic dynamic user optimum, and dynamic user optimum. Note that "multiclass" in this paper refers to travelers' different realization of traffic conditions, instead of representing vehicle types. The three classes of users are integrated into one dynamic traffic assignment (DTA) model and solved using a newly proposed algorithm. In this paper, variables of link flow and exit flow are represented solely by in-flow. The resulting linear program subproblem in the inner iteration is proved and solved as a typical time-dependent shortest route problem over a physical network. Accordingly, the usually required time-space network expansion in solving DTA models is no longer needed. Computational results from a hypothetical network and the Sioux Falls network are reported 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 Jul 18, 2018
WEB OF SCIENCETM
checked on May 30, 2018
checked on Jun 1, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.