Abstract
The optimization of traffic flow in congested urban road networks faces a well-known dilemma: Optimizing system performance is unfair with respect to the individual drivers’ travel times; and a fair user equilibrium may result in bad system performance. As a remedy, computing a system optimum with fairness conditions, realized by length constraints on the routes actually used by drivers, has been suggested in [5]. This poses interesting mathematical challenges, namely the nonlinearity of the objective function and the necessity to deal with path constraints in large networks. While the authors present results suggesting that solutions to this constrained system optimum problem (CSO) are indeed equally good and fair, they rely on a standard Frank-Wolfe/Partan-algorithm to obtain them.
In this paper, we present a Lagrangian relaxation of the CSO problem for which the Lagrangian dual function can be evaluated by a decomposition into constrained shortest path problems which we solve exactly employing state-of-the-art acceleration techniques. The Lagrangian dual problem is then solved by a special cutting plane method.
Finally, we obtain test results which suggest that this approach outperforms previously described solution schemes for the CSO problem.
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
F. Babonneau, C. Beltran, A. Haurie, C. Tadonki, and J.-P. Vial. Proximal-ACCPM: A versatile oracle based optimization method. Computational Management Science, to appear.
F. Babonneau and J.-P. Vial. ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems. Mathematical Programming, to appear.
O. du Merle and J.-P. Vial. Proximal-ACCPM, a cutting plane method for column generation and lagrangian relaxation: Application to the p-median problem. Technical Report 2002.23, Logilab, University of Geneva, 2002.
J.-L. Goffin, A. Haurie, and J.-P. Vial. Decomposition and nondifferentiable optimization with the projective algorithm. Management Science, 38(2):284–302, 1992.
O. Jahn, R. H. Möhring, A. S. Schulz, and N. E. Stier-Moses. System-optimal routing of traffic flows with user constraints in networks with congestion. Operations Research, 53:600–616, 2005.
E. Köhler, R. H. Möhring, and H. Schilling. Acceleration of shortest path and constrained shortest path computation. In Proceedings of the WEA 2005, pages 126–138, 2005.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
König, F.G. (2007). Traffic Optimization Under Route Constraints with Lagrangian Relaxation and Cutting Plane Methods. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-69995-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69994-1
Online ISBN: 978-3-540-69995-8
eBook Packages: Business and EconomicsBusiness and Management (R0)