Approximation of the steepest descent direction for the O-D matrix adjustment problem

DOI10.1007/s10479-006-0007-xzbMath1159.90331OpenAlexW2090256989WikidataQ61736118 ScholiaQ61736118MaRDI QIDQ867565

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

zbMATH Keywords

regularizationtraffic assignmentbilevel programmingpartial linearization algorithmdemand adjustment

Mathematics Subject Classification ID

Nonlinear programming (90C30) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Related Items (6)

A heuristic for the OD matrix adjustment problem in a congested transport network ⋮ A column generation algorithm for the estimation of origin-destination matrices in congested traffic networks ⋮ Traffic sensor location using Wardrop equilibrium ⋮ The demand adjustment problem via inexact restoration method ⋮ Bilevel road pricing: theoretical analysis and optimality conditions ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to sensitivity and stability analysis in nonlinear programming
• Derivative evaluation and computational experience with large bilevel mathematical programs
• Hierarchical optimization: An introduction
• Practical bilevel optimization. Algorithms and applications
• Partial linearization methods in nonlinear programming
• A survey of some mathematical programming models in transportation
• Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
• Ample Parameterization of Variational Inclusions
• Sensitivity analysis for the asymmetric network equilibrium problem
• Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets
• Optimization and nonsmooth analysis
• Restricted simplicial decomposition: Computation and extensions
• Sensitivity Analysis for Equilibrium Network Flow
• Sensitivity analysis for nonlinear programming using penalty methods
• Variational Analysis
• Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
• Sensitivity Analysis in Nonlinear Programs and Variational Inequalities via Continuous Selections

This page was built for publication: Approximation of the steepest descent direction for the O-D matrix adjustment problem