A class of bush-based algorithms for the traffic assignment problem

This paper studies a class of bush-based algorithms (BA) for the user equilibrium (UE) traffic assignment problem, which promise to produce highly precise solutions by exploiting acyclicity of UE flows. Each of the two building blocks of BA, namely the construction of acyclic sub-networks (bush) and the solution of restricted master problems (RMP), is examined and further developed. Four Newton-type algorithms for solving RMP, which can be broadly categorized as route flow and origin flow based, are presented, of which one is newly developed in this paper. Similarities and differences between these algorithms, as well as the relevant implementation issues are discussed in great details. A comprehensive numerical study is conducted using both real and randomly generated networks, which reveals that the relative performance of the algorithms is consistent with the analysis. In particular, the results suggest that swapping flows between shortest and longest route segments consistently outperforms other RMP solution techniques. 2009 Elsevier Ltd. All rights reserved.

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

[2]  Robert B. Dial,et al.  Minimal-revenue congestion pricing part I: A fast algorithm for the single-origin case , 1999 .

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

[4]  J. A. Ventura,et al.  Finiteness in restricted simplicial decomposition , 1985 .

[5]  Robert Barkley Dial.  Probabilistic assignment: a multipath traffic assignment model which obviates path enumeration , 1970 .

[6]  Howard Slavin,et al.  An empirical comparison of alternative user equilibrium traffic assignment methods , 2006 .

[7]  George L. Nemhauser,et al.  A Column Generation Algorithm for Optimal Traffic Assignment , 1973 .

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

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

[10]  Gordon F. Newell,et al.  Traffic flow on transportation networks , 1980 .

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

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

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

[14]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[15]  M..  Projected Newton Methods and Optimization of Multicommodity Flows , 2022 .

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

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

[18]  L. Armijo.  Minimization of functions having Lipschitz continuous first partial derivatives. , 1966 .

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

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

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

[22]  Y. She.  Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods , 1985 .

[23]  Werner C. Rheinboldt,et al.  Methods for solving systems of nonlinear equations , 1987 .

[24]  Stella Dafermos,et al.  An Extended Traffic Assignment Model with Applications to Two-Way Traffic , 1971 .