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

Transportation Research Record

Volumn , Issue 1783, 2002, Pages 80-88

  Lee, Der Horng ^a   Nie, Yu ^b   Chen, Anthony ^c   Leow, Yuen Chau ^d  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Utah State University   (United States)

^d LAND TRANSPORT AUTHORITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; TRANSPORTATION;

TRAFFIC ASSIGNMENT PROBLEMS (TAP);

TRAFFIC CONTROL;

EID: 0036957694     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1783-11     Document Type: Article

References (16)

1. Wardrop, J. G. Some Theoretical Aspects of Road Traffic Research. Proceedings of the Institute of Civil Engineers, Part II, Vol. 1, 1952, pp. 325-378.
2. Chen, A., and D.-H. Lee. Path-Based Algorithms for Large-Scale Traffic Equilibrium Problems: Comparison Between DSD and GP. Presented at the 78th Annual Meeting of the Transportation Research Board, Washington, D.C., 1999.
3. Chen, A., D.-H. Lee, and Y. Nie. Path and Link Based Traffic Assignment Algorithms: A Comprehensive Computational Study. Proc., 6th International Conference on Application of Advanced Technologies in Transportation Engineering (CD-ROM), Singapore, American Society of Civil Engineers, New York, 2000.
4. Jayakrishnan, R., W. K. Tsai, J. N. Prashker, and S. Rajadhyaksha. Faster Path-Based Algorithm for Traffic Assignment. In Transportation Research Record 1443, TRB, National Research Council, Washington, D.C., 1994, pp. 75-83.
5. Larsson, T., and M. Patriksson. Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem. Transportation Science, Vol. 26, 1992, pp. 4-17.
6. Sun, C., R. Jayakrishnan, and W. K. Tsai. Computational Study of a Path-Based Algorithm and Its Variants for Static Traffic Assignment. In Transportation Research Record 1537, TRB, National Research Council, Washington, D.C., 1996, pp. 106-115.
7. Tatineni, M., H. Edwards, and D. Boyce. Comparison of Disaggregate Simplicial Decomposition and Frank-Wolfe Algorithms for User-Optimal Route Choice. In Transportation Research Record 1617, TRB, National Research Council, Washington, D.C., 1998, pp. 157-162.
8. Frank, M., and P. Wolfe. An Algorithm for Quadratic Programming. Naval Research Logistics Quarterly, Vol. 3, 1956, pp. 95-110.
9. LeBlanc, L. J., E. K. Morlok, and W. P. Pierskalla. An Efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem. Transportation Research, Vol. 9, 1975, pp. 309-318.
10. Florian, M., J. Guelat, and H. Spiess. An Efficient Implementation of the "PT" Variant of the Linear Approximation Method for the Network Equilibrium Problem. Networks, Vol. 17, 1987, pp. 319-339.
11. LeBlanc, L. J., R. V. Helgason, and D. E. Boyce. Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Problems. Transportation Science, Vol. 19, 1985, pp. 445-462.
12. Hearn, D. W., S. Lawphongranich, and J. A. Ventura. Finiteness in Restricted Simplicial Decomposition. Operations Research Letters, Vol. 4, 1985, pp. 125-130.
13. Hearn, D. W., S. Lawphongranich, and J. A. Ventura. Restricted Simplicial Decomposition: Computation and Extensions. Mathematical Programming Study, Vol. 31, 1987, pp. 99-118.
14. Hearn, D., and D. Kim. RSDTA User Manual. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, 1995.
15. Barzaraa, M. S., and C. M. Shetty. Nonlinear Programming: Theory and Algorithms. John Wiley & Sons, New York, 1979.
16. Bar-Gera, H. Origin-Based Algorithms for Transportation Network Modeling. Technical Report 103. National Institute of Statistical Sciences, Research Triangle Park, N.C., 1999.