A Greedy Path-Based Algorithm for Traffic Assignment

This paper presents a new path-based algorithm for the static user equilibrium traffic assignment problem. Path-based algorithms are generally considered less efficient than bush-based counterparts, such as Algorithm B, traffic assignment by paired alternative segments (TAPAS), and iTAPAS, an improved version of TAPAS, because explicitly storing and manipulating paths appears wasteful. However, our numerical experiments indicate that the proposed path-based algorithm can outperform TAPAS or iTAPAS by a wide margin. The proposed algorithm, sharing the same Gauss-Seidel decomposition scheme with existing path-based algorithms, delivered a surprising performance, most likely due to its two main features. First, it adopts a greedy method to solve the restricted subproblem defined on each origin–destination (O-D) pair. Second, instead of sequentially visiting every O-D pair in each iteration, it introduces an intelligent scheme to determine which O-D pairs need more or less work. The proposed algorithm is also more straightforward to implement than bush-based algorithms.

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

[2]  Marco Sciandrone,et al.  A convergent and fast path equilibration algorithm for the traffic assignment problem , 2018, Optim. Methods Softw..

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

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

[5]  Michael Florian,et al.  Optimal strategies: A new assignment model for transit networks , 1989 .

[6]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

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

[8]  Hillel Bar-Gera,et al.  Convergence of Traffic Assignments: How Much Is Enough? 1 , 2004 .

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

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

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

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

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

[14]  D. Hearn,et al.  Simplical decomposition of the asymmetric traffic assignment problem , 1984 .

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

[16]  Stefano Pallottino,et al.  Equilibrium traffic assignment for large scale transit networks , 1988 .

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

[18]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

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

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

[21]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

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

[23]  J. Wardrop.  ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[24]  Chi Xie,et al.  Origin-Based Algorithms for Traffic Assignment , 2015 .