Abstract
We consider the asymmetric continuous traffic equilibrium network model with fixed demands where the travel cost on each link of the transportation network may depend on the flow on this as well as other links of the network and we perform stability and sensitivity analysis. Assuming that the travel cost functions are monotone we first show that the traffic equlibrium pattern depends continuously upon the assigned travel demands and travel cost functions. We then focus on the delicate question of predicting the direction of the change in the traffic pattern and the incurred travel costs resulting from changes in the travel cost functions and travel demands and attempt to elucidate certain counter intuitive phenomena such as ‘Braess' paradox’. Our analysis depends crucially on the fact that the governing equilibrium conditions can be formulated as a variational inequality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Abdulaal and L. J. LeBlanc, “Methods for combining model split and equilbrium assignment models,” Technical Report, Department of Operations Research, Southern Methodist University, Dallas, Texas, 1979).
D.P. Bertsekas and E. Gafni, “Projection methods for variational inequalities and application to the traffic assignment problem,”Mathematical Programming Study 17 (1982) 139–159.
J.D. Bolland, M.D. Hall and D. van Vliet, “Saturn: A model for the evaluation of traffic assignment schemes,” Working paper no. 106, Institute for Transport Studies, University of Leeds, Leeds, England, 1979).
D. Braess, “Uber ein Paradoxon der Verkehrsplanung,”Unternehmensforschung 12 (1968) 258–268.
S. Dafermos, “The traffic assignment problem for transportation networks”Transportation Science 6 (1972) 73–87.
S. Dafermos, “Traffic equilibrium and variational inequalities,”Transportation Science 14 (1980) 42–54.
S. Dafermos, “An iterative scheme for variational inequalities”,Mathematical Programming 26 (1983) 40–47.
S. Dafermos and A. Nagurney, “Sensitivirty analysis for the general spatial economics equilibrium problem” LCDS No. 82-16, Division of Applied Mathematics, Brown University, (Providence, RI 1982). To appear inOperations Research.
C. Fisk, “More paradoxes in the equilibrium assignment problem,”Transportation Research 13B (1979) 305–309.
M. Frank, “The Braess paradox,”Mathematical Programming 20 (1981) 283–302.
K. Georg, “An application of simplicial algorithms to variational inequalities, approximation of fixed points and functional differential inequalitiies,” in: H.O. Peitgen and H.O. Walther, eds.,Lecture notes in mathematics 730 (Springer, Berlin, New York, 1979) pp. 126–135.
M.A. Hall, “Properties of the equilibrium state in transportation networks,”Transportation Science 12 (1978) 208–216.
P. Hartman and G. Stampacchia, “On some nonlinear elliptic differential functional equations,”Acta Mathematica Uppsala 115 (1966) 271–310.
J.D. Murchland, “Braess' paradox of traffic flow,”Transportation Research 4 (1970) 391–394.
A.B. Nagurney, “Comparative tests of multimodal traffic equilibrium methods,” LCDS, Division of applied mathematics, Brown University (Providence, RI 1982).
J.S. Pang and D. Chan, “Iterative methods for variational and complementarity problems,”Mathematical Programming 24 (1982) 284–313.
M.J. Smith, “The existence, uniqueness, and stability of traffic equilibria,”Transportation Research 13B (1979), 295–304.
R. Steinberg and W. Zangwill, “The prevalence of Braess' paradox,” preprint, Graduate School of Business, University of Chicago, (Chicago, Illinois, 1981).
N.F. Stewart, “Equilibrium vs. sytem optimal flow: some examples,”Transportation Research 14A (1980) 81–84.
L.T. Watson, “Computational experience with the Chow-Yorke algorithm,”Mathematical Programming 19 (1980) 92–101.
Author information
Authors and Affiliations
Additional information
This work was supported by the Program of University Research, U.S. Department of Transportation (Project number DTRS 5680-C-00007).
Rights and permissions
About this article
Cite this article
Dafermos, S., Nagurney, A. Sensitivity analysis for the asymmetric network equilibrium problem. Mathematical Programming 28, 174–184 (1984). https://doi.org/10.1007/BF02612357
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02612357