Summary
The paper by Tobin and Friesz [ToF88] brought the classic nonlinear programming subject of sensitivity analysis to transportation science. It is still the most widely used device by which “gradients” of traffic equilibrium solutions (that is, flows and/or demands) are calculated, for use in bilevel transportation planning applications such as network design, origin-destination (OD) matrix estimation and problems where link tolls are imposed on the users in order to reach a traffic management objective. However, it is not widely understood that the regularity conditions proposed by them are stronger than necessary. Also, users of their method sometimes misunderstand its limitations and are not aware of the computational advantages offered by more recent methods. In fact, a more often applicable formula was proposed already in 1989 by Qiu and Magnanti [QiM89], and Bell and Iida [BeI97] describe one of the cases in practice in which the formula by Tobin and Friesz [ToF88] would not be able to generate sensitivity information, because one of their regularity conditions fails to hold.
This paper provides a short overview of a sensitivity formula that provides directional derivatives of traffic equilibrium flows, route and link costs, and demands, exactly when they exist, and which are found in [PaR03] and [Pat04], For the simplicity of the presentation, we provide the analysis for the simplest cases, where the link travel cost and demand functions are separable, so that we can work with optimization formulations; this specialization was first given in [JoP04]. The connection between directional derivatives and the gradient is that exactly when the directional derivative mapping of the traffic equilibrium solution is linear in the parameter, the solution is differentiable.
The paper then provides an overview of the formula of Tobin and Friesz [ToF88], and illustrates by means of examples that there are several cases where it is not applicable: First, the requirement that the equilibrium solution be strictly complementary is too strong—differentiate points may not be strictly complementary. Second, the special matrix invertibility condition implies a strong requirement on the topology of the traffic network being analyzed and which may not hold in practice, as noted by Bell and Iida [BeI97](page 97); moreover, the matrix condition may fail to hold at differentiable points.
The findings of this paper are hoped to motivate replacing the previous approach with the more often applicable one, not only because of this fact but equally importantly because it is intuitive and also can be much more efficiently utilized: the sensitivity problem that provides the directional derivative is a linearized traffic equilibrium problem, and the sensitivity information can be generated efficiently by only slightly modifying a state-of-the-art traffic equilibrium solver. This is essential for bringing the use of sensitivity analysis in transportation planning beyond the solution of only small problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bell, M.G.H., Iida, Y.: Transportation Network Analysis. John Wiley & Sons, Chichester, UK (1997)
Braess, D.: Über ein Paradox der Verkehrsplannung. Unternehmensforchung, 12, 258–268 (1968)
Burke, J.V., Ferris, M.C.: Characterization of solution sets of convex programs. Operations Research Letters, 10, 57–60 (1991)
Cho, H.-J., Smith, T.E., Friesz, T.L.: A reduction method for local sensitivity analyses of network equilibrium arc flows. Transportation Research, 34B, 31–51 (2000)
Denault, L.: Étude de deux méthods d’adjustement de matrices originadestination à partir des flots des véhicules observés, PhD thesis, Centre de recherche sur les transports, Université de Montréal, Montreal, Canada (1994)
Dontchev, A.L., Rockafellar, R.T.: Ample parameterization of variational inclusions. SIAM Journal on Optimization, 12, 170–187 (2001)
Gartner, N.H.: Optimal traffic assignment with elastic demands: A review. Part II: Algorithmic approaches. Transportation Science, 14, 192–208 (1980)
Josefsson, M.: Sensitivity analysis of traffic equilibria. Master’s thesis, Department of mathematics, Chalmers University of Technology, Gothenburg (2003)
Josefsson, M., Patriksson, M.: Sensitivity analysis of separable traffic equilibrium equilibria, with application to bilevel optimization in network design. report, Department of mathematics, Chalmers University of Technology, Gothenburg (2003). Revised (2004) for Transportation Research, B.
Kyparisis, J.: Perturbed solution of variational inequality problems over polyhedral sets. Journal of Optimization Theory and Applications, 66, 121–135 (1988)
Kyparisis, J.: Solution differentiability for variational inequalities. Mathematical Programming, 48, 285–301 (1990)
Larsson, T., Patriksson, M.: Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transportation Science, 26, 4–17 (1992)
Luo, Z.Q., Pang, J.-S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge, UK (1996)
Patriksson, M.: The Traffic Assignment Problem—Models and Methods. Topics in Transportation, VSP BV, Utrecht, The Netherlands (1994)
Patriksson, M.: Sensitivity analysis of traffic equilibria. Transportation Science, 38, 258–281 (2004)
Patriksson, M.: Traffic Equilibrium Problems: Analysis, Applications, and Optimization Algorithms. Springer-Verlag (under preparation).
Patriksson, M., Rockafellar, R.T.: A mathematical model and descent algorithm for bilevel traffic management. Transportation Science, 36, 271–291 (2002)
Patriksson, M., Rockafellar, R.T.: Sensitivity analysis of variational inequalities over aggregated polyhedra, with application to traffic equilibria. Transportation Science, 37, 56–68 (2003)
Qiu, Y., Magnanti, T.L.: Sensitivity analysis for variational inequalities defined on polyhedral sets. Mathematics of Operations Research, 14, 410–432 (1989)
Robinson, S.M.: Strongly regular generalized equations. Mathematics of Operations Research, 5, 43–62 (1980)
Robinson, S.M.: Implicit B-differentiability in generalized equations. Technical Summary Report No. 2854, Mathematics Research Center, University of Wisconsin at Madison, Madison, WI (1985)
Tobin, R.L., Friesz, T.L.: Sensitivity analysis for equilibrium network flow. Transportation Science, 22, 242–250 (1988)
Yen, N.D.: Lipschitz continuity of solutions of variational inequalities with a parametric polyhedral constraint. Mathematics of Operations Research, 20, 695–708 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science and Business Media, Inc.
About this chapter
Cite this chapter
Josefsson, M., Patriksson, M. (2006). On the Applicability of Sensitivity Analysis Formulas for Traffic Equilibrium Models. In: Lawphongpanich, S., Hearn, D.W., Smith, M.J. (eds) Mathematical and Computational Models for Congestion Charging. Applied Optimization, vol 101. Springer, Boston, MA. https://doi.org/10.1007/0-387-29645-X_6
Download citation
DOI: https://doi.org/10.1007/0-387-29645-X_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-29644-9
Online ISBN: 978-0-387-29645-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)