Sensitivity Analysis of Traffic Equilibria

Published Online:https://doi.org/10.1287/trsc.1030.0043

References

  • Beckmann M., McGuire C. B., Winsten C. B.Studies in the Economics of Transportation (1956) (Yale University Press, New Haven, CT) Google Scholar
  • Bell M. G. H., Iida Y.Transportation Network Analysis (1997) (Chichester, U.K.)CrossrefGoogle Scholar
  • Bertsekas D. P.Nonlinear Programming (1995) (Athena Scientific, Belmont, MA) Google Scholar
  • Bonnans J. F., Shapiro A.Perturbation Analysis of Optimization Problems (2000) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Bonnans J. F., Cominetti R., Shapiro A. Sensitivity analysis of optimization problems under second order regular constraints. Math. Oper. Res. (1998) 23:806–831LinkGoogle Scholar
  • Braess D. Über ein Paradox der Verkehrsplannung. Unternehmensforchung (1968) 12:258–268Google Scholar
  • Chiou S. W. Optimization of area traffic control for equilibrium network flows. Transportation Sci. (1999) 33:279–289LinkGoogle Scholar
  • Cho H.-J., Smith T. E., Friesz T. L. A reduction method for local sensitivity analyses of network equilibrium arc flows. Transportation Res. (2000) 34B:31–51CrossrefGoogle Scholar
  • Clarke F. H.Optimization and Nonsmooth Analysis (1983) (John Wiley & Sons, New York) . (Corrected version reprinted in the Classics in Applied Mathematics series, Vol. 5. SIAM, Philadelphia, PA 1990)Google Scholar
  • Codina E., Barceló J. Adjustment of O-D trip matrices from observed volumes: An algorithmic approach based on conjugate directions. (2001) . Report, Statistics and Operations Research Department, Polytechnic University of Catalonia, Barcelona, SpainGoogle Scholar
  • Dafermos S., Nagurney A. On some traffic equilibrium theory paradoxes. Transportation Res. (1984a) 18B:101–110CrossrefGoogle Scholar
  • Dafermos S., Nagurney A. Sensitivity analysis for the asymmetric network equilibrium problem. Math. Programming (1984b) 28:174–184CrossrefGoogle Scholar
  • Dafermos S., Nagurney A., Volmuller J., Hamerslag R. Stability and sensitivity analysis for the general network equilibrium-travel choice model. (1984c) Proc. 9th Internat. Sympos. Transportation Traffic TheoryJuly 11–13, 1984Delft, The Netherlands(VNU Science Press, Utrecht, The Netherlands) 217–231Google Scholar
  • Davis G. A. Exact solution of the continuous network design problem via stochastic user equilibrium assignment. Transportation Res. (1994) 28B:61–75CrossrefGoogle Scholar
  • Dempe S., Vogel S. The subdifferential of the optimal solution in parametric optimization. (1997) . Technical report, Fachbereich Mathematik, Technische Universität Chemnitz, Chemnitz, GermanyGoogle Scholar
  • Denault L. Étude de deux méthods d'adjustement de matrices origine-destination à partir des flots des véhicules observés. (1994) (Centre de recherche sur les transports, Université de Montréal, Montréal, Canada) . Ph.D. thesisGoogle Scholar
  • Dontchev A. L., Rockafellar R. T., Fiacco A. V. Characterizations of Lipschitzian stability in nonlinear programming. Mathematical Programming with Data Perturbations (1998) (Marcel Dekker, Inc., New York) 65–82Google Scholar
  • Dontchev A. L., Rockafellar R. T. Ample parameterization of variational inclusions. SIAM J. Optim. (2002) 12:170–187CrossrefGoogle Scholar
  • Drissi-Kaïtouni O., Lundgren J. T. Bilevel origin-destination matrix estimation using a descent approach. (1992) . Report LiTH-MAT-R-1992-49, Department of Mathematics, Linköping Institute of Technology, Linköping, SwedenGoogle Scholar
  • Erlander S., Stewart N. F.The Gravity Model in Transportation Analysis: Theory and Extensions, Topics in Transportation (1990) 3(VSP, Utrecht, The Netherlands) Google Scholar
  • Fang S.-C. Fixed point models for equilibrium problems on transportation networks. (1980) . Report 80-7, Department of Mathematics, University of Maryland, College Park, MDGoogle Scholar
  • Fisk C. More paradoxes in the equilibrium assignment problem. Transportation Res. (1979) 13B:305–309CrossrefGoogle Scholar
  • Fisk C. S. Some developments in equilibrium traffic assignment. Transportation Res. (1980) 14B:243–255CrossrefGoogle Scholar
  • Hagstrom J. N. , Abrams R. A. Characterizing Braess paradox for traffic networks. Proc. IEEE 2001 Conf. Intelligent Transportation Systems:837–842Google Scholar
  • Hall M. A. Properties of the equilibrium state in transportation networks. Transportation Sci. (1978) 12:208–216LinkGoogle Scholar
  • Haraux A. How to differentiate the projection on a convex set in Hilbert space. Some applications to variational inequalities. J. Math. Soc. Japan (1977) 29:615–631CrossrefGoogle Scholar
  • Hearn D. W. Bounding flows in traffic assignment models. (1980) . Research Report 80-4, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FLGoogle Scholar
  • Hiriart-Urruty J.-B., Lemaréchal C.Convex Analysis and Minimization Algorithms, I & II (1993) Vols. 305–306(Springer-Verlag, Berlin, Germany) . Grundlehren der mathematischen WissenschaftenCrossrefGoogle Scholar
  • Janson B. N. Most likely origin-destination link uses from equilibrium assignment. Transportation Res. (1993) 27B:333–350CrossrefGoogle Scholar
  • Karamardian S. The nonlinear complementarity problem with applications, Part 1. J. Optim. Theory Appl. (1969) 4:87–98CrossrefGoogle Scholar
  • Karamardian S. The complementarity problem. Math. Programming (1972) 2:107–129CrossrefGoogle Scholar
  • Kim T. J., Suh S.Advanced Transport and Spatial Systems Models (1990) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Knödel W.Graphentheoretische Methoden und Ihre Anwendungen (1969) (Springer-Verlag, Berlin, Germany) CrossrefGoogle Scholar
  • Kyparisis J. Perturbed solution of variational inequality problems over polyhedral sets. J. Optim. Theory Appl. (1988) 66:121–135Google Scholar
  • Kyparisis J. Sensitivity analysis for variational inequalities and nonlinear complementarity problems. Ann. Oper. Res. (1990a) 27:143–174CrossrefGoogle Scholar
  • Kyparisis J. Solution differentiability for variational inequalities. Math. Programming (1990b) 48:285–301CrossrefGoogle Scholar
  • Larsson T., Patriksson M. Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transportation Sci. (1992) 26:4–17LinkGoogle Scholar
  • Larsson T., Patriksson M. An augmented Lagrangean dual algorithm for link capacity side constrained traffic assignment problems. Transportation Res. (1995) 29B:433–455CrossrefGoogle Scholar
  • Larsson T., Patriksson M. Side constrained traffic equilibrium models: Analysis, computation and applications. Transportation Res. (1999) 33B:233–264CrossrefGoogle Scholar
  • Larsson T., Lundgren J., Patriksson M., Rydergren C., Giannessi F., Maugeri A., Pardalos P. M. Most likely traffic equilibrium route flows: Analysis and computation. Equilibrium Problems: Nonsmooth Optimization and Variational Inequality Models. Proc. Internat. Workshop Memory Marino De Luca, Hotel Villa Diodoro, Taormina, Italy, December 3–5, 1998 (2001) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 129–159Google Scholar
  • Leurent F. Sensitivity and error analysis of the dual criteria traffic assignment model. Transportation Res. (1998) 32B:189–204CrossrefGoogle Scholar
  • Luo Z.-Q., Pang J.-S., Ralph D.Mathematical Programs with Equilibrium Constraints (1996) (Cambridge University Press, Cambridge, U.K.) CrossrefGoogle Scholar
  • Michalevich V. S., Gupal A. M., Norkin V. I.Methods of Nonconvex Optimization (1987) (Nauka, Moscow) . in RussianGoogle Scholar
  • Mifflin R. Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. (1977) 15:959–972CrossrefGoogle Scholar
  • Miyagi T., Suzuki T. A Ramsey price equilibrium model for urban transit systems: A bi-level programming approach with transportation network equilibrium constraints. (1995) 6th World Conf. Transportation Res.July 17–20Sydney, AustraliaGoogle Scholar
  • Nagurney A.Network Economics: A Variational Inequality Approach (2000) 2nd ed.(Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
  • Outrata J. V., Gritzmann P., Horst R., Sachs E., Tichatschke R. On a special class of mathematical programs with equilibrium constraints. Recent Advances Optim. Proc. 8th French-German Conf. Optimization, Trier, July 21–26, 1996. Lecture Notes Econom. Math. Systems (1997) 452(Springer-Verlag, Berlin, Germany) 246–260CrossrefGoogle Scholar
  • Outrata J., Kočvara M., Zowe J.Nonsmooth Approach to Optimization Problems with Equilibrium Constraints (1998) (Kluwer Academic Publishers, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Outrata J. V., Zowe J. A numerical approach to optimization problems with variational inequality constraints. Math. Programming (1995) 68:105–130CrossrefGoogle Scholar
  • Pang J.-S. Newton's methods for B-differentiable equations. Math. Oper. Res. (1990a) 15:311–341LinkGoogle Scholar
  • Pang J.-S. Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets. J. Optim. Theory Appl. (1990b) 66:121–135CrossrefGoogle Scholar
  • Patriksson M. The traffic assignment problem—Models and methods. Topics in Transportation (1994) (VSP BV, Utrecht, The Netherlands) Google Scholar
  • Patriksson M., Rockafellar R. T. A mathematical model and descent algorithm for bilevel traffic management. Transportation Sci. (2002) 36:271–291LinkGoogle Scholar
  • Patriksson M., Rockafellar R. T. Sensitivity analysis of aggregated variational inequality problems, with application to traffic equilibria. Transportation Sci. (2003) 37:56–68LinkGoogle Scholar
  • Qiu Y., Magnanti T. L. Sensitivity analysis for variational inequalities defined on polyhedral sets. Math. Oper. Res. (1989) 14:410–432LinkGoogle Scholar
  • Robinson S. M. Strongly regular generalized equations. Math. Oper. Res. (1980) 5:43–62LinkGoogle Scholar
  • Robinson S. M. Implicit B-differentiability in generalized equations. (1985) . Technical Summary Report No. 2854, Mathematics Research Center, University of Wisconsin at Madison, Madison, WIGoogle Scholar
  • Robinson S. M. An implicit-function theorem for a class of nonsmooth functions. Math. Oper. Res. (1991) 16:292–309LinkGoogle Scholar
  • Rockafellar R. T., Wets R. J-B.Variational Analysis (1998) 317(Grundlehren der mathematischen Wissenschaften, Springer-Verlag, Berlin, Germany) CrossrefGoogle Scholar
  • Rossi T. F., McNeil S., Hendrickson C. Entropy model for consistent impact-fee assessment. J. Urban Planning Development (1989) ASCE 115:51–63CrossrefGoogle Scholar
  • Shapiro A. On concepts of directional differentiability. J. Optim. Theory Appl. (1990a) 66:477–487CrossrefGoogle Scholar
  • Shapiro A. Sensitivity analysis of nonlinear programs and differentiability properties of metric projections. SIAM J. Control Optim. (1990b) 26:628–645CrossrefGoogle Scholar
  • Shapiro A. Existence and differentiability of metric projections in Hilbert spaces. SIAM J. Optim. (1994) 4:130–141CrossrefGoogle Scholar
  • Spiess H. A gradient approach for the O-D matrix adjustment problem. (1990) . Publication CRT-693, Centre de Recherche sur les Transports, Université de Montréal, Montréal, CanadaGoogle Scholar
  • Steinberg R., Zangwill W. I. The prevalence of Braess's paradox. Transportation Sci. (1983) 17:301–318LinkGoogle Scholar
  • Tam M. L., Lam W. H. K. Maximum car ownership under constraints of road capacity and parking space. Transportation Res. (2000) 34A:145–170Google Scholar
  • Tobin R. L., Friesz T. L. Sensitivity analysis for equilibrium network flow. Transportation Sci. (1988) 22:242–250LinkGoogle Scholar
  • Wong S. C., Yang C., Lo H. K. A path-based traffic assignment algorithm based on the TRANSYT traffic model. Transportation Res. (2001) 35B:163–181CrossrefGoogle Scholar
  • Yang H. Heuristic algorithms for the bilevel origin-destination matrix estimation problems. Transportation Res. (1995) 29B:231–242CrossrefGoogle Scholar
  • Yang H., Bell M. G. H. Traffic restraint, road pricing and network equilibrium. Transportation Res. (1997) 31B:303–314CrossrefGoogle Scholar
  • Yang H., Lam W. H. K. Optimal road tolls under conditions of queueing and congestion. Transportation Res. (1996) 30A:319–332Google Scholar
  • Yang H., Yagar S. Traffic assignment and signal control in saturated road networks. Transportation Res. (1995) 29A:125–139Google Scholar
  • Yen N. D. Lipschitz continuity of solutions of variational inequalities with a parametric polyhedral constraint. Math. Oper. Res. (1995) 20:695–708LinkGoogle Scholar
  • Ying J. Q., Miyagi T. Sensitivity analysis for stochastic user equilibrium network flows—A dual approach. Transportation Sci. (2001) 35:124–133LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.