A heuristic for the OD matrix adjustment problem in a congested transport network
DOI10.1016/J.EJOR.2014.11.009zbMath1341.90028OpenAlexW2076550881MaRDI QIDQ2630227
Jorgelina Walpen, Elina M. Mancinelli, Pablo A. Lotito
Publication date: 26 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.11.009
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Approximation of the steepest descent direction for the O-D matrix adjustment problem
- Partial linearization methods in nonlinear programming
- Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions.
- On the convergence of descent methods for monotone variational inequalities
- A column generation algorithm for the estimation of origin-destination matrices in congested traffic networks
- New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks
- Issues in the implementation of the DSD algorithm for the traffic assignment problem
- Sensitivity analysis for the asymmetric network equilibrium problem
- Optimization and nonsmooth analysis
- A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates
This page was built for publication: A heuristic for the OD matrix adjustment problem in a congested transport network