Abstract
The purpose of this paper is to illustrate the effects on estimated traffic flow of different traffic models in solving the dynamic traffic assignment problem. We will compare two distinct traffic models, the kinematic wave model and the flow model. We will show that the model’s resulting estimates differ substantially. The kinematic wave model is regarded as the more realistic of the two but it is difficult to work with, requiring large computational effort, while the flow model is less realistic but is computationally more tractable. The flow model has been adopted widely in the development of existing dynamic traffic assignment techniques (Wie, Friesz and Tobin, 1990; Ho, 1990, Vythoulkas, 1990a; 1990b; Carey, 1986; 1987; 1988). According to this model, the outflow from each link is a function of the mean density on the whole link.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Carey, M. (1986) “A constraint qualification for a dynamic traffic assignment model”, Transportation Science, 20, 55–8.
Carey, M. (1987) “Optimal time-varying flows on congested networks”, Operations Research, 35, 58–69.
Carey, M. (1988) “Some problems in modelling dynamic traffic assignment”, Paper presented to the ORSA/TIMS Joint Meeting, Washington DC.
Ho, J.K. (1990) “Solving the dynamic traffic assignment problem on a hypercube multicomputer”, Transportation Research, 24B, 443–51.
Hurewicz, W. (1958) “Lectures on Ordinary Differential Equations”, The M.I.T. Press.
Makigami, Y., Nakanishi, T., Toyama, M. and Mizote, R. (1981) “On a Simulation for the Traffic Stream on the Freeway Merging Area”, Eighth International Symposium on Transportation and Traffic Theory, 163–173.
Newell, G.F. (1988) “Traffic Flow for the morning commute” Transportation Science, 22, 47–58.
Newell, G.F. (1991) “A simplified Theory of Kinematic Waves. I General Theory”, Research Report UCB-ITS-RR-91–12. Institute Of Transportation Studies, University of California at Berkley.
Vythoulkas, P.C. (1990a) “A dynamic stochastic assignment model for the analysis of general networks”, Transportation Research, 24B, 453–69.
Vythoulkas, P.C. (1990b) “Two models for predicting dynamic stochastic equilibria in urban transportation networks”, In: Transportation and Traffic Theory (ed M. Koshi). New York: Elsevier, 253–72.
Wie, B.-K., Friesz, T.L. and Tobin, R.L. (1990) “Dynamic user optimal traffic assignment on congested multidestination Networks”, Transportation Research, 24B, 431–42.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Addison, J.D., Heydecker, B.G. (1995). Traffic Models for Dynamic Assignment. In: Gartner, N.H., Improta, G. (eds) Urban Traffic Networks. Transportation Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79641-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-79641-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-79643-2
Online ISBN: 978-3-642-79641-8
eBook Packages: Springer Book Archive