A convergent and efficient decomposition method for the traffic assignment problem

In this work we consider the network equilibrium problem formulated as convex minimization problem whose variables are the path flows. In order to take into account the difficulties related to the large dimension of real network problems we adopt a decomposition-based approach suitably combined with a column generation strategy. We present an inexact block-coordinate descent method and we prove the global convergence of the algorithm. The results of computational experiments performed on medium-large dimensional problems show that the proposed algorithm is at least competitive with state of the art algorithms.

[1]  Robert B. Dial,et al.  A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration , 2006 .

[2]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[4]  Torbjörn Larsson,et al.  Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem , 1992, Transp. Sci..

[5]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[6]  Michael Patriksson,et al.  Algorithms for Computing Traffic Equilibria , 2004 .

[7]  David E. Boyce,et al.  Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs , 1985, Transp. Sci..

[8]  Per Olov Lindberg,et al.  The Stiff Is Moving - Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment , 2013, Transp. Sci..

[9]  Michael Patriksson,et al.  The Traffic Assignment Problem: Models and Methods , 2015 .

[10]  Michael Florian,et al.  A New Look at Projected Gradient Method for Equilibrium Assignment , 2009 .

[11]  Hillel Bar-Gera,et al.  Origin-Based Algorithm for the Traffic Assignment Problem , 2002, Transp. Sci..

[12]  M. Fukushima.  A modified Frank-Wolfe algorithm for solving the traffic assignment problem , 1984 .

[13]  S. Lucidi,et al.  Decomposition Algorithm Model for Singly Linearly-Constrained Problems Subject to Lower and Upper Bounds , 2009 .

[14]  Laura Palagi,et al.  A convergent decomposition algorithm for support vector machines , 2007, Comput. Optim. Appl..

[15]  John C. Platt,et al.  Fast training of support vector machines using sequential minimal optimization, advances in kernel methods , 1999 .

[16]  Hillel Bar-Gera,et al.  Traffic Assignment by Paired Alternative Segments , 2010 .

[17]  Chih-Jen Lin,et al.  On the convergence of the decomposition method for support vector machines , 2001, IEEE Trans. Neural Networks.

[18]  Yu Nie,et al.  A class of bush-based algorithms for the traffic assignment problem , 2010 .

[19]  Michael Patriksson,et al.  Computational Precision of Traffic Equilibria Sensitivities in Automatic Network Design and Road Pricing , 2013 .