An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
type: Item
instance of: scholarly article
title: An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
zbMATH Open document ID: 1427.90069
author: Yanyan Li
published in: Applied Mathematical Modelling
publication date: 2018-11-01T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6970399
zbMATH Keywords: continuous network design problem (CNDP)
zbMATH Keywords: mathematical programming with equilibrium constraint (MPEC)
zbMATH Keywords: cutting constraint algorithm (CCA)
zbMATH Keywords: multi-user classes
describes a project that uses: GAMS
MaRDI profile type: Publication
full work available at URL: j.apm.2013.10.003
OpenAlex ID: W1974536311
cites work: Q4332850
cites work: Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
cites work: Optimization and nonsmooth analysis
cites work: Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
cites work: A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
cites work: Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
cites work: A general MPCC model and its solution algorithm for continuous network design problem
cites work: A Mathematical Model and Descent Algorithm for Bilevel Traffic Management
cites work: A review of urban transportation network design problems
cites work: Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
cites work: Cost versus time equilibrium over a network
cites work: Q4353544
cites work: Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
cites work: Q5687197
cites work: Problems of Hierarchical Optimization in Finite Dimensions
cites work: Q5538306
cites work: Q3134873
cites work: Bilevel programming in traffic planning: Models, methods and challenge
cites work: An MPEC approach to second-best toll pricing.
cites work: The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
cites work: Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
cites work: Efficient implementation of heuristics for the continuous network design problem
cites work: Hybrid meta-heuristic algorithms for solving network design problem
cites work: A meta-heuristic approach for solving the urban network design problem
cites work: Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints
cites work: A globally convergent algorithm for transportation continuous network design problem
cites work: A continuous bi-level model for the expansion of highway networks
cites work: A subgradient optimization model for continuous road network design problem
DOI: 10.1016/J.APM.2013.10.003
Recommended article: A general MPCC model and its solution algorithm for continuous network design problem
Recommended article: A class of network design problems with multiple demand: Model formulation and an algorithmic approach
Recommended article: A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem
Recommended article: Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
Recommended article: An Alternative LP Formulation of the Admission Control Problem in Multiclass Networks
Recommended article: Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
Recommended article: A branch-and-cut algorithm for capacitated network design problems
Recommended article: Benders, metric and cutset inequalities for multicommodity capacitated network design
Recommended article: Benders-and-cut algorithm for fixed-charge capacitated network design problem
Recommended article: The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
description: scientific article; zbMATH DE number 6970399