TY - JOUR
T1 - Link- and path-based traffic assignment algorithms computational and statistical study
AU - Lee, Der Horng
AU - Nie, Yu
AU - Chen, Anthony
AU - Leow, Yuen Chau
PY - 2002/1/1
Y1 - 2002/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0036957694&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0036957694&partnerID=8YFLogxK
U2 - 10.3141/1783-11
DO - 10.3141/1783-11
M3 - Article
AN - SCOPUS:0036957694
SP - 80
EP - 88
JO - Transportation Research Record
JF - Transportation Research Record
SN - 0361-1981
IS - 1783
ER -