Traffic Assignment: A Survey of Mathematical Models and Techniques

  • Pushkin Kachroo
  • Kaan M. A. Özbay
Part of the Advances in Industrial Control book series (AIC)


This chapter presents the fundamentals of the theory and techniques of traffic assignment problem. It first presents the steady-state traffic assignment problem formulation which is also called static assignment, followed by Dynamic Traffic Assignment (DTA), where the traffic demand on the network is time varying. The static assignment problem is shown in a mathematical programming setting for two different objectives to be satisfied. The first one where all users experience same travel times in alternate used routes is called user-equilibrium and another setting called system optimum in which the assignment attempts to minimize the total travel time. The alternate formulation uses variational inequality method which is also presented. Dynamic travel routing problem is also reviewed in the variational inequality setting. DTA problem is shown in discrete and continuous time in terms of lumped parameters as well as in a macroscopic setting, where partial differential equations are used for the link traffic dynamics. A Hamilton–Jacobi- based travel time dynamics model is also presented for the links and routes, which is integrated with the macroscopic traffic dynamics. Simulation-based DTA method is also very briefly reviewed. This chapter is taken from the following Springer publication and is reproduced here, with permission and with minor changes: Pushkin Kachroo, and Neveen Shlayan, “Dynamic traffic assignment: A survey of mathematical models and technique,” Advances in Dynamic Network Modeling in Complex Transportation Systems (Editor: Satish V. Ukkusuri and Kaan Özbay) Springer New York, 2013. 1-25.


  1. 1.
    Gazis DC (1974) Traffic science. Wiley-Interscience Inc, New York, NYzbMATHGoogle Scholar
  2. 2.
    Potts RB, Oliver RM (1972) Flows in transportation networks. Elsevier ScienceGoogle Scholar
  3. 3.
    Stouffer SA (1940) Intervening opportunities: a theory relating mobility and distance. Am Sociol Rev 5:845–867CrossRefGoogle Scholar
  4. 4.
    Hitchcock FL (1941) The distribution of a product from several sources to numerous localities. J Math Phys 20:224–230MathSciNetCrossRefGoogle Scholar
  5. 5.
    Voorhees AM (2013) A general theory of traffic movement 40:1105–1116.
  6. 6.
    Wilson AG (1967) A statistical theory of spatial distribution models. Transp Res 1:253–269CrossRefGoogle Scholar
  7. 7.
    Ben-Akiva ME, Lerman SR (1985) Discrete choice analysis: theory and application to travel demand. MIT Press series in transportation studies, MIT PressGoogle Scholar
  8. 8.
    Wardrop JG (1952) Some theoretical aspects of road traffic research. Proc Inst Civil Eng PART II 1:325–378Google Scholar
  9. 9.
    Sheffi Y (1985) Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice-HallGoogle Scholar
  10. 10.
    Peeta S, Ziliaskopoulos AK (2001) Foundations of dynamic traffic assignment: the past, the present and the future. Netw Spat Econ 1(3/4):233–265CrossRefGoogle Scholar
  11. 11.
    Kachroo P, Sastry S (2016a) Travel time dynamics for intelligent transportation systems: theory and applications. IEEE Trans Intell Transp Syst 17(2):385–394CrossRefGoogle Scholar
  12. 12.
    Kachroo P, Sastry S (2016b) Traffic assignment using a density-based travel-time function for intelligent transportation systems. IEEE Trans Intell Transp Syst 17(5):1438–1447CrossRefGoogle Scholar
  13. 13.
    Dafermos SC, Sparrow FT (1969) The traffic assignment problem for a general network. J Res Natl Bur Stan 73B:91–118MathSciNetCrossRefGoogle Scholar
  14. 14.
    Beckmann MJ, McGuire CB, Winsten CB (1955) Studies in the economics of transportation. Technical report, Rand CorporationGoogle Scholar
  15. 15.
    Dafermos S (1980) Traffic equilibrium and variational inequalities. Transp Sci 14:42–54MathSciNetCrossRefGoogle Scholar
  16. 16.
    Dafermos S (1983) An iterative scheme for variational inequalities. Math Prog 26:40–47MathSciNetCrossRefGoogle Scholar
  17. 17.
    Kinderlehrer D, Stampacchia G (2000) An introduction to variational inequalities and their applications, vol 31. Society for Industrial MathematicsGoogle Scholar
  18. 18.
    Avriel M (2003) Nonlinear programming: analysis and methods. Dover PublicationsGoogle Scholar
  19. 19.
    Bazaraa MS, Sherali HD, Shetty CM (2006) Nonlinear programming: theory and algorithms. John Wiley & SonsGoogle Scholar
  20. 20.
    Mangasarian OL (1994) Nonlinear programming, vol 10. Society for Industrial Mathematics.
  21. 21.
    Nugurney A (2000) Sustainable transportation networks. Edward Elgar Publishing, Northampton, MAGoogle Scholar
  22. 22.
    Facchinei F, Pang JS (2007) Finite-dimensional variational inequalities and complementarity problems. Springer Science & Business MediaGoogle Scholar
  23. 23.
    Nagurney A, Zhang D (2012) Projected dynamical systems and variational inequalities with applications, vol 2. Springer Science & Business MediaGoogle Scholar
  24. 24.
    Zhang D, Nagurney A (1995) On the stability of projected dynamical systems. J Optim Theory Appl 85(1):97–124MathSciNetCrossRefGoogle Scholar
  25. 25.
    Nagurney A, Zhang D (1997) Projected dynamical systems in the formulation, stability analysis, and computation of fixed-demand traffic network equilibria. Transp Sci 31(2):147–158CrossRefGoogle Scholar
  26. 26.
    Zhang D, Nagurney A (1996) On the local and global stability of a travel route choice adjustment process. Transp Res Part B: Methodol 30(4):245–262CrossRefGoogle Scholar
  27. 27.
    Dafermos S (1988) Sensitivity analysis in variational inequalities. Math Oper Res 13:421–434MathSciNetCrossRefGoogle Scholar
  28. 28.
    Dupuis P, Nagurney A (1993) Dynamical systems and variational inequalities. Ann Oper Res 44(1):7–42MathSciNetCrossRefGoogle Scholar
  29. 29.
    Skorokhod AV (1961) Stochastic equations for diffusion processes in a bounded region. Theory Probab Appl 6:264–274MathSciNetCrossRefGoogle Scholar
  30. 30.
    Chiu Y-C, Bottom J, Mahut M, Paz A, Balakrishna R, Waller T, Hicks J (2010) A primer for dynamic traffic assignment. Trans Res Board, 2–3Google Scholar
  31. 31.
    Ran B, Boyce DE (1996) Modeling dynamic transportation networks: an intelligent transportation system oriented approach. SpringerCrossRefGoogle Scholar
  32. 32.
    Friesz TL (2001) Special issue on dynamic traffic assignment. Netw Spat Econ Part I 1:231CrossRefGoogle Scholar
  33. 33.
    Merchant DK, Nemhauser GL (1978a) A model and an algorithm for the dynamic traffic assignment problems. Transp Sci 12(3):183–199CrossRefGoogle Scholar
  34. 34.
    Merchant DK, Nemhauser GL (1978b) Optimality conditions for a dynamic traffic assignment model. Transp Sci 12(3):183–199CrossRefGoogle Scholar
  35. 35.
    Boyce D, Lee D, Ran B (2001) Analytical models of the dynamic traffic assignment problem. Netw Spat Econ 1:377–390CrossRefGoogle Scholar
  36. 36.
    Friesz TL, Luque J, Tobin RL, Wie BW (1989) Dynamic network traffic assignment considered as a continuous time optimal control problem. Oper Res 37:893–901MathSciNetCrossRefGoogle Scholar
  37. 37.
    Friesz TL, Bernstein D, Smith TE, Tobin RL, Wie BW (1993) A variational inequality formulation of the dynamic network user equilibrium problem. Oper Res 41:179–191MathSciNetCrossRefGoogle Scholar
  38. 38.
    Chen HK (2012) Dynamic travel choice models: a variational inequality approach. Springer Science & Business MediaGoogle Scholar
  39. 39.
    Carey M (1992) Nonconvexity of the dynamic traffic assignment problem. Transp Res Part B: Methodol 26(2):127–133MathSciNetCrossRefGoogle Scholar
  40. 40.
    Lighthill MJ, Whitham GB (1955) On kinematic waves II. A theory of traffic on long crowded roods. Proc Roy Soc London A Math Phys Sci 229:317–345.
  41. 41.
    Richards PI (1956) Shockwaves on the highway. Oper Res 4:42–51CrossRefGoogle Scholar
  42. 42.
    Greenshields B, Channing W, Miller H (1935) A study of traffic capacity. In: Highway Research Board Proceedings. National Research Council (USA), Highway Research BoardGoogle Scholar
  43. 43.
    LeVeque RJ (1990) Numerical methods for conservation laws. Birkhäuser VerlagCrossRefGoogle Scholar
  44. 44.
    Bressan A (2000) Hyperbolic systems of conservation laws: the one-dimensional Cauchy problem. Oxford University PressGoogle Scholar
  45. 45.
    Strub I, Bayen A (2006) Weak formulation of boundary conditions for scalar conservation laws: an application to highway modeling. Int J Robust Nonlinear Control 16:733–748CrossRefGoogle Scholar
  46. 46.
    Garavello M, Piccoli B (2006) Traffic flow on networks. American Institute of Mathematical Sciences, Ser Appl Maths 1:1–243Google Scholar
  47. 47.
    Holden H, Risebro NH (1995) A mathematical model of traffic flow on a network of unidirectional roads. SIAM J Math Anal 26:999–1017MathSciNetCrossRefGoogle Scholar
  48. 48.
    Lebacque JP (1996) The godunov scheme and what it means for first order traffic flow models. In: Transportation and Traffic Theory, Proceedings of The 13th International Symposium on Transportation and Traffic Theory, Lyon, France, pp 647–677Google Scholar
  49. 49.
    Coclite GM, Piccoli B (2002) Traffic flow on a road network. Arxiv preprint math/0202146Google Scholar
  50. 50.
    Garavello M, Piccoli B (2005) Source-destination flow on a road network. Commun Math Sci 3(3):261–283MathSciNetCrossRefGoogle Scholar
  51. 51.
    Gugat M, Herty M, Klar A, Leugering G (2005) Optimal control for traffic flow networks. J Optim theory Appl 126(3):589–616MathSciNetCrossRefGoogle Scholar
  52. 52.
    Lebacque JP, Khoshyaran MM (2002) First order macroscopic traffic flow models for networks in the context of dynamic assignment. In: Patriksson M, Labbé M (eds) Transportation, Planning: State of the Art. Springer US, Boston, MA, pp 119–140.
  53. 53.
    Buisson C, Lebacque JP, Lesort JB (1996) Strada, a discretized macroscopic model of vehicular traffic flow in complex networks based on the godunov scheme. In: CESA’96 IMACS Multiconference: computational engineering in systems applications, pp 976–981Google Scholar
  54. 54.
    Mahmassani HS, Hawas YE, Abdelghany K, Abdelfatah A, Chiu YC, Kang Y, Chang GL, Peeta S, Taylor R, Ziliaskopoulos A (1998) DYNASMART-X; Volume II: analytical and algorithmic aspects. Technical report ST067 85Google Scholar
  55. 55.
    Ben-Akiva M, Bierlaire M, Koutsopoulos H, Mishalani R (1998) DynaMIT: a simulation-based system for traffic prediction. In: DACCORS short term forecasting workshop, vol TRANSP-OR-CONF-2006-060Google Scholar
  56. 56.
    Kachroo P, Özbay K (2012) Feedback control theory for dynamic traffic assignment. Springer Science & Business MediaGoogle Scholar
  57. 57.
    Kachroo P, Özbay K (2011) Feedback ramp metering in intelligent transportation systems. Springer Science & Business MediaGoogle Scholar
  58. 58.
    Kachroo P, Özbay K (1998) Solution to the user equilibrium dynamic traffic routing problem using feedback linearization. Transp Res Part B: Methodol 32(5):343–360CrossRefGoogle Scholar
  59. 59.
    Kachroo P, Özbay K (2006) Modeling of network level system-optimal real-time dynamic traffic routing problem using nonlinear\(\text{ h }{\infty }\) feedback control theoretic approach. J Intell Transp Syst 10(4):159–171CrossRefGoogle Scholar
  60. 60.
    Kachroo P, Özbay K (2005) Feedback control solutions to network level user-equilibrium real-time dynamic traffic assignment problems. Netw Spat Econ 5(3):243–260CrossRefGoogle Scholar
  61. 61.
    Spiess H (1990) Conical volume-delay functions. Transp Sci 24(2):153–158Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Electrical and Computer EngineeringUniversity of NevadaLas VegasUSA
  2. 2.Department of Civil and Urban EngineeringNew York UniversityBrooklynUSA

Personalised recommendations