The demand adjustment problem via inexact restoration method

DOI10.1007/S40314-020-01189-5zbMATH Open1463.90042OpenAlexW3040979342WikidataQ113105479 ScholiaQ113105479MaRDI QIDQ2196267FDOQ2196267

Authors Jorgelina Walpen, P. A. Lotito, Elina M. Mancinelli, Lisandro A. Parente 

Publication date 28 August 2020

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.01213

zbMATH Keywords

trafficbilevel problemorigin-destination matrix adjustmentinexact restoration method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Traffic problems in operations research (90B20)

Abstract: In this work, the demand Adjustment Problem (DAP) associated to urban traffic planning is studied. The framework for the formulation of the DAP is mathematical programming with equilibrium constraints. In particular, if the optimization program associated to the equilibrium constraints is considered, the DAP results in a bilevel optimization problem. In this approach the DAP via the Inexact Restoration method is treated.

Recommendations

• A heuristic for the OD matrix adjustment problem in a congested transport network
• scientific article; zbMATH DE number 1163105
• scientific article; zbMATH DE number 1057913
• An inexact-restoration method for nonlinear bilevel programming problems
• A survey of some mathematical programming models in transportation

Cites Work

• scientific article; zbMATH DE number 1057913 (Why is no real title available?)
• scientific article; zbMATH DE number 2221957 (Why is no real title available?)
• A heuristic for the OD matrix adjustment problem in a congested transport network
• A practical optimality condition without constraint qualifications for nonlinear programming
• Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions.
• An inexact-restoration method for nonlinear bilevel programming problems
• Approximation of the steepest descent direction for the O-D matrix adjustment problem
• Inexact-restoration algorithm for constrained optimization
• Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
• Lifting mathematical programs with complementarity constraints
• On the convergence of descent methods for monotone variational inequalities
• Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
• Solution of a truss topology bilevel programming problem by means of an inexact restoration method
• Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
• Two-phase model algorithm with global convergence for nonlinear programming

Cited In (6)

• A heuristic for the OD matrix adjustment problem in a congested transport network
• The total adjustment cost problem: applications, models, and solution algorithms
• Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints
• Inexact-restoration modelling with monotone interpolation and parameter estimation
• Inexact restoration for derivative-free expensive function minimization and applications
• Traffic sensor location using Wardrop equilibrium

Uses Software

• CiudadSim

This page was built for publication: The demand adjustment problem via inexact restoration method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2196267)