Link- and path-based traffic assignment algorithms: computational and statistical study.

Author(s)
Lee, D.-H. Nie, Y. Chen, A. & Leow, Y.C.
Year
Abstract

The computational performance of five algorithms for the traffic assignment problem (TAP) is compared with that of mid- to large-scale randomly generated grid networks. The applied procedures include the Frank-Wolfe, PARTAN, gradient projection, restricted simplicial decomposition, and disaggregate simplicial decomposition algorithms. A statistical analysis is performed to determine the relative importance of various properties (network size, congestion level, solution accuracy, zone-node ratio) of the traffic assignment problem for the five selected algorithms. Regression models, which measure central processing unit time and number of iterations consumed by each algorithm using various factors and their combinations, are derived to provide a quantitative evaluation. Ultimately, the findings of this research will be useful in guiding transportation professionals to choose suitable solution algorithms and to predict the resulting algorithm performance in TAPs.

Request publication

6 + 14 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
C 28181 (In: C 28170 S [electronic version only]) /71 / ITRD E820534
Source

In: Transportation network modeling 2002, Transportation Research Record TRR 1783, p. 80-88, 16 ref.

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.