Please use this identifier to cite or link to this item:
|Title:||Computational study of state-of-the-art path-based traffic assignment algorithms|
|Citation:||Chen, A., Lee, D.-H., Jayakrishnan, R. (2002-07-01). Computational study of state-of-the-art path-based traffic assignment algorithms. Mathematics and Computers in Simulation 59 (6) : 509-518. ScholarBank@NUS Repository. https://doi.org/10.1016/S0378-4754(01)00437-2|
|Abstract:||Recent research has demonstrated and established the viability of applying path-based algorithms to the traffic equilibrium problem in reasonably large networks. Much of the attention has been focused on two particular algorithms: the disaggregate simplicial decomposition (DSD) algorithm and the gradient projection (GP) algorithm. The purpose of this paper is to evaluate the performance of these two path-based algorithms using networks of realistic size. Sensitivity analysis is performed on randomly generated networks to examine the performance of the algorithms with respect to network sizes, congestion levels, number of origin-destination (OD) pairs, and accuracy levels. In order to be empirically convincing, a realistic large-scale network, known as the ADVANCE network, is also used to show that path-based algorithms are a viable alternative in practice. © 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.|
|Source Title:||Mathematics and Computers in Simulation|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 7, 2018
WEB OF SCIENCETM
checked on Nov 21, 2018
checked on Nov 24, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.