Large-Scale Dynamic Traffic Assignment: Implementation Issues and Computational Analysis
Publication: Journal of Transportation Engineering
Volume 130, Issue 5
Abstract
This paper is concerned with implementation challenges related to using dynamic traffic assignment on actual large urban networks. Such challenges include the manipulation of network and demand data, the modeling of turning movements, the efficient computation of link travel times, and the handling of complex path data. The basic simulation-assignment based approach introduced by Mahmassani et al. in 1993 was enhanced to address the challenges outlined above. The model is used on applications presently performed by agencies with static transportation planning models, such as infrastructure improvements, demand management, and congestion pricing. In addition, various applications that are difficult to perform with static models are explored, such as the evaluation of Intelligent Transportation Systems technologies. Computational tests are performed on the Columbus, Ohio urban network and the results are analyzed.
Get full access to this article
View all available purchase options and get full access to this article.
References
Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network flows-theory, algorithms, and applications, Prentice-Hall, Englewood Cliffs, N.J.
Ben-Akiva, M., Bierlaire, M., Bottom, J., Koutsopoulos, H. N., and Mishalani, R. G. (1997). “Development of a route guidance generation system for real-time application.” Proc., 8th Int. Federation of Automatic Control Symposium on Transportation Systems, Chania, Greece.
Boyce, D. E., Lee, D. H., and Janson, B. N. (1996). “A variational inequality model of an ideal dynamic user-optimal route choice problem.” Presented at the 4th Meeting of the EURO Working Group on Transportation, Newcastle, U.K.
Carey, M.(1986). “A constraint qualification for a dynamic traffic assignment model.” Transp. Sci., 20, 55–88.
Carey, M.(1987). “Optimal time-varying flows on congested networks.” Oper. Res., 35, 58–69.
Carey, M.(1992). “Nonconvexity of the dynamic traffic assignment problem.” Transp. Res., Part B: Methodol., 26B, 127–133.
Daganzo, C. F.(1994). “The cell transmission model: A simple dynamic representation of highway traffic consistent with the hydrodynamic theory.” Transp. Res., Part B: Methodol., 28B, 269–287.
Daganzo, C. F.(1995). “The cell transmission model, Part II: Network traffic.” Transp. Res., Part B: Methodol., 29B, 79–93.
Friesz, T. K., Bernstein, D., Smith, T. E., Tobin, R. L., and Wie, B. W.(1993). “A variational inequality formulation of the dynamic network user equilibrium problem.” Oper. Res., 41, 179–191.
Friesz, T. L., Luque, F. J., Tobin, R. L., and Wie, B. W.(1989). “Dynamic network traffic assignment considered as a continuous time optimal control problem.” Oper. Res., 37, 893–901.
Janson, B. N.(1991). “Dynamic traffic assignment for urban networks.” Transp. Res., Part B: Methodol., 25B, 143–161.
Lawson, T. W., Lovell, D. J., and Daganzo, C. F. (1996). “Using input-output diagrams to determine spatial and temporal extends of a queue upstream of a bottleneck.” Transportation Research Record 1572, Transportation Research Board, Washington, D.C., 140–147.
Lee, D. H. (1996). “Formulation and solution of a dynamic user-optimal route choice model on a large-scale traffic network.” PhD thesis, Univ. of Illinois, Chicago.
Li, Y., Ziliaskopoulos, A. K., and Waller, S. T. (1999). “Linear programming formulations for system optimum dynamic traffic assignment with arrival time based and departure time based demands.” Transportation Research Record 1667, Transportation Research Board, Washington, D.C., 52–59.
Mahmassani, H. S., and Hawas, Y. (1997). “Data requirements for the development, calibration of dynamic traffic models, and algorithms for ATMS/ATIS.” Presented at the 76th Annual Meeting of the Transportation Research Board, Washington, D.C.
Mahmassani, H. S., Peeta, S., Hu, T. Y., and Ziliaskopoulos, A. (1993). “Dynamic traffic assignment with multiple user classes for real-time ATIS/ATMS applications.” Proc., Advanced Traffic Management Conf., Federal Highway Administration, U.S. Department of Transportation, Washington, D.C., 91–114.
Merchant, D. K., and Nemhauser, G. L.(1978a). “A model and an algorithm for the dynamic traffic assignment problem.” Transp. Sci., 12, 183–199.
Merchant, D. K., and Nemhauser, G. L.(1978b). “Optimality conditions for a dynamic traffic assignment model.” Transp. Sci., 12, 200–207.
Peeta, S., and Ziliaskopoulos, A.(2002). “Fundamentals of dynamic traffic assignment: The past, the present and the future.” Netw. Spatial Econ., 1, 201–230.
Smith, M. J.(1993). “A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks.” Transp. Res., Part B: Methodol., 27B, 49–63.
Wie, B. W., Tobin, R. L., Friesz, T. L., and Bernstein, D.(1995). “A discrete time, nested cost operator approach to the dynamic network user equilibrium problem.” Transp. Sci., 28, 79–92.
Ziliaskopoulos, A. K.(2000). “A linear programming model for the single destination system optimum dynamic traffic assignment problem.” Transp. Sci., 34, 37–49.
Ziliaskopoulos, A. K., and Lee, S. (1996). “A cell transmission based assignment-simulation model for integrated freeway/surface street systems.” Presented at the 75th Transportation Research Board Annual Meeting, Washington, D.C.
Ziliaskopoulos, A. K., and Mahmassani, H. S.(1996). “On finding least time paths considering delays for intersection movements.” Transp. Res., Part B: Methodol., 30(5), 359–367.
Ziliaskopoulos, A. K., and Rao, L.(1999). “A simultaneous route and departure time choice equilibrium model on dynamic networks.” Int. Trans. Oper. Res., 6, 21–37.
Ziliaskopoulos, A. K., and Waller, S. T.(2000). “An internet based geographic information system that integrates data, models and users for transportation applications.” Transp. Res., Part C: Emerg. Technol., 8C, 427–444.
Information & Authors
Information
Published In
Copyright
Copyright © 2004 American Society of Civil Engineers.
History
Received: Feb 15, 2000
Accepted: Aug 8, 2003
Published online: Aug 16, 2004
Published in print: Sep 2004
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.