A framework for and empirical study of algorithms for traffic assignment
From MaRDI portal
Publication:337346
DOI10.1016/j.cor.2014.08.024zbMath1348.90188OpenAlexW2161233707WikidataQ59897877 ScholiaQ59897877MaRDI QIDQ337346
Andrea Raith, Matthias Ehrgott, Judith Y. T. Wang, Olga Perederieieva
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://eprints.whiterose.ac.uk/80380/1/COR_Perederieieva_forSecondResubmission.pdf
Related Items (13)
A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand ⋮ Column generation for the equilibrium route-flow traffic assignment problem ⋮ Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size ⋮ Modifying link capacity to avoid Braess paradox considering elastic demand ⋮ Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network ⋮ A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem ⋮ A convergent and fast path equilibration algorithm for the traffic assignment problem ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ Integrating link-based discrete credit charging scheme into discrete network design problem ⋮ Non-additive shortest path in the context of traffic assignment ⋮ Refugee migration networks and regulations: a multiclass, multipath variational inequality framework ⋮ Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies ⋮ Improving the performance of a traffic system by fair rerouting of travelers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
- A conjugate gradient projection algorithm for the traffic assignment problem
- Finiteness in restricted simplicial decomposition
- Computational study of state-of-the-art path-based traffic assignment algorithms
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- An exit-flow model used in dynamic traffic assignment
- Numerical Computing with IEEE Floating Point Arithmetic
- An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- Origin-Based Algorithm for the Traffic Assignment Problem
- Network economics. A variational inequality approach.
This page was built for publication: A framework for and empirical study of algorithms for traffic assignment
