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

DOI10.1007/S10479-006-0007-XMaRDI QIDQ867565zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

regularizationbilevel programmingpartial linearization algorithmtraffic assignmentdemand adjustment

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 3577030 (Why is no real title available?)
• scientific article; zbMATH DE number 1218462 (Why is no real title available?)
• A survey of some mathematical programming models in transportation
• Ample parameterization of variational inclusions
• Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
• Derivative evaluation and computational experience with large bilevel mathematical programs
• Hierarchical optimization: An introduction
• Introduction to sensitivity and stability analysis in nonlinear programming
• Optimization and nonsmooth analysis
• Partial linearization methods in nonlinear programming
• Practical bilevel optimization. Algorithms and applications
• Restricted simplicial decomposition: Computation and extensions
• Sensitivity Analysis for Equilibrium Network Flow
• Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets
• Sensitivity Analysis in Nonlinear Programs and Variational Inequalities via Continuous Selections
• Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
• Sensitivity analysis for nonlinear programming using penalty methods
• Sensitivity analysis for the asymmetric network equilibrium problem
• Variational Analysis

Cited in

(8)

• Traffic sensor location using Wardrop equilibrium
• A heuristic for the OD matrix adjustment problem in a congested transport network
• scientific article; zbMATH DE number 966589 (Why is no real title available?)
• 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
• 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)