Solving the combined modal split and traffic assignment problem with two types of transit impedance function
DOI10.1016/j.ejor.2016.08.019zbMath1394.90182OpenAlexW2512018295MaRDI QIDQ1752876
Seungkyu Ryu, Anthony Chen, Keechoo Choi
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.08.019
elastic demandgradient projectionuser equilibriumbi-modal networkscombined modal split and traffic assignment problem
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)
Related Items (4)
Uses Software
Cites Work
- A dual approach for solving the combined distribution and assignment problem with link capacity constraints
- 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
- 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 conjugate gradient projection algorithm for the traffic assignment problem
- Method of successive weighted averages (MSWA) and self-regulated averaging schemes for solving stochastic user equilibrium problem
- 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
- Computational study of state-of-the-art path-based traffic assignment algorithms
- A path-based gradient projection algorithm for the cost-based system optimum problem in networks with continuously distributed value of time
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- An improved origin-based algorithm for solving the combined distribution and assignment problem
- Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- On the Goldstein-Levitin-Polyak gradient projection method
- 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: Solving the combined modal split and traffic assignment problem with two types of transit impedance function