Dynamic User Equilibrium
Dynamic traffic assignment (DTA) is the positive (descriptive) modeling of time-varying flows of automobiles on road networks consistent with established traffic flow theory and travel demand theory. Dynamic user equilibrium (DUE) is one type of DTA wherein the effective unit travel delay, including early and late arrival penalties, of travel for the same purpose is identical for all utilized path and departure time pairs. In the context of planning, DUE is usually modelled for the within-day time scale based on demands established on a day-to-day time scale.
KeywordsVariational Inequality Delay Operator User Equilibrium Transportation Research Part Dynamic Traffic Assignment
Unable to display preview. Download preview PDF.
List of References Cited and Additional Reading
- Adamo, V., V. Astarita, M. Florian, M. Mahut, and J. H. Wu (1998). A framework for introducing spillback in link-based dynamic network loading models. presented at tristan iii, san juan, puerto rico, june.Google Scholar
- Astarita, V. (1995). Flow propagation description in dynamic network loading models. Y.J Stephanedes, F. Filippi, (Eds). Proceedings of IV international conference of Applications of Advanced Technology in Transportation(AATT), 599–603.Google Scholar
- Bernstein, D., T. L. Friesz, R. L. Tobin, and B. W. Wie (1993). A variational control formulation of the simultaneous route and departure-time equilibrium problem. Proceedings of the International Symposium on Transportation and Traffic Theory, 107–126.Google Scholar
- Carey, M. (1992). Nonconvexity of the dynamic traffic assignment problem. Transportation Research 26B(2), 127–132.Google Scholar
- Carey, M. (1995). Dynamic congestion pricing and the price of fifo. In N. H. Gartner and G. Improta (Eds.), Urban Traffic Networks, pp. 335–350. New York: Springer-Verlag.Google Scholar
- Friesz, T., C. Kwon, and D. Bernstein (2007). Analytical dynamic traffic assignment models. In D. A. Hensher and K. J. Button (Eds.), Handbook of Transport Modelling (2nd ed.). New York: Pergamon.Google Scholar
- Friesz, T., R. Tobin, D. Bernstein, and Z. Suo (1995). Proper flow propagation constraints which obviate exit functions in dynamic traffic assignment. INFORMS Spring National Meeting, Los Angeles, April 23 26.Google Scholar
- Halmos, P. (1974). Measure Theory. New York: Springer-Verlag.Google Scholar
- Nie, Y. and H. M. Zhang (2010). Solving the dynamic user optimal assignment problem considering queue spillback. Networks and Spatial Economics 10(2), 1 – 23.Google Scholar
- Ran, B. and D. Boyce (1996). Modeling Dynamic Transportation Networks: An Intelligent Transportation System Oriented Approach. New York: Springer-Verlag.Google Scholar
- Tobin, R. (1993). Notes on flow propagation constraints. Working Paper 93-10, Network Analysis Laboratory, George Mason University.Google Scholar