A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
From MaRDI portal
Publication:2029917
DOI10.1016/j.ejor.2020.08.058zbMath1487.90211OpenAlexW3083123646MaRDI QIDQ2029917
Muqing Du, Anthony Chen, Heqing Tan
Publication date: 4 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.08.058
transportationstochastic user equilibriumBarzilai-Borwein step sizecross-nested logitpath-based traffic assignment algorithm
Numerical mathematical programming methods (65K05) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Related Items
Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size ⋮ A stochastic user equilibrium formulation for the cumulative prospect theory-based cross-nested logit ⋮ Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints
Cites Work
- Unnamed Item
- Exploring trust region method for the solution of logit-based stochastic user equilibrium problem
- Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model
- A sustainable road network design problem with land use transportation interaction over time
- 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
- Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
- Some projection methods with the BB step sizes for variational inequalities
- A comparative study of some macroscopic link models used in dynamic traffic assignment
- Method of successive weighted averages (MSWA) and self-regulated averaging schemes for solving stochastic user equilibrium problem
- A multiclass, multicriteria logit-based traffic equilibrium assignment model under ATIS
- Robust improvement schemes for road networks under demand uncertainty
- Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model
- Sensitivity analysis of the combined travel demand model with applications
- New method of stochastic approximation type
- Cost versus time equilibrium over a network
- 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
- Improving truncated Newton method for the logit-based stochastic user equilibrium problem
- A derivative-free iterative method for nonlinear monotone equations with convex constraints
- Modeling mode and route similarities in network equilibrium problem with go-green modes
- An efficient computation algorithm for area traffic control problem with link capacity expansions
- An improved origin-based algorithm for solving the combined distribution and assignment problem
- Minimization of functions having Lipschitz continuous first partial derivatives
- Stochastic equilibrium assignment with variable demand: theoretical and implementation issues
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Two-Point Step Size Gradient Methods
- On the Goldstein-Levitin-Polyak gradient projection method
- Numerical Optimization
- Origin-Based Algorithm for the Traffic Assignment Problem
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- On the Barzilai and Borwein choice of steplength for the gradient method
- Multidimensional Stochastic Approximation Methods
- A bi-level formula and quasi-Newtonian algorithm for stochastic equilibrium network design problem with elastic demand
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
