A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
From MaRDI portal
Publication:337015
DOI10.1016/j.cor.2014.01.012zbMath1348.90121OpenAlexW2086675985MaRDI QIDQ337015
Keechoo Choi, Anthony Chen, Seungkyu Ryu
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.01.012
Related Items (10)
A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand ⋮ 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 ⋮ Modifying link capacity to avoid Braess paradox considering elastic demand ⋮ 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 ⋮ Solving the combined modal split and traffic assignment problem with two types of transit impedance function ⋮ A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models ⋮ A modified \textit{Physarum}-inspired model for the user equilibrium traffic assignment problem ⋮ Pricing and equity in cross-regional green supply chains
Cites Work
- Unnamed Item
- Computation and application of the paired combinatorial logit stochastic user equilibrium problem
- Method of successive weighted averages (MSWA) and self-regulated averaging schemes for solving stochastic user equilibrium problem
- Computational study of state-of-the-art path-based traffic assignment algorithms
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- Algorithms for computing traffic equilibria
- On the convergence of descent methods for monotone variational inequalities
- Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
- The general multimodal network equilibrium problem with elastic demand
- On the Goldstein-Levitin-Polyak gradient projection method
- A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand
- Convex programming in Hilbert space
- Traffic assignment problem for a general network
This page was built for publication: A modified gradient projection algorithm for solving the elastic demand traffic assignment problem