Sensitivity Analysis of Aggregated Variational Inequality Problems, with Application to Traffic Equilibria

Patriksson, Michael; Rockafellar, R. Tyrrell
February 2003
Transportation Science;Feb2003, Vol. 37 Issue 1, p56
Academic Journal
Some instances of variational inequality models over polyhedral sets can be stated in a disaggregated or aggregated formulation related by an affine variable transformation. For such problems, we establish that sensitivity analysis results under parameterizations rely neither on the strict monotonicity properties of the problem in terms of the disaggregated variables, nor on any particular choice of their values at the solution. We show how to utilize the affine transformation to devise computational tools for calculating sensitivity results and apply them to the sensitivity analysis of elastic demand traffic equilibrium problems. The results reached show that sensitivity results do not rely on the choice of any particular route or commodity flow solution. Further, the sensitivity analysis, including the calculation of the gradient of the equilibrium link flow if it exists, can be performed by means of solving linearized traffic equilibrium problems.


Related Articles

  • Savings Approach to the Multiple Terminal Delivery Problem. Matthäus, Fritz W. // Transportation Science;May76, Vol. 10 Issue 2, p216 

    For the solution of the multiple terminal delivery problem a formula for the actual savings is presented and a method of solution based on these actual savings is described. This method is simple both conceptually and computationally and gives results that appear to be `good.'

  • Bounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems. Daganzo, Carlos F.; Smilowitz, Karen R. // Transportation Science;Aug2004, Vol. 38 Issue 3, p343 

    Bounds and approximate formulae are developed for the average optimum distance of the transportation linear programming (TLP) problem with homogeneously, but randomly distributed points and demands in a region of arbitrary shape. It is shown that if the region size grows with a fixed density of...

  • Locating Active Sensors on Traffic Networks. Gentili, M.; Mirchandani, P. // Annals of Operations Research;Jan2005, Vol. 136 Issue 1-4, p229 

    Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This paper refers to anactivesensor when it reads identifications of vehicles, including their routes in the network, that...

  • A Reliability-Based Stochastic Traffic Assignment Model for Network with Multiple User Classes under Uncertainty in Demand. Hu Shao; Lam, William; Mei Tam // Networks & Spatial Economics;Sep2006, Vol. 6 Issue 3/4, p173 

    This paper presents a novel reliability-based stochastic user equilibrium traffic assignment model in view of the day-to-day demand fluctuations for multi-class transportation networks. In the model, each class of travelers has a different safety margin for on-time arrival in response to the...

  • Route Constrained Fleet Scheduling. Orloff, Clifford S. // Transportation Science;May76, Vol. 10 Issue 2, p149 

    This paper attempts to provide some insight into the structure of' a large class of fleet scheduling problems. Scheduling under fixed due date constraints is shown to be easily solved using a new formulation of the problem. Scheduling under flexible due date constraints is shown to be inherently...

  • The Traffic Assignment Problem for Multiclass-User Transportation Networks. Dafermos, Stella C. // Transportation Science;Feb72, Vol. 6 Issue 1, p73 

    In a recent paper a traffic assignment model has been constructed in which the cost on a link may depend not only on its load, but also on the loads on other links of the network. In this paper it is shown that this model is also capable of handling the case of several classes of users in the...

  • A PRIMAL-DUAL TRAFFIC ASSIGNMENT ALGORITHM. Petersen, E. R. // Management Science;Sep75, Vol. 22 Issue 1, p87 

    A new algorithm for solving the traffic assignment problem is presented. This is a primal-dual algorithm which utilizes a flow augmentation primal and a shortest path dual procedure. At each iteration a feasible solution is known together with a measure of "goodness" of the solution. It is shown...

  • Model of Dynamic User Optimal Problem with Link Capacity Constraints. Hualing Ren; Ziyou Gao // Journal of Systems Science & Information;Jun2005, Vol. 3 Issue 2, p253 

    A variational inequality (VI) model of instantaneous dynamic user optimal (DUO) problem with capacity is proposed, and the relationship between the delay time and the dual variable associated with the link capacity constraint is also discussed. The model satisfies Wardrop principle; the...

  • Slow going. Philippidis, Alex // Westchester County Business Journal;03/29/99, Vol. 38 Issue 13, p13 

    Reports that Yonkers, New York has begun work to analyze and design a system to synchronize traffic lights on Central Park Avenue. Efforts to improve both north-south and east-west traffic in the city; Brian O'Rourke's appointment as the city's director of traffic engineering.


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics