An \(N\)-path user equilibrium for transportation networks
From MaRDI portal
Publication:1991373
DOI10.1016/j.apm.2013.07.009zbMath1427.90080OpenAlexW2012098518MaRDI QIDQ1991373
Publication date: 30 October 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2013.07.009
traffic assignmentFrank-Wolfe algorithmuser equilibriumlimited choice setpath flow shifting algorithm
Related Items (2)
Road network pricing and design for ordinary and hazmat vehicles: integrated model and specialized local search ⋮ A modified \textit{Physarum}-inspired model for the user equilibrium traffic assignment problem
Cites Work
- Finding the \(\varepsilon\)-user equilibrium solution using an augmented Frank-Wolfe algorithm
- User equilibrium with recourse
- Computational study of state-of-the-art path-based traffic assignment algorithms
- Algorithms for computing traffic equilibria
- On the convergence of descent methods for monotone variational inequalities
- Origin-Based Algorithm for the Traffic Assignment Problem
- Unnamed Item
This page was built for publication: An \(N\)-path user equilibrium for transportation networks