原文传递
LINK- AND PATH-BASED TRAFFIC ASSIGNMENT ALGORITHMS: COMPUTATIONAL AND STATISTICAL STUDY.
| 题名： | LINK- AND PATH-BASED TRAFFIC ASSIGNMENT ALGORITHMS: COMPUTATIONAL AND STATISTICAL STUDY. |
| 作者： | Lee-D-H; Nie-Y; Chen-A; Leow-YC |
| 关键词： | Algorithms-; Central-processing-units-Computers; Computational-performance; Iterations-; Regression-analysis; Statistical-analysis; Time-duration; Traffic-assignment |
| 摘要： | 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. |
| 总页数： | Transportation Research Record. 2002. (1783) pp80-88 (7 Fig., 4 Tab., 16 Ref.) |
| 报告类型： | 科技报告 |
相关文献
检索历史
应用推荐
