Skip to main content
Log in

Continuous and Discrete Trajectory Models for Dynamic Traffic Assignment

  • Published:
Networks and Spatial Economics Aims and scope Submit manuscript

Abstract

A continuous trajectory model is presented in which transportation networks are represented as topological constructs. The general formulation enhances existing analytic dynamic traffic assignment models by incorporating continuous single-link traffic flow models in a general, coherent, and relatively intuitive manner. Specific exact formulation based on a simplified kinematic wave traffic flow model with physical queues is presented as well.

A discrete trajectory model is proposed as an approximation of the continuous model. The discrete model provides wide flexibility in choosing the level of aggregation with respect to time intervals, ranging from several hours, as typical in current practice of long-term travel forecasting models, to one second or less, as in microscopic simulations. An algorithm to find discrete approximate solutions is presented as well as accuracy measures to evaluate them. The effect of time resolution on model performance is examined by a numerical example.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Boyce, W.E. and R.C. DiPrima. (1992). Elementary Differential Equations, 5th edition. New-York: John Wiley & Sons.

    Google Scholar 

  • Carey, M. (2001). “Dynamic Traffic Assignment with More Flexible Modelling Within Links.” Networks and Spatial Economics 1, 349–375.

    Google Scholar 

  • Daganzo, C.F. (1994). “The Cell Transmission Model: A Dynamic Representation of Highway Traffic Consistent with the Hydrodynamic Theory.” Transportation Research 28B, 269–287.

    Google Scholar 

  • Daganzo, C.F. (1995a). “The Cell Transmission Model, Part II: Network Traffic.” Transportation Research 29B, 79–93.

    Google Scholar 

  • Daganzo, C.F. (1995b). “Properties of Link Travel Time Functions Under Dynamic Loads.” Transportation Research 29B, 95–98.

    Google Scholar 

  • Friesz, L.T., D. Bernstein, T.E. Smith, R.L. Tobin, and B.W. Wie. (1993). “A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem.” Operations Research 41, 179–191.

    Google Scholar 

  • Friesz, L.T., D. Bernstein, Z. Suo, and R.L. Tobin. (2001). “Dynamic Network User Equilibrium with State-Dependent Time Lags.” Networks and Spatial Economics 1, 319–347.

    Google Scholar 

  • Jayakrishnan, R., H.S. Mahmassani, and T.Y. Hu. (1994). “An Evaluation Tool for Advanced Traffic Information and Management Systems in Urban Networks.” Transportation Research 3C, 129–147.

    Google Scholar 

  • Kuhne, R. and P. Michalopoulos. (1992). “Continuum Flow Models.” Chapter 5 in Traffic Flow Theory–-A State-of-the-Art Report, ORNL & TRB.

  • Kuwahara, M. and T. Akamatsu. (2001). “Dynamic User Optimal Assignment with Physical Queues for Many-to-Many OD Pattern.” Transportation Research 35B, 461–479.

    Google Scholar 

  • Lighthill, J.M. and J.B. Whitham. (1955). “On Kinematic Waves: II, A Theory of Traffic Flow in Long Crowded Roads.” Proceedings of the Royal Society 229A, 316–345.

    Google Scholar 

  • Lo, H.K. and W.Y. Szeto. (2002). “A Cell-Based Variational Inequality Formulation of the Dynamic User Optimal Assignment Problem.” Transportation Research 36B, 421–443.

    Google Scholar 

  • Mahut, M. (2000). “A Discrete Flow Model for Dynamic Network Loading.” Ph.D. thesis, Departement d’informatique et recherche operationnelle, Universite de Montreal, Canada.

  • Newell, G.F. (1993a). “A Simplified Theory of Kinematic Waves in Highway Traffic, Part I: General Theory.” Transportation Research 27B, 281–287.

    Google Scholar 

  • Newell, G.F. (1993b). “A Simplified Theory of Kinematic Waves in Highway Traffic, Part II: Queuing at Freeway Bottlenecks.” Transportation Research 27B, 289–303.

    Google Scholar 

  • Newell, G.F. (1993c). “A Simplified Theory of Kinematic Waves in Highway Traffic, Part III: Multi-Destination Flows.” Transportation Research 27B, 305–313.

    Google Scholar 

  • Ran, B. and D. Boyce. (1996). Modeling Dynamic Transportation Networks, 2nd edition. Berlin: Springer-Verlag.

    Google Scholar 

  • Richards, P.I. (1956). “Shock Waves on the Highways.” Operations Research 4, 42–51.

    Google Scholar 

  • Wu, J.H., Y. Chen, and M. Florian. (1998). “The Continuous Dynamic Network Loading Problem: A Mathematical Formulation and Solution Method.” Transportation Research 32B, 173–187.

    Google Scholar 

  • Xu, Y.W., J.H. Wu, M. Florian, P. Marcote, and D.L. Zhu. (1999). “Advances in the Continuous Dynamic Network Loading Problem.” Transportation Science 33, 341–353.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hillel Bar-Gera.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bar-Gera, H. Continuous and Discrete Trajectory Models for Dynamic Traffic Assignment. Netw Spat Econ 5, 41–70 (2005). https://doi.org/10.1007/s11067-005-6661-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11067-005-6661-8

Keywords

Navigation