Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints

DOI10.1016/j.cor.2012.11.010zbMath1348.90164OpenAlexW2057216460MaRDI QIDQ336802

Huijun Sun, Meng Xu, Zi-You Gao, Guang-Min Wang

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.11.010

zbMATH Keywords

relaxation algorithmequitybilevel programming problemtradable credit schemecontinuous network design problem (CNDP)

Mathematics Subject Classification ID

Hierarchical games (including Stackelberg games) (91A65) Deterministic network models in operations research (90B10)

Related Items (13)

The combination of continuous network design and route guidance ⋮ Managing congestion and emissions in transportation networks with dynamic carbon credit charge scheme ⋮ Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs ⋮ Multi-stage optimal design of road networks for automated vehicles with elastic multi-class demand ⋮ Managing rush hour congestion with Lane reversal and tradable credits ⋮ Optimal tradable credits scheme and congestion pricing with the efficiency analysis to congestion ⋮ Integrating link-based discrete credit charging scheme into discrete network design problem ⋮ An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes ⋮ Uncertain random multilevel programming with application to production control problem ⋮ Tradable credit scheme for control of evolutionary traffic flows to system optimum: model and its convergence ⋮ A multi-objective integrated model for selecting, scheduling, and budgeting road construction projects ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Optimal design of differentiated credit charging links in mixed-autonomy transportation networks

Uses Software

• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Bilevel programming: a survey
• Some properties of the bilevel programming problem
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Practical bilevel optimization. Algorithms and applications
• Descent approaches for quadratic bilevel programming
• Bilevel and multilevel programming: A bibliography review
• Multilevel optimization: algorithms and applications
• Foundations of bilevel programming
• Transaction costs and tradeable permits
• Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
• A general MPCC model and its solution algorithm for continuous network design problem
• Mathematical and computational models for congestion charging.
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• Complementarity constraints as nonlinear equations: Theory and numerical experience
• Computational Difficulties of Bilevel Linear Programming
• 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
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• The nonlinear bilevel programming problem:formulations,regularity and optimality conditions

This page was built for publication: Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints