Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network
DOI10.1080/10556788.2023.2196725zbMath1523.90076OpenAlexW4377224665MaRDI QIDQ6078430
Publication date: 27 September 2023
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2023.2196725
decompositionnonlinear optimizationsequential optimizationpath-equilibration techniquesuser-equilibrium route-flow traffic assignment
Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Cites Work
- Unnamed Item
- A framework for and empirical study of algorithms for traffic assignment
- Computational study of state-of-the-art path-based traffic assignment algorithms
- A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand
- On the convergence of descent methods for monotone variational inequalities
- Column generation for the equilibrium route-flow traffic assignment problem
- A convergent and efficient decomposition method for the traffic assignment problem
- Network flow assignment as a fixed point problem
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem
- A convergent and fast path equilibration algorithm for the traffic assignment problem
- Traffic assignment problem for a general network
This page was built for publication: Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network
