A convergent and fast path equilibration algorithm for the traffic assignment problem
From MaRDI portal
Publication:4638926
DOI10.1080/10556788.2017.1332621zbMath1397.90300OpenAlexW2626097948MaRDI QIDQ4638926
Alessandro Galligari, Marco Sciandrone
Publication date: 2 May 2018
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2017.1332621
Convex programming (90C25) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items (4)
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 ⋮ 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
Cites Work
- A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
- A framework for and empirical study of algorithms for traffic assignment
- On the convergence of descent methods for monotone variational inequalities
- A convergent and efficient decomposition method for the traffic assignment problem
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- Origin-Based Algorithm for the Traffic Assignment Problem
- Traffic assignment problem for a general network
- Unnamed Item
This page was built for publication: A convergent and fast path equilibration algorithm for the traffic assignment problem