Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
From MaRDI portal
Publication:2669769
Recommendations
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
- scientific article; zbMATH DE number 1086906
- Solving nonadditive traffic assignment problems: a self-adaptive projection-auxiliary problem method for variational inequalities
- Improved noniterative algorithm for solving the traffic equilibrium problem
Cites work
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1086906 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- A comparison of solution strategies for biobjective shortest path problems
- A convergent and fast path equilibration algorithm for the traffic assignment problem
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- A framework for and empirical study of algorithms for traffic assignment
- A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
- A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
- A path-based gradient projection algorithm for the cost-based system optimum problem in networks with continuously distributed value of time
- A rank-dependent bi-criterion equilibrium model for stochastic transportation environment
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
- A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost
- Algorithms – ESA 2004
- An algorithm for the ranking of shortest paths
- Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
- Computational study of state-of-the-art path-based traffic assignment algorithms
- Convex programming in Hilbert space
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
- Non-additive shortest path in the context of traffic assignment
- Non-expected route choice model under risk on stochastic traffic networks
- On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
- On a multicriteria shortest path problem
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
- Solving the combined modal split and traffic assignment problem with two types of transit impedance function
- Some projection methods with the BB step sizes for variational inequalities
- Some recent advances in projection-type methods for variational inequalities
- Speeding up Martins' algorithm for multiple objective shortest path problems
- Step-sizes for the gradient method
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- The combination of continuous network design and route guidance
- Time-dependent trip-chain link travel time estimation model with the first-in-first-out constraint
- Two-Point Step Size Gradient Methods
Cited in
(4)- Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- Reliability-based mixed traffic equilibrium problem under endogenous market penetration of connected autonomous vehicles and uncertainty in supply
This page was built for publication: Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669769)
