A dual approach for solving the combined distribution and assignment problem with link capacity constraints
DOI10.1007/s11067-013-9218-2zbMath1332.90141OpenAlexW2082590182MaRDI QIDQ264302
Anthony Chen, Keechoo Choi, Xiangdong Xu, Seungkyu Ryu
Publication date: 31 March 2016
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-013-9218-2
capacity constraintscombined distribution and assignment problemdual approachiterative balancingside constraints
Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Management decision making, including multiple objectives (90B50) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items (8)
Cites Work
- Unnamed Item
- Combined model calibration and spatial aggregation
- An integrated behavioral model of land use and transport system: A hyper-network equilibrium approach
- Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model
- Entropy optimization and mathematical programming
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- Algorithms for computing traffic equilibria
- Multiclass combined models for urban travel forecasting
- On the convergence of descent methods for monotone variational inequalities
- Network-based accessibility measures for vulnerability analysis of degradable transportation networks
- A multiclass simultaneous transportation equilibrium model
- Comparisons of urban travel forecasts prepared with the sequential procedure and a combined model
- Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models
- A model for evaluation of transport policies in multimodal networks with road and parking capacity constraints
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
This page was built for publication: A dual approach for solving the combined distribution and assignment problem with link capacity constraints