Models for Traffic Assignment to Transportation Networks

  • Ennio Cascetta
Part of the Applied Optimization book series (APOP, volume 49)


Models for traffic assignment to transportation networks simulate how demand and supply interact in transportation systems. These models allow the calculation of performance measures and user flows for each supply element (network link), resulting from origin-destination demand flows, path choice behavior, and the reciprocal interactions between supply and demand. Assignment models combine the supply and demand models described in the previous chapters; for this reason they are also referred to as demand-supply interaction models. In fact, as seen in Chapter 4, path choices and flows depend on path generalized costs, futhermore demand flows are generally influenced by path costs in choice dimensions such as mode and destination. Also, as seen in Chapter 2, link and path performance measures and costs may depend on flows due to congestion. There is therefore a circular dependence between demand, flows, and costs, which is represented in assignment models as can be seen in Fig. 5.1.1.


Assignment Model Path Cost User Equilibrium Link Cost Traffic Assignment 
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.

Reference Notes

  1. [234]
    Sheffi Y. (1985). Urban transportation networks. Prentice Hall, Englewood Cliff, NJ.Google Scholar
  2. [241]
    Thomas R. (1991). Traffic Assignment Techniques. Avebury Technical, England.Google Scholar
  3. [220]
    Patriksson M. (1994). The Traffic Assignment Problem: Model and Methods. VSP, Utrecht, The Netherlands.Google Scholar
  4. [52]
    Cantarella G.E., and E. Cascetta (1998). Stochastic Assignment to Transportation Networks: Models and Algorithms. In Equilibrium and Advanced Transportation Modelling, P. Marcotte, S.Nguyen (editors): 87107. ( Proceedings of the International Colloquium, Montreal, Canada October, 1996 ).Google Scholar
  5. [13]
    Beckman M., C.B. McGuire, and Winsten C.B. (1956). Studies in the economics of transportation Yale University Press, New Haven, CT.Google Scholar
  6. [251]
    Wardrop J.G. (1952). Some Theoretical Aspects of Road Traffic Research Proc. Inst. Civ. Eng. 2: 325–378.Google Scholar
  7. [92]
    Dafermos S.C. (1971). An extended traffic assignment model with applications to two-way traffic Transportation Science 5: 366–389.Google Scholar
  8. [93]
    Dafermos S.C. (1972). The Traffic Assignment Problem for Multi-Class User Transportation Networks Transportation Science 6: 73–87.Google Scholar
  9. [94]
    Dafermos S.C. (1980). Traffic Equilibrium and Variational Inequalities Transportation Science 14: 42–54.Google Scholar
  10. [95]
    Dafermos S.C. (1982). The general multimodal network equilibrium problem with elastic demand Networks 12: 57–72.Google Scholar
  11. [239]
    Smith M.J. (1979). The Existence, Uniqueness and Stability of Traffic Equilibrium Transportation Research 13B: 295–304.Google Scholar
  12. [135]
    Hearn D.W., S. Lawphongpanich, and S. Nguyen (1984). Convex Programming Formulation of the Asymmetric Traffic Assignment Problem. Transportation Research 18B: 357–365.Google Scholar
  13. [28]
    Bernstein D. and Smith T. E. (1994). Equilibria for Networks with Lower Semicontinuous Costs: With an Application to Congestion Pricing. Transportation Science 28: 221–235.MathSciNetzbMATHCrossRefGoogle Scholar
  14. [201]
    Nguyen S., and S. Pallottino (1986). Assegnazione dei passeggeri ad un sistema di linee urbane: determinazione degli ipercammini minimi. Ricerca Operativa 39: 207–230.Google Scholar
  15. [173]
    M. Florian, and Spiess H. (1989). Optimal strategies: a new assignment model for transit networks. Transportation Research 23B: 82–102.Google Scholar
  16. [199]
    Nguyen S. and S. Pallottino (1988). Equilibrium Traffic Assignment for Large Scale Transit Networks. European Journal of Operational Research 37: 176–186.Google Scholar
  17. [264]
    Wu J. H., and M. Florian (1993). A Simplicial Decomposition Method for the Transit Equilibrium Assignment Problem,Annals of Operations Research.Google Scholar
  18. [38]
    Bouzaiene-Ayari B., M. Gendreau, and S. Nguyen (1995). “On the Modelling of Bus Stops in Transit Networks”, Centre de recherche sur les transports, Université de Montréal.Google Scholar
  19. [36]
    Bouzaiene-Ayari B., Gendreau M., and Nguyen S. (1997). “Transit Equilibrium assignment Problem: A Fixed-Point Simplicial -Decomposition Solution Algorithm”, Operations Research.Google Scholar
  20. [115]
    Fisk C. (1980) Some Developments In Equilibrium Traffic Assignment Methodology Transportation Research B: 243–255.Google Scholar
  21. [101]
    Daganzo C.F., and Y. Sheffi (1982). Unconstrained Extremal formulation of Some Transportation Equilibrium Problems. Transportation Science 16: 332–360.Google Scholar
  22. [30]
    Bifulco G.N. (1993). A stochastic user equilibrium assignment model for the evaluation of parking policies EJOR 71: 269–287.Google Scholar
  23. [203]
    Nguyen S., S. Pallottino, and M. Gendreau (1993). Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks Publication CRT 84.Google Scholar
  24. [96]
    Daganzo C. (1983). Stochastic Network equilibrium problem with multiple vehicle types and asiymmetric, indefinite link cost jacobians Transportation Science 17: 282–300.Google Scholar
  25. [58]
    Cascetta E. (1987) Static and dynamic models of stochastic assignment to transportation networks in Flow control of congested networks (Szaego G., Bianco L., Odoni A. ed. ), Springer Verlag, Berlin.Google Scholar
  26. [49]
    Cantarella G.E. (1997). A General Fixed-Point Approach to Multi-Mode Multi-User Equilibrium Assignment with Elastic Demand Transportation Science 31: 107–128.Google Scholar
  27. [190]
    Mirchandani P., and H. Soroush (1987). Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions. Transportation Science 21: 133–152.Google Scholar
  28. [204]
    Nielsen O. A. (1997). On The Distributions Of The Stochastic Components In SUE Traffic Assignment Models, In Proceedings of 25th European Transport Forum Annual Meeting, Seminar F On Transportation Planning Methods, Volume I I.Google Scholar
  29. [54]
    Cantarella G.E., and M. Binetti (2000). Stochastic Assignment with Gamma Distributed Perceived Costs. Proceedings of the 6th Meeting of the EURO Working Group on Transportation. Gothenburg, and Sweden, and September 1998, forthcoming.Google Scholar
  30. [254]
    Watling D.P. (1999). Stability of the stochastic equilibrium assignment problem: a dynamical systems approach Transportation Research 33B: 281312.Google Scholar
  31. [114]
    Ferrari P. (1997). The Meaning of Capacity Constraint Multipliers in The Theory of Road Network Equilibrium Rendiconti del circolo matematico di Palermo, Italy, 48: 107–120.Google Scholar
  32. [14]
    Bell M. (1995). Stochastic user equilibrium assignment in networks with queues Transportation Research 29B: 125–137.Google Scholar
  33. [167]
    Leurent F. (1993). Cost versus Time Equilibrium over a Network Eur. J. of Operations Research 71: 205–221.Google Scholar
  34. [168]
    Leurent, F. (1995). The practice of a dual criteria assignment model with continuously distributed values-of-time. In Proceedings of the 23`d European Transport Forum: Transportation Planning Methods, E, 117–128 PTRC, London.Google Scholar
  35. [169]
    Leurent, F. (1996). The Theory and Practice of a Dual Criteria Assignment Model with a Continuously Distributed Value-of-Time. In Transportation and Traffic Theory, J.B. Lesort ed., 455–477, Pergamon, Exeter, England.Google Scholar
  36. [1831.
    Marcotte P. and D. Zhu (1996). An Efficient Algorithm for a Bicriterion Traffic Assignment Problem. In Advanced Methods in Transportation Analysis, L.Bianco, P.Toth eds., 63–73, Springer-Verlag, Berlin.Google Scholar
  37. [108]
    Dial R.B. (1996). Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms Transportation Science 30/2: 93–111.Google Scholar
  38. [53]
    Cantarella G.E., and M. Binetti (1998). Stochastic Equilibrium Traffic Assignment with Value-of-Time Distributed Among User In International Transactions of Operational Research 5: 541–553.Google Scholar
  39. [100]
    Daganzo C.F., and Y. Sheffi (1977) On stochastic models of traffic assignment Transportation Science 11: 253–274.Google Scholar
  40. [143]
    Horowitz J.L. (1984). The stability of stochastic equilibrium in a two link transportation network Transportation Research 18B: 13–28.Google Scholar
  41. [59]
    Cascetta E. (1989) A stochastic process approach to the analysis of temporal dynamics in transportation networks Transportation Research 23B: 1–17.Google Scholar
  42. [105]
    Davis G.A. N.L. Nihan (1993). Large population approximations of a general stochastic traffic assignment model Operations Research 41: 169178.Google Scholar
  43. [253]
    Watling D.P. (1996). Asymmetric problems and stochastic process models of traffic assignment Transportation Research 30B: 339–357.Google Scholar
  44. [51]
    Cantarella G.E., and E. Cascetta (1995). Dynamic Processes and Equilibrium in Transportation Networks: Towards a Undying Theory. Transportation Science 29: 305–329.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Ennio Cascetta
    • 1
  1. 1.Dipartimento di Ingegneria dei Trasporti “Luigi Tocchetti”Università degli Studi di Napoli “Federico II”NapoliItaly

Personalised recommendations