A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
From MaRDI portal
Publication:337015
DOI10.1016/J.COR.2014.01.012zbMATH Open1348.90121OpenAlexW2086675985MaRDI QIDQ337015FDOQ337015
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
Cites Work
- Convex programming in Hilbert space
- 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
- Computation and application of the paired combinatorial logit stochastic user equilibrium problem
- Traffic assignment problem for a general network
- Method of successive weighted averages (MSWA) and self-regulated averaging schemes for solving stochastic user equilibrium problem
- Title not available (Why is that?)
- A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand
- The general multimodal network equilibrium problem with elastic demand
- On the Goldstein-Levitin-Polyak gradient projection method
- Computational study of state-of-the-art path-based traffic assignment algorithms
- Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
Cited In (11)
- A convergent and fast path equilibration algorithm for the traffic assignment problem
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- Pricing and equity in cross-regional green supply chains
- A customized two-stage parallel computing algorithm for solving the combined modal split and 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
- A framework for and empirical study of algorithms for traffic assignment
- A conjugate gradient projection algorithm for the traffic assignment problem
- Modifying link capacity to avoid Braess paradox considering elastic demand
- A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand
Recommendations
- A conjugate gradient projection algorithm for the traffic assignment problem π π
- Title not available (Why is that?) π π
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem π π
- A power penalty method for the general traffic assignment problem with elastic demand π π
- A massively parallel implementation of a discrete-time algorithm for the computation of dynamic elastic demand traffic problems modeled as projected dynamical systems π π
- A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs π π
- Title not available (Why is that?) π π
This page was built for publication: A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337015)