Computational study of state-of-the-art path-based traffic assignment algorithms

Authors:
Anthony Chen;Der-Horng Lee;R. Jayakrishnan
Affiliations:
Department of Civil and Environmental Engineering, Utah State University, Logan, UT;Department of Civil Engineering, National University of Singapore, BLK E1A #07-16, 1 Engineering Drive 2, Singapore 117576, Singapore;Department of Civil and Environmental Engineering, University of California, Irvine, CA
Venue:
Mathematics and Computers in Simulation
Year:
2002

Citing 0
Cited 6

On selfish routing in internet-like environments

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On selfish routing in internet-like environments

IEEE/ACM Transactions on Networking (TON)
Stochastic multi-objective models for network design problem

Expert Systems with Applications: An International Journal
A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem

Computers and Operations Research
An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem

Mathematical and Computer Modelling: An International Journal
A modified gradient projection algorithm for solving the elastic demand traffic assignment problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent research has demonstrated and established the viability of applying path-based algorithms to the traffic equilibrium problem in reasonably large networks. Much of the attention has been focused on two particular algorithms: the disaggregate simplicial decomposition (DSD) algorithm and the gradient projection (GP) algorithm. The purpose of this paper is to evaluate the performance of these two path-based algorithms using networks of realistic size. Sensitivity analysis is performed on randomly generated networks to examine the performance of the algorithms with respect to network sizes, congestion levels, number of origin-destination (OD) pairs, and accuracy levels. In order to be empirically convincing, a realistic large-scale network, known as the ADVANCE network, is also used to show that path-based algorithms are a viable alternative in practice.