Skip to main content
SpringerLink
Log in

Dynamic traffic assignment: Considerations on some deterministic modelling approaches

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Research on how to model the dynamic behaviour of traffic flows efficiently and the development of algorithms to handle such models numerically has become a key activity in recent years as a consequence of the emerging applications of advanced technologies to transport. This paper offers a critical review of some of the most relevant formulations of the dynamic assignment problem and algorithms arising from both discrete and continuous models, emphasizing the underlying modelling hypothesis. Comments are made on the crucial underlying discussion on the basic implicit or explicit hypothesis and extensions to Wardrop's principle and the corresponding equilibrium concept. Properties and shortcomings are described and commented on and in some cases illustrated with simple examples. The paper ends with a description of a recent continuous modelling proposal that seems to overcome one of the reported major shortcomings: the FIFO discipline observance of traffic flows. A set of concluding remarks and a comprehensive bibliography close the paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H.Z. Aashtiani and T.L. Magnanti, Equilibria on a congested transportation network, SIAM J. Algebraic and Discrete Methods 2(1981)213–226.

    Google Scholar 

  2. J.D. Addison and B.G. Heydecker, Traffic models for dynamic assignment, Paper presented at the2nd International Capri Seminar on Urban Traffic Networks, Capri (July 1992).

  3. D.A. Anderson, J.C. Tannehill and R.H. Pletcher,Computational Fluid Mechanics and Heat Transfer (Hemisphere Publishing Corporation, 1984).

  4. D. Bernstein, T.L. Friesz, R.L. Tobin and B.W. Wie, A variational control formulation of the simultaneous route and departure-time choice equilibrium problem,Transportation and Traffic Theory, ed. C.F. Daganzo (Elsevier Science, 1993).

  5. P.L. Belcher and I. Catling, Electronic route guidance by AUTOGUIDE: The London demonstration, Traffic Engineering and Control 28(1987)586–592.

    Google Scholar 

  6. L.D. Berkovitz, On control problems with bounded state variables, Journal of Mathematical Analysis and Applications 5(1962)488–498.

    Google Scholar 

  7. L.D. Berkovitz and S. Dreyfus, The equivalence of some necessary conditions for optimal control in problems with bounded state variables, Journal of Mathematical Analysis and Applications 10(1965)275–283.

    Google Scholar 

  8. D.P. Bertsekas, Projected Newton methods for optimization problems with simple constraints, SIAM J. Control and Optimization 20(1982)221–246.

    Google Scholar 

  9. D.E. Boyce, B. Ran and L.J. LeBlanc, Solving an instantaneous dynamic user-optimal traffic assignment model, Urban Transportation Center, University of Illinois at Chicago, ADVANCE Working Paper Series N.11 (1992).

  10. A.E. Bryson,Applied Optimal Control (Wiley, New York, 1975).

    Google Scholar 

  11. C. Carathéodory,Calculus of Variations and Partial Differential Equations of the First Order (Chelsea, New York, 1956).

    Google Scholar 

  12. M. Carey, A constraint qualification for a dynamic traffic assignment model, Transportation Science 20(1986)55–58.

    Google Scholar 

  13. M. Carey, Optimal time-varying flows on congested networks, Operations Research 35(1987).

  14. M. Carey, Nonconvexity of the dynamic assignment problem, Transportation Research B26(1991) 127–133.

    Google Scholar 

  15. C. Charbonnier, J.L. Farges and J.J. Henry, Models and strategies for dynamic route guidance, Part C: Optimal control approach,Proceedings DRIVE Conference, Brussels (1991) pp. 106–112.

  16. E. Codina and J. Barceló, An algorithm for extremals calculation in optimal control problems with applications to the dynamic traffic assignment problem, Universitat Politècnica de Catalunya, Departamento de Estadística e Investigación Operativa, Document de Recerca DR 92-07 (1992).

  17. E. Codina and J. Barceló, Cálculo de extremales para el problema de asignación Dinámica de Tráfico, Presented at theI Simposium sobre Ingenieráa de los Transportes, Sevilla, Spain (1993).

  18. E. Codina and J. Barceló, Extremals calculation for the dynamic traffic assignment problem, Presented at the39th North American Meeting of the RSAI, Chicago, USA (1992).

  19. E. Codina, Un algoritmo para problemas de control optimo y su aplicación a la asignación Dinámica de Tráfico, Tesis Doctoral, Universitat Politècnica de Catalunya, Departamento de Estadística e Investigación Operativa (1993).

  20. E. Codina and J. Barceló, A system optimal dynamic traffic assignment model with distributed parameters, Presented at theTRISTAN II Conference, Capri (1994).

  21. R. Courant, K. Friedrichs and H. Lewy, Über die Partiellen Differenzengleichungen der Mathemathischen Physik, Mathematische Annalen 100(1928)32–74.

    Google Scholar 

  22. S.C. Dafermos and F.T. Sparrow, The traffic assignment problem for a general network, J. Res. Nat. Bur. Stand. 73B(1969)91–118.

    Google Scholar 

  23. Ph. Dehaux and Ph. Toint, Some comments on dynamic traffic modelling in the presence of advanced driver information systems,Proceedings of the DRIVE Conference on Advanced Telematics in Road Transport (North-Holland, 1991).

  24. O. Drissi-Kaïtouni, A variational inequality formulation of the dynamic traffic assignment, Centre de Recherche sur les Transports, Université de Montréal, Publication No. 735 (1990).

  25. O. Drissi-Kaïtouni and M. Gendreau, A new dynamic traffic assignment model, Centre de Recherche sur les Transports, Université de Montréal, Publication No. 854 (1992).

  26. O. Drissi-Kaïtouni and A. Hameda-Benchekroun, A dynamic traffic assignment model and a solution algorithm, Transportation Science 26 (1992).

  27. R. Fletcher,Practical Methods of Optimization. Vol. 2: Constrained Optimization (Wiley, 1981).

  28. A. Fiacco,Introduction to Sensitivity and Stability Analysis in Non Linear Programming (Academic Press, 1983).

  29. W.H. Fleming and R.W. Rishel,Deterministic and Stochastic Optimal Control (Springer, New York/Heidelberg/Berlin, 1975).

    Google Scholar 

  30. M. Florian, Nonlinear cost network models in transportation analysis, Mathematical Programming Study 26(1986)167–196.

    Google Scholar 

  31. L.R. Ford and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, NJ, 1962).

    Google Scholar 

  32. M. Frank and P. Wolfe, An algorithm for quadratic programming, Naval Research Logistics Quarterly 3(1956)95–110.

    Google Scholar 

  33. T.L. Friesz, Transportation network equilibrium, design and aggregation: Key development and research opportunities, Transportation Research 19A(1985)413–427.

    Google Scholar 

  34. T.L. Friesz, F.J. Luque, R.L. Tobin and B.W. Wie, Dynamic network traffic assignment considered as a continuous time optimal control problem, Operations Research 37(1989)58–69.

    Google Scholar 

  35. T.L. Friesz, D. Bernstein, T.E. Smith, R.L. Tobin and B.W. Wie, A variational inequality formulation of the dynamic network user equilibrium problem, Operations Research 41(1993).

  36. D.R. Fulkerson, Studies in graph theory, Part I, Studies in Mathematics 11 (1975).

  37. M.O. Ghali and M.J. Smith, Dynamic road pricing and dynamic traffic assignment for congested large networks, Presented at the39th North American Meeting of the RSAI, Chicago (November, 1992).

  38. M.O. Ghali and M.J. Smith, A model for the dynamic system optimum traffic assignment problem,71st Annual Meeting of the Transportation Research Board, Washington (1992).

  39. P.E. Gill, W. Murray and M. Wright,Practical Optimization (Academic Press, 1981).

  40. S.K. Godunov,Ecuaciones de la Física Matemática (Mir, Moscow, 1978).

  41. R. Hamerslag, Dynamic assignment in the three dimensional timespace, Transportation Research Record 1220 (1989).

  42. P. Harker and J. Pang, Finite-dimensional variational inequality and linear complementary problems: A survey of theory, algorithms and applications, Mathematical Programming 48(1990)161–220.

    Google Scholar 

  43. D.W. Hearn, S. Lawphongpanich and J.A. Ventura, Restricted simplicial decomposition: computation and extensions, Mathematical Programming Study 31(1987)99–118.

    Google Scholar 

  44. D.W. Hearn, S. Lawphongpanich and J.A. Ventura, Optimization algorithms for congested network models, Industrial and Systems Engineering Department, University of Florida, Research Report 87-3 (1987).

  45. D.W. Hearn and S. Lawphongpanich, A dual ascent algorithm for traffic assignment problems, Conference Paper presented at theJoint Seminar on Urban Traffic Networks: Dynamic Control and Flow Equilibrium, Capri, Italy (1989).

  46. J.K. Ho and A.S. Manne, Nested decomposition for dynamic models, Mathematical Programming 6(1974)121–140.

    Google Scholar 

  47. J.K. Ho, A successive linear optimization approach to the dynamic traffic assignment problem, Transportation Science 14(1980)295–305.

    Google Scholar 

  48. J.K. Ho, Solving the dynamic traffic assignment problem on a hypercube multicomputer, Transportation Research 24B(1990)6.

    Google Scholar 

  49. B. Hohenbalken, Simplicial decomposition in nonlinear programming algorithms, Mathematical Programming 13(1977)49–68.

    Google Scholar 

  50. D.H. Jacobson, M.M. Lele and J.L. Speyer, New necessary conditions of optimality for control problems with state-variable inequality constraints, Journal of Mathematical Analisys and Applications 35(1971)255–284.

    Google Scholar 

  51. B.N. Janson, Dynamic traffic assignment for urban road networks, Transportation Research 25B(1989)143–161.

    Google Scholar 

  52. D. Jeffery, Route guidance and in-vehicle information systems, in:Information Technology Applications in Transport (VNU Science, Utrecht, 1987) pp. 319–351.

    Google Scholar 

  53. S. Lawphongpanich and D.W. Hearn, Restricted simplicial decomposition with application to the traffic assignment problem, Ricerca Operativa 38 (1986).

  54. G. Leitman,The Calculus of Variations and Optimal Control. An Introduction (Plenum Press, New York/London, 1981).

    Google Scholar 

  55. F.J. Luque and T.L. Friesz, Dynamic traffic assignment considered as a continuous time optimal control problem, Presented at theTIMS/ORSA Joint National Meeting, Washington, DC (1980).

  56. D.K. Merchant and G.L. Nemhauser, A model and an algorithm for the dynamic traffic assignment problems, Transportation Science 12 (1978).

  57. D.L. Merchant and G.L. Nemhauser, Optimal conditions for dynamic traffic assignment model, Transportation Science 12 (1978).

  58. F.H. Moss and A. Segall, An optimal control approach to dynamic routing in networks, IEEE Transactions on Automatic Control AC-27 (1982).

  59. B.A. Murtagh and M.A. Saunders,MINOS 5.1 User's Guide, Technical Report SOL 83.20R (revised Jan. 1987).

  60. S. Pallotino, Shortest-path methods: Complexity, interrelations and new propositions, Networks 14(1984)257–267.

    Google Scholar 

  61. M. Papageorgiou, Dynamic modeling, assignment, and route guidance in traffic networks, Transportation Research 24B(1989)471–495 (1990).

    Google Scholar 

  62. L.S. Pontryagin, R.V. Boltyanskii, R.V. Gamkrelidze and E.F. Mishchenko,The Mathematical Theory of Optimal Processes (Interscience, New York, 1962).

    Google Scholar 

  63. B. Ran, D.E. Boyce and L.J. LeBlanc, An instantaneous dynamic user-optimal traffic assignment model and solution algorithm, submitted to the special issue of Operations Research on Stochastic and Dynamic Models in Transportation, Paper Series (August 1, 1990, revised February 1992).

  64. B. Ran, D.E. Boyce and L.J. LeBlanc, Dynamic user-optimal traffic assignment: A new model and solution technique, Presented at the1st Triennial Symposium on Transportation Analysis, Montréal, Canada (1991).

  65. B. Ran, T. Shimazaki and D.E. Boyce, A dynamic user equilibrium traffic assignment model and its extensions: The optimal control approach, Working Paper (1989).

  66. B. Ran, E.B. David and L.J. LeBlanc, A new class of instantaneous dynamic user-optimal traffic assignment models, Operations Research 41 (1993).

  67. P.E. Sarachik and U. Ozgüner, On decentralized dynamic routing for congested traffic networks, IEEE Transactions on Automatic Control AC-27 (1982).

  68. I.H. Shames,Fluid Mechanics (MacGraw-Hill, 1962).

  69. G.D. Smith,Numerical Solutions of Partial Differential Equations: Finite Difference Methods, 3rd ed., Oxford Applied Mathematics and Computing Science Series (1985).

  70. M.J. Smith, A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks, Transportation Research 27B(1993) 49–63.

    Google Scholar 

  71. J.A. Ventura and D.W. Hearn, Restricted simplicial decomposition for symmetric convex cost flow problems, Working Paper No. 8710905, Industrial and Systems Engineering Department, University of Florida, Gainesville (1987).

    Google Scholar 

  72. P.C. Vythoulkas, A dynamic stochastic assignment model for the analysis of general networks, Transportation Research 24B(1989)453–469.

    Google Scholar 

  73. J.G. Wardrop, Some theoretical aspects of road traffic research, Proceedings of the Institute of Civil Engineers, Part II, 1(1952)325–378.

    Google Scholar 

  74. D. Watling and T. Van Vuren, The modelling of guidance systems, Transportation Research 1C(1993)159–182.

    Google Scholar 

  75. B.W. Wie, T.L. Friesz and R.L. Tobin, Dynamic user optimal traffic assignment on congested multidestination networks, Transportation Research 24B (1990).

  76. D.A. Wissmer (ed.),Optimization Methods for Large Scale Systems ... with Applications (MacGraw-Hill, 1971).

  77. W.I. Zangwill,Nonlinear Programming: A Unified Approach (Prentice-Hall, Englewood Cliffs, NJ, 1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics and Operational Research, Faculty of Mathematics and Statistics, Universitat Politècnica de Catalunya, Pau Gargallo 5, E-08028, Barcelond, Spain

    E. Codina & J. Barceló

Authors
  1. E. Codina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Barceló
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Codina, E., Barceló, J. Dynamic traffic assignment: Considerations on some deterministic modelling approaches. Ann Oper Res 60, 1–58 (1995). https://doi.org/10.1007/BF02031939

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02031939

Keywords

Search

Navigation