An alternating direction method of multipliers for solving user equilibrium problem

[1]  Kai Zhang,et al.  A parallel computing approach to solve traffic assignment using path-based gradient projection algorithm , 2020 .

[2]  Michael Florian,et al.  Reduced gradient algorithm for user equilibrium traffic assignment problem , 2020 .

[3]  Xinyuan Chen,et al.  A parallel computing framework for solving user equilibrium problem on computer clusters , 2020 .

[4]  Jun Xie,et al.  A New Algorithm for Achieving Proportionality in User Equilibrium Traffic Assignment , 2019, Transp. Sci..

[5]  Marco Sciandrone,et al.  A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand , 2019, Comput. Oper. Res..

[6]  Xiaobo Liu,et al.  A Greedy Path-Based Algorithm for Traffic Assignment , 2018 .

[7]  Stephen D. Boyles,et al.  A decomposition approach to the static traffic assignment problem , 2017 .

[8]  Chi Xie,et al.  New insights and improvements of using paired alternative segments for traffic assignment , 2016 .

[9]  Srinivas Peeta,et al.  Cost Scaling Based Successive Approximation Algorithm for the Traffic Assignment Problem , 2014 .

[10]  G. Gentile.  Local User Cost Equilibrium: a bush-based algorithm for traffic assignment , 2014 .

[11]  Yu Nie,et al.  Quadratic approximation and convergence of some bush-based algorithms for the traffic assignment problem , 2013 .

[12]  Anthony Chen,et al.  A self-adaptive Armijo stepsize strategy with application to traffic assignment models and algorithms , 2013 .

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

[14]  Yu Nie,et al.  A Note on Bar-Gera's Algorithm for the Origin-Based Traffic Assignment Problem , 2012, Transp. Sci..

[15]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

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

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

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

[19]  Tomio Hirata,et al.  An Improved Algorithm for the Nearly Equitable Edge-Coloring Problem , 2004 .

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

[21]  Jayadev Misra,et al.  A Constructive Proof of Vizing's Theorem , 1992, Inf. Process. Lett..

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

[23]  Robert R. Meyer,et al.  Parallel optimization for traffic assignment , 1988, Math. Program..

[24]  R. Meyer,et al.  Piecewise-linear approximation methods for nonseparable convex optimization , 1988 .

[25]  A. Weintraub,et al.  Accelerating convergence of the Frank-Wolfe algorithm☆ , 1985 .

[26]  Dimitri P. Bertsekas,et al.  Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks , 1984, IEEE Trans. Commun..

[27]  M. Fukushima.  On the dual approach to the traffic assignment problem , 1984 .

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

[29]  Warrren B Powell,et al.  The Convergence of Equilibrium Algorithms with Predetermined Step Sizes , 1982 .

[30]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[31]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

[32]  D. Bertsekas.  On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.

[33]  S. Nguyen.  An Algorithm for the Traffic Assignment Problem , 1974 .

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

[35]  C. Shannon.  A Theorem on Coloring the Lines of a Network , 1949 .

[36]  Amit Kumar,et al.  An Improved Social Pressure Algorithm for Static Deterministic User Equilibrium Traffic Assignment Problem , 2011 .

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

[38]  Anthony Chen,et al.  FASTER FRANK-WOLFE TRAFFIC ASSIGNMENT WITH NEW FLOW UPDATE SCHEME , 2002 .

[39]  R. Jayakrishnan,et al.  A FASTER PATH-BASED ALGORITHM FOR TRAFFIC ASSIGNMENT , 1994 .

[40]  Torbjörn Larsson,et al.  A partial linearization method for the traffic assignment problem , 1993 .

[41]  Michael Florian,et al.  An efficient implementation of the "partan" variant of the linear approximation method for the network equilibrium problem , 1987, Networks.