Approximation of the steepest descent direction for the O-D matrix adjustment problem
DOI10.1007/S10479-006-0007-XzbMATH Open1159.90331DBLPjournals/anor/CodinaM06OpenAlexW2090256989WikidataQ61736118 ScholiaQ61736118MaRDI QIDQ867565FDOQ867565
Authors: Esteve Codina, Lídia Montero
Publication date: 15 February 2007
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0007-x
Recommendations
- Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions.
- New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks
- scientific article; zbMATH DE number 1057913
- A heuristic for the OD matrix adjustment problem in a congested transport network
- scientific article; zbMATH DE number 966589
Nonlinear programming (90C30) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Cites Work
- Variational Analysis
- Practical bilevel optimization. Algorithms and applications
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Partial linearization methods in nonlinear programming
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets
- Sensitivity Analysis for Equilibrium Network Flow
- Introduction to sensitivity and stability analysis in nonlinear programming
- Title not available (Why is that?)
- Sensitivity analysis for nonlinear programming using penalty methods
- Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
- Sensitivity analysis for the asymmetric network equilibrium problem
- Hierarchical optimization: An introduction
- Sensitivity Analysis in Nonlinear Programs and Variational Inequalities via Continuous Selections
- Restricted simplicial decomposition: Computation and extensions
- Derivative evaluation and computational experience with large bilevel mathematical programs
- Ample parameterization of variational inclusions
- A survey of some mathematical programming models in transportation
Cited In (8)
- A heuristic for the OD matrix adjustment problem in a congested transport network
- Title not available (Why is that?)
- Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions.
- Bilevel road pricing: theoretical analysis and optimality conditions
- The demand adjustment problem via inexact restoration method
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Traffic sensor location using Wardrop equilibrium
- A column generation algorithm for the estimation of origin-destination matrices in congested traffic networks
This page was built for publication: Approximation of the steepest descent direction for the O-D matrix adjustment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867565)