This paper presents an extensive analytical and numerical investigation of a class of origin-based algorithms for the user equilibrium–based traffic assignment problem. Nine known algorithms in this class are first clustered into four algorithmic structures on the basis of their structural differences and similarities in algorithm design. A complexity analysis of these algorithmic structures is conducted by calculating the frequency of executing node and link operations; this approach provides a simple analytical way to estimate their per iteration computation costs. To deliver a comprehensive and fair comparison of their convergence performance, all nine algorithms are implemented on the same programming platform and run to solve a few representative large-scale traffic networks by sizes and congestion levels. A close look at the convergence performance statistics further justifies the consistency of the complexity analysis and numerical evaluation results of the computational efficiency of these algorithms. Discussions on the degeneration of algorithm convergence efficiency with respect to network size and congestion level provide useful insights for the potential improvement of current origin-based algorithms or the proposition of new algorithms.
Origin-Based Algorithms for Traffic Assignment
Algorithmic Structure, Complexity Analysis, and Convergence Performance
Transportation Research Record
Transportation Research Record: Journal of the Transportation Research Board ; 2498 , 1 ; 46-55
2015-01-01
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Origin-Based Algorithms for Traffic Assignment
Online Contents | 2015
|Origin-Based Algorithm for the Traffic Assignment Problem
British Library Online Contents | 2002
|Origin-Based Algorithm for the Traffic Assignment Problem
Online Contents | 2002
|Dynamic Traffic Assignment: Genetic Algorithms Approach
Transportation Research Record | 1997
|Dynamic Traffic Assignment: Genetic Algorithms Approach
Online Contents | 1997
|