Integrating link-based discrete credit charging scheme into discrete network design problem
From MaRDI portal
Publication:1991119
DOI10.1016/j.ejor.2018.05.069zbMath1403.90180OpenAlexW2807398977MaRDI QIDQ1991119
Meng Xu, Zi-You Gao, Guang-Min Wang
Publication date: 30 October 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.069
transportationbilevel programming problemdiscrete network design problem (DNDP)tradable credit scheme (TCS)
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs ⋮ BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems ⋮ Optimal design of differentiated credit charging links in mixed-autonomy transportation networks
Cites Work
- Unnamed Item
- A branch and bound algorithm for bi-level discrete network design problem
- Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem
- Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints
- A framework for and empirical study of algorithms for traffic assignment
- Parametric integer programming algorithm for bilevel mixed integer programs
- Nonlinear integer bilevel programming
- Foundations of bilevel programming
- An alternative approach for solving the environmentally-oriented discrete network design problem
- A dynamic discrete network design problem for maintenance planning in traffic networks
- A single-level reformulation of mixed integer bilevel programming problems
- Global solution of nonlinear mixed-integer bilevel programs
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- A review of urban transportation network design problems
- An overview of bilevel optimization
- Global optimization of mixed-integer bilevel programming problems
- Practical Optimization
- Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
