Static and Dynamic Models of Stochastic Assignment to Transportation Networks

  • Ennio Cascetta
Part of the NATO ASI Series book series (volume 38)


Assignment models can be seen as correspondences or mappings associating link flows to a given (constant) travel demand and transportation network through a model of users’behaviour. Assignment models can be classified as deterministic or stochastic depending on the assumptions made on users’ perception of costs.


Travel Cost Transportation Network Assignment Model Path Cost Link Cost 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Cascetta, E. (1986) A Stochastic process approach to the analysis of temporal dynamics in transportation networks, Dept. of Transp. Engineering Univ. of Neaples, Intern. Report and sent for pubblication to Transp. Res.,Google Scholar
  2. Cascetta, E. and Nuzzolo, A. (1986) An empirical analysis of assignment models for urban car networks, Dept. of Transp. Eng. University of Neaples, Internal Report, sent to the IX Int. Symp. on Transportation and Traffic Theory, Cambridge MA,Google Scholar
  3. Daganzo, C.F. and Sheffi, Y. (1977) On stochastic models of traffic assignment, Transp. Sci. 11, 253–274,CrossRefGoogle Scholar
  4. Daganzo, C.F. (1979) Multinomial Probit: the theory and its application to demand forecasting. Academic Press, New York,MATHGoogle Scholar
  5. Daganzo, C.F. (1982) Unconstrained extremal formulation of some transportation equilibrium problems. Transp. Sci. 16, 332–360,MathSciNetCrossRefGoogle Scholar
  6. Dial, R.B. (1971) A probabilistic multipath traffic assignment model which obviates path enumeration. Transp. Sci. 5, 83–111,Google Scholar
  7. Domencich, T.A. and McFadden, D. (1975) Urban travel demand: a behavioural analysis, American Elsevier, New York,Google Scholar
  8. Fisk, C. (1980) Some developments in equilibrium traffic assignment, Transp. Res. 14(B), 243–255,MathSciNetCrossRefGoogle Scholar
  9. Florian, M. and Fox, B. (1976) On the probabilistic origin of Dial’s multipath traffic assignment model. Transp. Res. 10, 339–341,CrossRefGoogle Scholar
  10. Nguyen, S. and Cascetta, E. (1986) Estimating Trip matrices from traffic counts: theory and applications, Proc. of the 1st International Course in Planning and Management of urban transp. systems, Montreal,Google Scholar
  11. Powell, W.B. and Sheffi, Y. (1982) The convergence of equilibrium algorithms with predetermined step sizes, Transp. Sci. 16, 45–55,MathSciNetCrossRefGoogle Scholar
  12. Sheffi, Y. (1985) Urban transportation networks, Prentice Hall, Englewood Cliff. N. 5.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Ennio Cascetta
    • 1
  1. 1.Department of Transportation EngineeringUniversity of NeaplesNapoliItaly

Personalised recommendations