An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
From MaRDI portal
Publication:1994496
DOI10.1016/j.apm.2013.10.003zbMath1427.90069OpenAlexW1974536311MaRDI QIDQ1994496
Publication date: 1 November 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2013.10.003
continuous network design problem (CNDP)multi-user classescutting constraint algorithm (CCA)mathematical programming with equilibrium constraint (MPEC)
Related Items (3)
A cutting plane projection method for bi-level area traffic control optimization with uncertain travel demand ⋮ Multi-class time reliability-based congestion pricing model based on a degradable transportation network ⋮ An anisotropic continuum model for traffic assignment in mixed transportation networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints
- A continuous bi-level model for the expansion of highway networks
- An MPEC approach to second-best toll pricing.
- A subgradient optimization model for continuous road network design problem
- Hybrid meta-heuristic algorithms for solving network design problem
- A meta-heuristic approach for solving the urban network design problem
- Efficient implementation of heuristics for the continuous network design problem
- Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Cost versus time equilibrium over a network
- Bilevel programming in traffic planning: Models, methods and challenge
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- A review of urban transportation network design problems
- A globally convergent algorithm for transportation continuous network design problem
- A general MPCC model and its solution algorithm for continuous network design problem
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- Optimization and nonsmooth analysis
- Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
- A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
- Problems of Hierarchical Optimization in Finite Dimensions
- A Mathematical Model and Descent Algorithm for Bilevel Traffic Management
- The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
- Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
This page was built for publication: An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
