A Mathematical Model and Descent Algorithm for Bilevel Traffic Management

References

  • Akamatsu T. Decomposition of path choice entropy in general transport networks. Transportation Sci. (1997) 31:349–362LinkGoogle Scholar
  • Bard J. F.Practical Bilevel Optimization: Algorithms and Applications (1998) (Kluwer Academic Publishers, Dordrecht The Netherlands) CrossrefGoogle Scholar
  • Bard J. F., Falk J. E. An explicit solution to the multi-level programming problem. Comput. Oper. Res. (1982) 9:77–100CrossrefGoogle Scholar
  • Bergendorff P., Hearn D. W., Ramana M. V., Pardalos P., Hearn D. W., Hager W. W. Congestion toll pricing of traffic networks. Network Optimization. Proc. Network Optim. Conf. (1996) February 12–14University of Florida, Gainesville, FL:51–71Google Scholar
  • Bertsekas D. P.Nonlinear Programming (1999) 2nd ed.(Athena Scientific, Bellmont, MA) Google Scholar
  • Bihain A. Optimization of upper semidifferentiable functions. J. Optim. Theory and Appl. (1984) 44:545–568CrossrefGoogle Scholar
  • Bonnans J. F., Shapiro A.Perturbation Analysis of Optimization Problems (2000) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Cantarella G. E., Sforza A., Odoni A. R., Bianco L., Szegö G. Methods for equilibrium network traffic signal setting. Flow Control of Congested Networks. Proc. NATO Advanced Res. Workshop on Flow Control of Congested Networks (1986) 38(Springer-Verlag, Berlin, Germany) 69–89October 12–18, Capri, Italy. NATO ASI Series F: Computer and Systems SciencesGoogle 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
  • Dafermos S., Sparrow F. T. Optimal resource allocation and toll patterns in user-optimised transport networks. J. Transportation Econom. Policy (1971) 5:184–200Google Scholar
  • Davis G. A. Exact local solution of the continuous network design problem via stochastic user equilibrium assignment. Transportation Res. (1994) 28B:61–75CrossrefGoogle Scholar
  • Dempe S. On the leader's dilemma and a new idea for attacking bilevel programming problems. (1997) . Technical report Fachbereich Mathematik, Technische Universität Chemnitz, Chemnitz, GermanyGoogle Scholar
  • Dempe S. A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions. Comput. Optim. Appl. (2000) 15:145–166CrossrefGoogle Scholar
  • Dempe S., Schmidt H. On an algorithm solving two-level programming problems with nonunique lower level solutions. Comput. Optim. Appl. (1996) 6:227–249CrossrefGoogle 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
  • Dontchev A. L., Rockafellar R. T. Ample parameterization of variational inclusions. (2000) . Preprint, Department of Mathematics, University of Washington, Seattle, WAGoogle Scholar
  • Ferrari P. Capacity constraints in urban transport networks. Transportation Res. (1997) 31B:291–301CrossrefGoogle Scholar
  • Ferris M. C., Ralph D., Du D., Qi L., Womersley R. Projected gradient methods for nonlinear complementarity problems via normal maps. Recent Advances in Nonsmooth Optimization (1995) (World Scientific Publishers, River Edge, NJ) 57–87CrossrefGoogle Scholar
  • Fisk C. Some developments in equilibrium traffic assignment. Transportation Res. (1980) 14B:243–255CrossrefGoogle Scholar
  • Friesz T. L., Tobin R. L., Cho H. J., Mehta N. J. Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints. Math. Programming (1990) 48:265–284CrossrefGoogle Scholar
  • Grippo L., Lampariello F., Lucidi S. A class of non-monotone stabilization methods in unconstrained optimization. Numerische Mathematik (1991) 59:779–805CrossrefGoogle Scholar
  • Heydecker B. G. Some consequences of detailed junction modeling in road traffic assignment. Transportation Sci. (1983) 17:263–281LinkGoogle Scholar
  • Kiwiel K. C. Restricted step and Levenberg-Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization. SIAM J. Optim. (1996) 6:227–249CrossrefGoogle 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. Equilibrium characterizations of solutions to side constrained asymmetric traffic assignment models. Le Matematiche (1994) 49:249–280Google 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., Marcotte P., Nguyen S. Side constrained traffic equilibrium models-Traffic management through link tolls. Equilibrium and Advanced Transportation Modelling (1998) (Kluwer Academic Publishers, New York) 125–151CrossrefGoogle Scholar
  • Larsson T., Patriksson M. Side constrained traffic equilibrium models: Analysis, computation and applications. Transportation Res. (1999) 33B:233–264CrossrefGoogle Scholar
  • LeBlanc L. J., Abdulaal M. Continuous equilibrium network design models. Transportation Res. (1979) 13B:19–32Google Scholar
  • Loridan P., Morgan J., Barbu V., Bonnans J. F., Tiba D. Least-norm regularization for weak two-level optimization problems. Optimization, Optimal Control and Partial Differential Equations (1992) 107(Birkhäuser, Basel) 307–318Papers from the First Franco-Romanian Conf. September 7–11, Iasşi. International Series of Numerical MathematicsCrossrefGoogle Scholar
  • Loridan P., Morgan J. Weak via strong Stackelberg problems: New results. J. Global Optim. (1996) 8:263–287CrossrefGoogle Scholar
  • Luo Z.-Q., Pang J.-S., Ralph D.Mathematical Programs with Equilibrium Constraints (1996) (Cambridge University Press, Cambridge, U.K.) CrossrefGoogle Scholar
  • Mäkelä M. M., Miettinen M., Lukšan L., Vlček J. Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities. J. Global Optim. (1999) 14:117–135CrossrefGoogle Scholar
  • Marcotte P. Network design problem with congestion effects: A case of bilevel programming. Math. Programming (1986) 34:142–162CrossrefGoogle Scholar
  • Migdalas A. Bilevel programming in traffic planning: Models methods and challenge. J. Global Optim. (1995) 7:381–405CrossrefGoogle Scholar
  • Miller S. D., Payne H. J., Thompson W. A. An algorithm for traffic assignment on capacity constrained transportation networks with queues. (1975) Johns Hopkins Conf. on Inform. Sci. SystemsApril 2–4The Johns Hopkins University, Baltimore, MDGoogle Scholar
  • Minty G. J. A theorem on monotone sets in Hilbert spaces. J. Math. Analysis and Appl. (1967) 16:434–439Google Scholar
  • Nagurney A.Network Economics: A Variational Inequality Approach (1993) (Kluwer Academic Publishers, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Outrata J. V., Gritzmann P., Horst R., Sachs E., Tichatschke R. On a special class of mathematical programs with equilibrium constraints. Recent Advances in Optimization. Proc. 8th French-German Conf. Optim. (1997) 452(Springer-Verlag, Berlin, Germany) 246–260July 21–26, Trier. Lecture Notes in Economics and Mathematical SystemsCrossrefGoogle Scholar
  • Outrata J., Zowe V. J. A numerical approach to optimization problems with variational inequality constraints. Math. Programming (1995) 68:105–130CrossrefGoogle Scholar
  • Outrata J. V., Kočvara M., Zowe J.Nonsmooth Approach to Optimization Problems with Equilibrium Constraints (1998) (Kluwer Academic Publishers, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Pang J.-S., Qi L. Nonsmooth equations: Motivations and algorithms. SIAM J. Optim. (1993) 3:443–465CrossrefGoogle Scholar
  • Pang J.-S., Ralph D. Piecewise smoothness, local invertibility, and parametric analysis of normal maps. Math. Oper. Res. (1996) 21:401–426LinkGoogle Scholar
  • Pang J.-S., Han S.-P., Rangaraj N. Minimization of locally Lipschitz functions. SIAM J. Optim (1991) 1:57–82CrossrefGoogle Scholar
  • Patriksson M.The Traffic Assignment Problem—Models and Methods. Topics in Transportation (1994) (VSP BV, Utrecht, The Netherlands) Google Scholar
  • Patriksson M.Nonlinear Programming and Variational Inequalities: A Unified Approach (1998) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
  • Patriksson M. Sensitivity analysis of traffic equilibria. Transportation Sci. (2002) . Under revision forGoogle Scholar
  • Patriksson M., Rockafellar R. T. Sensitivity analysis of variational inequalities over aggregated polyhedra, with application to traffic equilibria. Transportation Sci. (2002) . ForthcomingGoogle Scholar
  • Qi L. Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. (1993) 18:227–244LinkGoogle Scholar
  • Qi L., Sun J. A nonsmooth version of Newton's method. Math. Programming (1993) 58:353–368CrossrefGoogle 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. Normal maps induced by linear transformations. Math. Oper. Res. (1992) 17:691–714LinkGoogle Scholar
  • Rockafellar R. T., Wets R. J-B.Variational Analysis (1998) 317(Springer-Verlag, Berlin, Germany) . Grundlehren der mathematischen WissenschaftenCrossrefGoogle Scholar
  • Scheel H., Scholtes S. Mathematical programs with complementarity constraints: Stationarity, optimality and sensitivity. Math. Oper. Res. (2000) 25:1–22LinkGoogle Scholar
  • Schramm H., Zowe J. A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results. SIAM J. Optim. (1992) 2:121–152CrossrefGoogle Scholar
  • Smith M. J., Van Vuren T. Traffic equilibrium with responsive traffic control. Transportation Sci. (1993) 27:118–132LinkGoogle Scholar
  • Tobin R. L., Friesz T. L. Sensitivity analysis for equilibrium network flow. Transportation Sci. (1988) 22:242–250LinkGoogle Scholar
  • Toint Ph., Wynter L., Lesort J.-B. Asymmetric multiclass traffic assignment: A coherent formulation. Transportation and Traffic Theory. Proc. 13th Internat. Symposium on Transportation and Traffic Theory (1996) July 24–26Lyon, France(Pergamon Press, Oxford, U.K.) 237–260Google Scholar
  • Wardrop J. G. Some theoretical aspects of road traffic research. (1952) Proc. Inst. Civil Engineers Part II:325–378Google Scholar
  • Yang H., Lam W. H. K. Optimal road tolls under conditions of queueing and congestion. Transportation Res. (1996) 30A:319–332Google Scholar
  • Yen N. D. Lipschitz continuity of solutions of variational inequalities with a parametric polyhedral constraint. Math. Oper. Res. (1995) 20:695–708LinkGoogle Scholar
  • Zhang R. Problems of hierarchical optimization in finite dimension. SIAM J. Optim. (1994) 4:521–536CrossrefGoogle 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.