Quasidynamic Network Assignment Procedure with Transient Demand Matrices
Publication: Journal of Transportation Engineering
Volume 131, Issue 2
Abstract
This paper presents a simulation-based quasidynamic network assignment (DNA) procedure that facilitates the representation of changes in route choice behavior of users traveling on extended urban networks. The procedure is based on the building of regularly updated transient demand matrices. Its potential to facilitate on-line traffic monitoring of the effects of implementing real-time guidance systems is investigated both theoretically and empirically through testing in real urban network conditions. The DNA model performance is assessed with respect to the assumed origin–destination matrix split sequence, the temporal length of updating periods, in which the total assignment period is divided, and the total size of demand. The simulation results indicate the beneficial impact of dynamic optimal path information provision using the DNA model on network performance. The benefits of information updating frequency, ranging from , are found to increase with respect to the growing levels of network congestion.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgments
The writers are grateful to two anonymous reviewers who made several constructive and helpful comments on earlier versions of this paper.
References
Barcelo, J., Casas, J., and Ferrer, J. L. (2001). “Flow charting.” Annual Review, Traffic Technology International, 34–37.
Carey, M. (1986). “A constraint qualification for a dynamic traffic assignment model.” Transp. Sci., 20, 55–58.
Carroll, J. D. (1959). “A method of traffic assignment to an urban network.” Highway Res. Bd. Bull. 224: Trip Characteristics and Traffic Assignment, Wahsington, D.C., 64–71.
Chen, H.-K., and Hsueh, C.-F. (1998). “A model and an algorithm for the dynamic user-optimal route choice problem.” Transp. Res., Part B: Methodol., 32B(3), 219–234.
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.” Oper. Res., 37(6), 893–901.
Hounsell, N. B., McDonald, M., and Breheret, L. (1991). “Models and strategies for dynamic route guidance.” Advanced telematics in road transport, Elsevier, Brussels, Belgium, 89–98.
Huang, H.-J., and Lam, W. H. K. (2002). “Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues.” Transp. Res., Part B: Methodol., 36B(3), 253–273.
Hurdle, V. R. (1974). “The effect of queuing on traffic assignment in a simple road network.” Proc., 6th Int. Symp. on Transportation and Traffic Theory, Elsevier, Amsterdam, The Netherlands, 519–540.
Kaufman, D. E., Smith, R. L., and Wunderlich, K. E. (1998). “User-equilibrium properties of fixed points in dynamic traffic assignment.” Transp. Res., Part C: Emerg. Technol., 6C(1–2), 1–16.
Larsson, T., and Patriksson, M. (1999). “Side constrained traffic equilibrium models-analysis, computation and applications.” Transp. Res., Part B: Methodol., 33B(4), 233–264.
Merchant, D. K., and Nemhauser, G. L. (1978). “A model and an algorithm for the dynamic traffic assignment problems.” Transp. Sci., 12, 183–199.
Papageorgiou, M. (1990). “Dynamic modeling, assignment, and route guidance in traffic networks.” Transp. Res., Part B: Methodol., 24B(6), 471–495.
Ran, B., and Boyce, D. (1996). Modeling dynamic transportation networks: An intelligent transportation system oriented approach, 2nd Ed., Springer, Berlin.
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(1), 49–63.
Stathopoulos, A., and Karlaftis, M. (2001). “Temporal and spatial variations of real-time traffic data in urban areas.” Transp. Res. Rec., Transportation Research Board, Washington, D.C., 1768, 135–140.
Stathopoulos, A., and Parmaksizoglou, T. (1989). “A time-dependent traffic assignment procedure using transient matrices.” Working Paper, Laboratory of Railways and Transport, Dept. of Transportation Planning and Engineering, National Technical Univ. of Athens, Athens, Greece.
Thomas, R. (1991). Traffic assignment techniques, Avebury Technical, Aldershot, U.K.
Tong, C. O., and Wong, S. C. (2000). “A predictive dynamic traffic assignment model in congested capacity-constrained road networks.” Transp. Res., Part B: Methodol., 34B(8), 625–644.
Tsekeris, T., and Stathopoulos, A. (2003). “Real-time dynamic matrix adjustment using simulated and actual link flows in urban networks.” Transp. Res. Rec., Transportation Research Board, Washington, D.C., 1857, 117–127.
Van Aerde, M., and Yagar, S. (1988). “Dynamic integrated freeway/traffic signal networks: a routing-based modelling approach.” Transp. Res., Part A, 22A(6), 445–453.
Van Vliet, D. (1978). “Improved shortest path algorithm for transport networks.” Transp. Res., 12, 7–20.
Van Vliet, D. (1982). “SATURN-A modern assignment model.” Traffic Eng. Control, 23, 578–581.
Yagar, S. (1971). “Dynamic traffic assignment by individual path minimization and queuing.” Transp. Res., 5(3), 179–196.
Zhang, D., and Nagurney, A. (1996). “On the local and global stability of a travel route choice adjustment process.” Transp. Res., Part B: Methodol., 30B(4), 245–262.
Ziliaskopoulos, A., and Peeta, S. (2002). “Foundations of dynamic traffic assignment: The past, the present and the future.” Proc., 81st Annual Meeting Transportation Research Board, Transportation Research Board, Washington, D.C.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 131 • Issue 2 • February 2005
Pages: 89 - 100
Copyright
© 2005 ASCE.
History
Received: Jul 30, 2001
Accepted: May 28, 2004
Published online: Feb 1, 2005
Published in print: Feb 2005
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.