A Dynamic User Equilibrium Model for Traffic Assignment in Urban Areas

  • Luce Brotcorne
  • Daniel De Wolf
  • Michel Gendreau
  • Martine Labbé
Part of the Applied Optimization book series (APOP, volume 63)


In this paper, we present a model for dynamic traffic assignment in urban transportation networks. The transportation demand is given by the number of users traveling from the same origin to the same destination and having the same desired arrival time. The model determines for each user both the path and the departure time so that he cannot decrease his disutility by unilaterally changing his departure time or/and his path. The disutility measure is given by a generalized travel time function taking into account total path travel time and schedule delays. Departure time choices are restricted to a finite set of instants, but users with same choice of departure time and same first arc on selected path are loaded uniformly on the network during a time interval whose lower bound is the chosen departure time. A finite dimensional variational inequality formulation of the problem is given and the existence of a dynamic user equilibrium is proved. A heuristic method is proposed to compute a dynamic user equilibrium. Numerical results are provided.


Variational Inequality Departure Time User Equilibrium Traffic Assignment Dynamic 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.


  1. Bernstein D., Friesz T.L., Tobin R.L. and Wie B.W. (1993). “A variational control formulation of the simultaneous route and departure-time choice equilibrium problem”, Transportation and Traffic Theory, 107–126.Google Scholar
  2. Branston D. (1975). “Link Capacity Functions: A Review”, Transportation Research, 10, 223–236.CrossRefGoogle Scholar
  3. Brotcorne L. (1998). Approches opérationnelles et stratégiques des problèmes de trafic routier, Doctoral dissertation, Université Libre de Bruxelles.Google Scholar
  4. de Palma A. and Hansen P. (1990). “Optimum departure times for commuters in congested networks”, Annals of Operations Research, 25, 279–290.CrossRefGoogle Scholar
  5. de Palma A., Hansen P. and Labbé M. (1990b). “Commuters paths with penalties for early or later arrival time”, Transportation Science 24, 276–286.CrossRefGoogle Scholar
  6. Friesz T.L., Bernstein D., Smith T.E., Tobin R.L. and Wie B.W. (1993). “A variational inequality formulation of the dynamic network user equilibrium problem”, Operational Research, 41, 179–191.CrossRefGoogle Scholar
  7. Friesz T.L., Bernstein D. and Stough R. (1996), “Dynamic systems, variational inequalities and control theoretic models for predicting time-varying urban network flows”, Transportation Science, 30, 14–31.CrossRefGoogle Scholar
  8. Gendreau M. and Bouzaiene-Ayari B. (1997). “A discrete-time macroscopic dynamic traffic assignment model”, Publication CRT 96–31, Centre de recherche sur les transports, Université de Montréal.Google Scholar
  9. Janson B.N. (1993). “Dynamic traffic assignment with schedule delays”, presented at: The 72nd Annual Meeting of the Transportation Research Board, Washington DC.Google Scholar
  10. Jayakrishnan R., Wei K. Tsai and Chen A. (1995). “A dynamic traffic assignment model with traffic-flow relationships”, Transportation Research, 3C, 51–72.CrossRefGoogle Scholar
  11. Leblanc L.J., Hegalson R.V. and Boyce D.E. (1985). “Improved efficiency of the Franck-Wolfe algorithm for convex network programs”, Transportation Science, 19, 445–461.CrossRefGoogle Scholar
  12. Harker P.T. and Pang J.-S. (1990). “Finite-Dimensional Variational Inequality and Nonlinear Complementarity Problems: A Survey of Theory, Algorithms and aApplications”, Mathematical Programming, 48, 161–220.CrossRefGoogle Scholar
  13. Powell W. and Sheffi Y. (1982). “The convergence of equilibrium algorithms with predetermined step sizes”, Transportation Science, 16, 44–55.CrossRefGoogle Scholar
  14. Ran B., Boyce D.E and Leblanc L.J. (1992). “Dynamic user optimal departure time and route choice model: a bilevel, optimal-control formulation”, Advance Working Paper 12, University of Illinois at Chicago.Google Scholar
  15. Ran B. and Boyce D.E. (1994). “Combined departure time/route choice models”, in Dynamic urban transportation network models, Lecture Notes in Economics and Mathematical Systems 417, Springer Verlag.CrossRefGoogle Scholar
  16. Ran B., Hall R.W. and Boyce D.E. (1996). “A link-based variational inequality model for dynamic departure time/route choice”, Transportation Research, 30B, 31–46.CrossRefGoogle Scholar
  17. Small K. (1982). “The scheduling of consumer activities: work trips”, Am. Econ. Rev. 82, 467–479.Google Scholar
  18. Smith M.J. (1979). “The existence, uniqueness and stability of traffic equilibria”, Transportation Research, 13B, 295–304.Google Scholar
  19. Wie B.W., Tobin R.L., Friesz T.L. and Bernstein D. (1995). “A discrete nested cost operator approach to the dynamic network user equilibrium problem”, Transportation Science, 29, 79–92.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Luce Brotcorne
  • Daniel De Wolf
  • Michel Gendreau
  • Martine Labbé

There are no affiliations available

Personalised recommendations