A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
From MaRDI portal
Publication:1761957
DOI10.1016/j.cor.2011.02.018zbMath1251.90083OpenAlexW2077315737MaRDI QIDQ1761957
Zhong Zhou, Anthony Chen, Xiangdong Xu
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.02.018
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Traffic problems in operations research (90B20)
Related Items (14)
A dual approach for solving the combined distribution and assignment problem with link capacity constraints ⋮ Modeling mode and route similarities in network equilibrium problem with go-green modes ⋮ 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 ⋮ Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size ⋮ Highway toll pricing ⋮ 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 ⋮ Multi-class time reliability-based congestion pricing model based on a degradable transportation network ⋮ Gradient-based parameter identification algorithms for observer canonical state space systems using state estimates ⋮ Numerical stability of path-based algorithms for traffic assignment ⋮ Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-objective and multi-constrained non-additive shortest path problems
- Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
- Evaluation of choice set generation algorithms for route choice models
- An algorithm for the ranking of shortest paths
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Reformulating the traffic equilibrium problem via a smooth gap function.
- Computational study of state-of-the-art path-based traffic assignment algorithms
- A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
- Equilibrium, games, and pricing in transportation and telecommunication networks
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- A class of projection and contraction methods for asymmetric linear variational inequalities and their relations to Fukushima's descent method
- Minimization of functions having Lipschitz continuous first partial derivatives
- Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions
- Asymmetric variational inequality problems over product sets: Applications and iterative methods
- Projection methods for variational inequalities with application to the traffic assignment problem
- Iterative methods for variational and complementarity problems
- On the Goldstein-Levitin-Polyak gradient projection method
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- A special newton-type optimization method
- On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Algorithms – ESA 2004
- Convex programming in Hilbert space
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
This page was built for publication: A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
