Traffic Network Equilibrium

  • Anna Nagurney
Part of the Advances in Computational Economics book series (AICE, volume 10)


The problem of users of a congested transportation network seeking to determine their travel paths of minimal cost from origins to their respective destinations is a classical network equilibrium problem. It appears as early as 1920 in the work of Pigou, who considered a two-node, two-link (or path) transportation network, and was further developed by Knight (1924). In this problem setting, the demand side corresponds to potential travelers, or consumers, of the network, whereas the supply side is represented by the network itself, with prices corresponding to travel costs. The equilibrium occurs when the number of trips between an origin and a destination equals the travel demand given by the market price, that is, the travel time for the trips.


Variational Inequality Travel Cost Variational Inequality Problem Travel Demand Network Equilibrium 
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. Aashtiani, H. Z., and Magnanti, T. L., “Equilibria on a congested transportation network,” SIAM Journal on Algebraic and Discrete Methods 2 (1981) 213–226.CrossRefGoogle Scholar
  2. Aashtiani, H. Z., and Magnanti, T. L., “A linearization and decomposition algorithm for computing urban traffic equilibria,” in Proceedings of the IEEE Large Scale Systems Symposium, pp. 8–19, 1982.Google Scholar
  3. Beckmann, M., McGuire, C. B., and Winsten, C. B., Studies in the Economics of Transportation, Yale University Press, New Haven, Connecticut, 1956.Google Scholar
  4. Bergendorff, P. Hearn, D. W., and Ramana, M. V., “Congestion Toll Pricing of Traffic Networks,” in Network Optimization, Lecture Notes in Economics and Mathematical Systems 450, pp. 51–71, P. M. Pardalos, D, W. Hearn, and W. W. Hager, editors, Springer-Verlag, Berlin, Germany, 1997.Google Scholar
  5. Bertsekas, D. P., and Gafni, E. M., “Projection methods for variational inequalities with application to the traffic assignment problem,” Mathematical Programming 17 (1982) 139–159.CrossRefGoogle Scholar
  6. Bertsekas, D. P., and Gallager, R., Data Networks, second edition, Prentice - Hall, Englewood Cliffs, New Jersey, 1992.Google Scholar
  7. Boyce, D. E., “Urban transportation network-equilibrium and design models: recent achievements and future prospects,” Environment and Planning 16A (1984) 1445–1474.CrossRefGoogle Scholar
  8. Braess, D., “Uber ein paradoxon der verkehrsplanung,” Unternehmenforschung 12 (1968) 258–268.Google Scholar
  9. Dafermos, S. C., “Toll patterns for multiclass-user transportation networks,” Transportation Science 7 (1973) 211–223.CrossRefGoogle Scholar
  10. Dafermos, S., “Integrated equilibrium flow models for transportation planning,” in Traffic Equilibrium Methods, Lecture Notes in Economics and Mathematical Systems 118, pp. 106–118, M. A. Florian, editor, Springer-Verlag, New York, 1976.Google Scholar
  11. Dafermos, S., “Traffic equilibrium and variational inequalities,” Transportation Science 14 (1980) 42–54.CrossRefGoogle Scholar
  12. Dafermos, S., “The general multimodal network equilibrium problem with elastic demand,” Networks 12 (1982a) 57–72.CrossRefGoogle Scholar
  13. Dafermos, S., “Relaxation algorithms for the general asymmetric traffic equilibrium problem,” Transportation Science 16 (1982b) 231–240.CrossRefGoogle Scholar
  14. Dafermos, S., “Equilibria on nonlinear networks,” LCDS 86–1, Lefschetz Center for Dynamical Systems, Brown University, Providence, Rhode Island, 1986.Google Scholar
  15. Dafermos, S., and Nagurney, A., “On some traffic equilibrium theory paradoxes,” Transportation Research 18B (1984a) 101–110.CrossRefGoogle Scholar
  16. Dafermos, S., and Nagurney, A., “Stability and sensitivity analysis for the general network equilibrium-travel choice model,” in Proceedings of the 9th International Symposium on Transportation and Traffic Theory, pp. 217–234, J. Volmuller and R. Hamerslag, editors, VNU Science Press, Utrecht, The Netherlands, 1984b.Google Scholar
  17. Dafermos, S., and Nagurney, A., “Sensitivity analysis for the asymmetric network equilibrium problem,” Mathematical Programming 28 (1984c) 174–184.CrossRefGoogle Scholar
  18. Dafermos, S. C., and Sparrow, F. T., “The traffic assignment problem for a general network,” Journal of Research of the National Bureau of Standards 73B (1969) 91–118.Google Scholar
  19. Dupuis, P., and Nagurney, A., “Dynamical systems and variational inequalities,” Annals of Operations Research 44 (1993) 9–42.CrossRefGoogle Scholar
  20. Florian, M. (1977), “A traffic equilibrium model of travel by car and public transit modes,” Transportation Science 8 (1977) 166–179.CrossRefGoogle Scholar
  21. Florian, M., and Spiess, H., “The convergence of diagonalization algorithms for asymmetric network equilibrium problems,” Transportation Research 16B (1982) 477–483.Google Scholar
  22. Frank, M., “Obtaining network cost(s) from one link’s output,” Transportation Science 26 (1992) 27–35.CrossRefGoogle Scholar
  23. Friesz, T. L., “Transportation network equilibrium, design and aggregation: Key developments and research opportunities,” Transportation Research 19A (1985) 413–427.CrossRefGoogle Scholar
  24. Knight, F. H., “Some fallacies in the interpretations of social costs,” Quarterly Journal of Economics 38 (1924) 582–606.CrossRefGoogle Scholar
  25. Magnanti, T. L., “Models and algorithms for predicting urban traffic equilibria,” in Transportation Planning Models, pp. 153–185, M. Florian, editor, North-Holland, Amsterdam, The Netherlands, 1984.Google Scholar
  26. Mahmassani, H. S., and Mouskos, K. C., “Some numerical results on the diagonalization algorithm for network assignment with asymmetric interactions between cars and trucks,” Transportation Research 22B (1988) 275–290.Google Scholar
  27. Murchland, J. D., “Braess’s paradox of traffic flow,” Transportation Research 4 (1970) 391–394.CrossRefGoogle Scholar
  28. Nagurney, A., “Comparative tests of multimodal traffic equilibrium methods,” Transportation Research 18B (1984) 469–485.CrossRefGoogle Scholar
  29. Nagurney, A., “Computational comparisons of algorithms for general asymmetric traffic equilibrium problems with fixed and elastic demands,” Transportation Research 20B (1986) 78–84.Google Scholar
  30. Nagurney, A., and Zhang, D., Projected Dynamical Systems and Variational Inequalities with Applications, Kluwer Academic Publishers, Boston, Massachusetts, 1996.Google Scholar
  31. Patriksson, M., “Algorithms for urban traffic network equilibria,” Linkoping Studies in Science and Technology, Department of Mathematics, Thesis, no. 263,Linkoping University, Linkoping, Sweden, 1991.Google Scholar
  32. Pigou, A. C., The Economics of Welfare, MacMillan, London, England, 1920.Google Scholar
  33. Ran, B., and Boyce, D., Modeling Dynamic Transportation Networks, Springer-Verlag, Berlin, Germany, 1996.Google Scholar
  34. Samuelson, P. A., “Spatial price equilibrium and linear programming,” American Economic Review 42 (1952) 283–303.Google Scholar
  35. Sheffi, Y., Urban Transportation Networks — Equilibrium Analysis with Mathematical Programming Methods, Prentice-Hall, Englewood Cliffs, New Jersey, 1985.Google Scholar
  36. Smith, M. J., “Existence, uniqueness, and stability of traffic equilibria,” Transportation Research 13B (1979) 259–304.CrossRefGoogle Scholar
  37. Wardrop, J. G., “Some theoretical aspects of road traffic research,” in Proceedings of the Institute of Civil Engineers, Part II, pp. 325–378, 1952.Google Scholar
  38. Zhang, D., and Nagurney, A., “On the local and global stability of a travel route choice adjustment process,” Transportation Research 30B (1996) 245–262.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1999

Authors and Affiliations

  • Anna Nagurney
    • 1
  1. 1.University of MassachusettsAmherstUSA

Personalised recommendations