A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
From MaRDI portal
Publication:5954824
DOI10.1016/S0377-2217(00)00287-3zbMath1077.90516WikidataQ59297308 ScholiaQ59297308MaRDI QIDQ5954824
Hai Yang, Anthony Chen, Hong Kam Lo
Publication date: 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (16)
Modeling mode and route similarities in network equilibrium problem with go-green modes ⋮ Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model ⋮ Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities ⋮ Solving the dynamic user optimal assignment problem considering queue spillback ⋮ Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size ⋮ Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs ⋮ Applications of sensitivity analysis for probit stochastic network equilibrium ⋮ A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost ⋮ A power penalty method for the general traffic assignment problem with elastic demand ⋮ 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 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 ⋮ Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model ⋮ Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints ⋮ Two new self-adaptive projection methods for variational inequality problems
Cites Work
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- On a class of iterative projection and contraction methods for linear programming
- Solving a class of linear projection equations
- A new method for a class of linear variational inequalities
- A class of iterative methods for solving nonlinear projection equations
- Network economics: a variational inequality approach
- A class of projection and contraction methods for monotone variational inequalities
- An approach to nonlinear programming
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- A special newton-type optimization method
- Modified Projection-Type Methods for Monotone Variational Inequalities
- On the basic theorem of complementarity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
