An approximate algorithm for elastic demand traffic equilibrium assignment problems with link capacity constraints
From MaRDI portal
Publication:5497597
zbMATH Open1313.90046MaRDI QIDQ5497597FDOQ5497597
Authors: Chongchao Huang, Bing-quan Liu
Publication date: 11 February 2015
Recommendations
- A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
- A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand
- A novel algorithm for area traffic capacity control with elastic travel demands
- A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand
- Traffic assignment: equilibrium models
Approximation methods and heuristics in mathematical programming (90C59) Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)
Cited In (6)
- A power penalty method for the general traffic assignment problem with elastic demand
- A bi-level formula and quasi-Newtonian algorithm for stochastic equilibrium network design problem with elastic demand
- Title not available (Why is that?)
- A novel algorithm for area traffic capacity control with elastic travel demands
- A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
- A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand
This page was built for publication: An approximate algorithm for elastic demand traffic equilibrium assignment problems with link capacity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5497597)