Abstract
This paper explores some critical issues in modeling network traffic flow for predictive user optimal dynamic traffic assignment. They include the role of FIFO (first-in-first-out) in link, path and network traffic dynamics, minimal set representation of link traffic evolution, and consistency conditions for link models. It is found that (1) link FIFO plays a central role in modeling link, path and network traffic flow evolution, and (2) the dimension of a minimal state set that adequately describes link traffic flow under FIFO is two. Moreover, two sufficient FIFO conditions are provided, and pitfalls in using these conditions to enforce FIFO are pointed out. Finally, ramifications of these findings to DTA modeling are also discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Astarita, V. (1996). “A continuous Time Link Model for Dynamic Network Loading Based on Travel Time Function.” In J-B Lesort (ed.), Transport and Traffic Theory, pp. 79–102.
Carey, M. (1986). “A Constraint Qualification for a Dynamic Traffic Assignment Problem.” Transpn. Sci. 20(1), 55–58.
Carey, M. (1987). “Optimal Time-Varying Flows on Congested Networks.” Ops. Res. 35, 58–69.
Carey, M. (1992). “Nonconvexity of the Dynamic Traffic Assignment Problem.” Transp. Res. B 26, 127–133.
Daganzo, C.F. (1994). “The Ccell Transmission Model: A Simple Dynamic Representation of Highway Traffic Consistent with the Hydrodynamic Theory.” Transportation Research Part B 28, 269–287.
Daganzo, C.F. (1995a). “Properties of Link Travel Time Functions Under Dynamic Loads.” Trans. Res. B 29, 95–98.
Daganzo, C.F. (1995b). “The Cell Transmission Model, Part II: Network Traffic.” Transpn. Res. B 29B(2), 79–93.
Friesz, T.L., J. Luque, R.L. Tobin, and B.W. Wei. (1989). “Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem.” Operations Research 37(6), 893–901.
Friesz, T.L., D.S. Bernstein, R.L. Tobin, and B.W. Wei. (1993). “A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem.” Operations Research 41, 179–191.
Janson, B.N. (1991). “Dyanmic Traffic Assignment for Urban Road Networks.” Transportation Research Part B 25, 143–161.
Lo, H.K. (1999). “A Dynamic Traffic Assignment Formulation that Encapsulates the Cell Transmission Model.” In A. Cedar (ed.), Transportation and Traffic Theory, Elsevier Science, pp. 327–350.
Mahmassani, H.S. and Hu, d R. Jayakrishnan. (1992). “Dynamic Traffic Assignment and Simulation for Advanced Network Informatics (DYNASMART).” In Proc. of the 2rd international Capri Seminar on Urban Traffic Networks, Capri, Italy.
Merchant, D.K. and G.L. Nemhauser. (1978a). “Optimality Conditions for a Dynamic Traffic Assignment Model.” Transpn. Sci. 12, 183–199.
Merchant, D.K. and G.L. Nemhauser. (1978b). “A Model and an Algorithm for the Dynamic Traffic Assignment Problems.” Transpn. Sci. 12, 200–207.
Nagurney, A. (1993). Network Economics: A Variational Inequality Approach. Norwell, MA: Kluwer Academic Publishers.
Nie, X. and H.M. Zhang. (2002a). “The Delay-Function-Based Link Model: Its Properties and Computational Issues.” To appear in Transportation Research.
Nie, X. and H.M. Zhang. (2002b). “A Comparative Study of Some Macroscopic Link Models Used in Dynamic Traffic Assignement.” Networks and Spatial Economics 5:(1).
Ran, B. and D.E. Boyce. (1996). “A Link-Based Variational Inequality Formulation of Ideal Dynamic User-Optimal Route Choice Problem.” Transportation Research Part C 4, 1–12.
Smith, M.J. (1993). “A New Dynamic Traffic Model and the Existence and Calculation of Dynamic User Equilibria on Congested Capacity-Constrained Road Networks.” Transportation Research Part B 27(1), 49–63.
Tong, C.O. and S.C. Wong. (2000). “A Predictive Dynamic Traffic Assignment Model in Congested Capacity-Constrained Road Networks.” Transportation Research Part B 34, 625–644.
Wie, B.W., T.L. Friesz, and R.L. Tobin. (1990). “Dynamic User Optimal Traffic Assignment on Congested Multi-Destination Networks.” Transportation Research B 24, 431–442.
Wu, J.H., Y. Chen, and M. Florian. (1998). “The Continuous Dynamic Network Loading Problem: A Mathematical Formulation and Solution Method.” Transpn. Res. B. 32, 173–187.
Xu, Y.W., J.H. Wu, M. Florian, P. Marcotte, and D.L. Zhu. (1999). “A Predictive Dynamic Traffic Assignment Model in Congested Capacity-Constrained Road Network.” Transportation Science 33, 341–353.
Zhu, D.L. and Patrice Marcotte. (2000). “On the Existence of Solutions to the Dynamic User Equilibrium Problem.” Transportation Science 34, 402–414.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, H.M., Nie, X. Some Consistency Conditions for Dynamic Traffic Assignment Problems. Netw Spat Econ 5, 71–87 (2005). https://doi.org/10.1007/s11067-005-6662-7
Issue Date:
DOI: https://doi.org/10.1007/s11067-005-6662-7