Abstract
A review of analytical formulations of the dynamic traffic assignment problem is presented, focusing on the authors' experience with variational inequality approaches. Solution algorithms and computational issues requiring additional study are discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bar-Gera, H. (1999). Origin-Based Algorithms for Transportation Network Modeling, Technical Report #103, National Institute of Statistical Sciences, Research Triangle Park, NC.
Beckmann, M., C.B. McGuire, and C.B. Winstein. (1956). Studies in the Economics of Transportation. New Haven: Yale University Press.
Boyce, D.E., D.-H. Lee, and B.N. Janson. (1998). “A Variational Inequality Model of an Ideal Dynamic User-Optimal Route Choice Problem.” In M.G.H. Bell (ed.), Transportation Networks: Recent Methodological Advances. Amsterdam: Pergamon, pp. 289–302.
Carey, M. (1986). “A Constraint Qualification for a Dynamic Traffic Assignment Model.” Transportation Science 20, 55–58.
Carey, M. (1987). “Optimal Time Varying Flows on Congested Networks.” Operations Research 35, 58–69.
Carey, M. (1992). “Nonconvexity of the Dynamic Assignment Problem.” Transportation Research 26B, 127–133.
Chen, H.-K. (1999). Dynamic Travel Choice Models. Berlin: Springer-Verlag.
Chen, A. and D.-H. Lee. (1999). “Path-Based Algorithms for Large Scale Traffic Equilibrium Problem: A Comparison Between DSD and GP.” Paper presented at the 78th Transportation Research Board Annual Meeting, Washington, DC.
Chen, H.-K., C.-W. Chang, and M.-S. Chang. (1999). “Comparison of Link-Based Versus Route-Based Algorithms in the Dynamic User-Optimal Route Choice Problem.” Transportation Research Record 1678, 242–250.
Frank, M. and P. Wolfe. (1956). “An Algorithm for Quadratic Programming.” Naval Research Logistics Quarterly 3, 95–110.
Friesz, T.L., Luque, J., Tobin, R.L. and Wie, B.W. (1989). “Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem.” Operations Research, 37, 893–901.
Friesz, T.L., Bernstein, D., Smith, T.E., Tobin, R.L. and Wie, B.W. (1993). “A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem.” Operations Research 41, 179–191.
Friesz, T.L., D. Bernstein, and R. Stough. (1996). “Dynamic Systems, Variational Inequalities and Control Theoretic Models for Predicting Urban Network Flows.” Transportation Science 30, 14–31.
Lee, D.-H. (1996). “Formulation and Solution of a Dynamic User-Optimal Route Choice Model on a Large-Scale Traffic Network.” Ph.D. thesis in civil engineering, University of Illinois, Chicago.
Lee, D.-H., A. Chen, and Y. Nie. (2000). “Computer Experiments and Statistical Analysis on Algorithms for Traffic Assignment Problems.” Working Paper, Department of Civil Engineering, National University of Singapore, Singapore.
Merchant, D.K. and G.L. Nemhauser. (1978a). “A Model and an Algorithm for the Dynamic Traffic Assignment Problem.” Transportation Science 12(3), 183–199.
Merchant, D.K. and G.L. Nemhauser. (1978b). “Optimality Conditions for a Dynamic Traffic Assignment Model.” Transportation Science 12(3), 200–207.
Nagurney, A. (1998). Network Economics. Boston: Kluwer Academic Publishers.
Patriksson, M. (1994). The Traffic Assignment Problem: Models and Methods. Utrecht, The Netherlands: VSP.
Ran, B., D.E. Boyce and L.J. Le Blanc. (1993). “A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models,” Operations Research 41, 192–202.
Ran, B. and D. Boyce. (1994). Dynamic Urban Transportation Network Models, Lecture Notes in Economics and Mathematical Systems 417. Berlin: Springer-Verlag.
Ran, B. and D. Boyce. (1996). Modeling Dynamic Transportation Networks. Berlin: Springer-Verlag.
Ran, B. and T. Shimazaki. (1989a). “A General Model and Algorithm for the Dynamic Traffic Assignment Problems.” Proceedings of Fifth World Conference on Transport Research, Yokohama, Japan, 463–477.
Ran, B. and T. Shimazaki. (1989b). “Dynamic User Equilibrium Traffic Assignment for Congested Transportation Networks.” Presented at the Fifth World Conference on Transport Research, Yokohama, Japan.
Ran, B., D.-H. Lee, and S. Shin. (2001a). “A New Solution Algorithm for a Multi-Class Link-Based Dynamic Traffic Assignment Model.” To Appear in ASCE Journal of Transportation Engineering.
Ran, B., D.-H. Lee, and S. Shin. (2001b). “A Rolling Horizon Implementation for an Analytical Dynamic Traffic Assignment Model.” To Appear in ASCE Journal of Transportation Engineering.
Wardrop, J.G. (1952). “Some Theoretical Aspects of Road Traffic Research.” Proceedings of the Institution of Civil Engineers, Part II 1, 325–378.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Boyce, D., Lee, DH. & Ran, B. Analytical Models of the Dynamic Traffic Assignment Problem. Networks and Spatial Economics 1, 377–390 (2001). https://doi.org/10.1023/A:1012852413469
Issue Date:
DOI: https://doi.org/10.1023/A:1012852413469