A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
From MaRDI portal
Recommendations
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- Solving nonadditive traffic assignment problems: a self-adaptive projection-auxiliary problem method for variational inequalities
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
- scientific article; zbMATH DE number 1086906
- A conjugate gradient projection algorithm for the traffic assignment problem
Cites work
- A class of projection and contraction methods for asymmetric linear variational inequalities and their relations to Fukushima's descent method
- A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
- A special newton-type optimization method
- Algorithms – ESA 2004
- An algorithm for the ranking of shortest paths
- Asymmetric variational inequality problems over product sets: Applications and iterative methods
- Computational study of state-of-the-art path-based traffic assignment algorithms
- Convex programming in Hilbert space
- Equilibrium, games, and pricing in transportation and telecommunication networks
- Evaluation of choice set generation algorithms for route choice models
- Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 4147426 (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?)
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Iterative methods for variational and complementarity problems
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Minimization of functions having Lipschitz continuous first partial derivatives
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
- Multi-objective and multi-constrained non-additive shortest path problems
- On the Goldstein-Levitin-Polyak gradient projection method
- On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
- Projection methods for variational inequalities with application to the traffic assignment problem
- Reformulating the traffic equilibrium problem via a smooth gap function.
- 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
- The Traffic Equilibrium Problem with Nonadditive Path Costs
Cited in
(23)- 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
- Highway toll pricing
- Solving nonadditive traffic assignment problems: a self-adaptive projection-auxiliary problem method for variational inequalities
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
- Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints
- Multi-class time reliability-based congestion pricing model based on a degradable transportation network
- Modeling mode and route similarities in network equilibrium problem with go-green modes
- A dual approach for solving the combined distribution and assignment problem with link capacity constraints
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem
- Numerical stability of path-based algorithms for traffic assignment
- Computation and application of the paired combinatorial logit stochastic user equilibrium problem
- A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
- A framework for and empirical study of algorithms for traffic assignment
- scientific article; zbMATH DE number 5733352 (Why is no real title available?)
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
- A conjugate gradient projection algorithm for the traffic assignment problem
- A simplified C-logit stochastic user equilibrium model on bimodal transportation network
- A unified gradient projection algorithm for solving both discrete and continuous multiclass bi-criteria traffic assignment problems
- Non-additive network pricing with non-cooperative mobility service providers
- A gradient projection algorithm based on the normal-S iterative algorithm: convergence analysis and machine learning application
- Gradient-based parameter identification algorithms for observer canonical state space systems using state estimates
This page was built for publication: A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761957)
