Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Two-Point Step Size Gradient Methods
Finite-Dimensional Variational Inequalities and Complementarity Problems
Convex programming in Hilbert space
A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
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
A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
An algorithm for the ranking of shortest paths
A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
On a multicriteria shortest path problem
A comparison of solution strategies for biobjective shortest path problems
A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
Computational study of state-of-the-art path-based traffic assignment algorithms
Some recent advances in projection-type methods for variational inequalities
A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
A framework for and empirical study of algorithms for traffic assignment
Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
The combination of continuous network design and route guidance
The Traffic Equilibrium Problem with Nonadditive Path Costs
On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
Algorithms – ESA 2004
Non-expected route choice model under risk on stochastic traffic networks
A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost
Time-dependent trip-chain link travel time estimation model with the first-in-first-out constraint
Some projection methods with the BB step sizes for variational inequalities
Speeding up Martins' algorithm for multiple objective shortest path problems
A path-based gradient projection algorithm for the cost-based system optimum problem in networks with continuously distributed value of time
Solving the combined modal split and traffic assignment problem with two types of transit impedance function
Non-additive shortest path in the context of traffic assignment
A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
A convergent and fast path equilibration algorithm for the traffic assignment problem
A rank-dependent bi-criterion equilibrium model for stochastic transportation environment

Cited In (2)

Reliability-based mixed traffic equilibrium problem under endogenous market penetration of connected autonomous vehicles and uncertainty in supply
Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints

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)