Please use this identifier to cite or link to this item:
|Title:||Accelerating strategies and computational studies of the Frank-Wolfe algorithm for the traffic assignment problem|
|Authors:||Lee, D.-H. |
|Source:||Lee, D.-H.,Nie, Y. (2001). Accelerating strategies and computational studies of the Frank-Wolfe algorithm for the traffic assignment problem. Transportation Research Record (1771) : 97-105. ScholarBank@NUS Repository.|
|Abstract:||An accelerating strategy to the well-known Frank-Wolfe algorithm for solution of the traffic assignment problem (TAP) is presented here. The Frank-Wolfe algorithm has been widely accepted and recognized by transportation researchers and practitioners as a state-of-the-practice solution method for TAP. With abundant numerical examples, the proposed accelerating strategy was compared with other accelerating methods, such as the parallel tangent technique, Fukushima direction, and Weintraub step size. The computational results successfully indicate that this new strategy is capable of obtaining highly accurate solutions with relatively moderate central processing unit time consumed. The computational results also indicate that the performance of this accelerating strategy is better than state-of-the-art algorithms, such as the restricted simplicial decomposition algorithm and the gradient projection algorithm. The proposed accelerating strategy is easy to implement and suitable for obtaining accurate solutions to TAP because of its economical memory requirement and stable performance, even when large and congested networks are considered.|
|Source Title:||Transportation Research Record|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.