Computational study of state-of-the-art path-based traffic assignment algorithms
From MaRDI portal
Publication:1614046
DOI10.1016/S0378-4754(01)00437-2zbMath1030.90012MaRDI QIDQ1614046
R. Jayakrishnan, Der-Horng Lee, Anthony Chen
Publication date: 3 September 2002
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Related Items (16)
Modeling mode and route similarities in network equilibrium problem with go-green modes ⋮ A modified gradient projection algorithm for solving the elastic demand traffic assignment problem ⋮ A framework for and empirical study of algorithms for traffic assignment ⋮ Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size ⋮ Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network ⋮ Day-to-day signal retiming scheme for single-destination traffic networks based on a flow splitting approach ⋮ Issues in the implementation of the DSD algorithm for the traffic assignment problem ⋮ A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost ⋮ An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem ⋮ A path-based double projection method for solving the asymmetric traffic network equilibrium problem ⋮ An \(N\)-path user equilibrium for transportation networks ⋮ Solving the combined modal split and traffic assignment problem with two types of transit impedance function ⋮ A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem ⋮ A turning restriction design problem in urban road networks ⋮ A bi-objective turning restriction design problem in urban road networks ⋮ Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model
Cites Work
This page was built for publication: Computational study of state-of-the-art path-based traffic assignment algorithms
