A branch and bound algorithm for bi-level discrete network design problem

DOI10.1007/s11067-012-9173-3zbMath1332.90351OpenAlexW2000900837MaRDI QIDQ264253

Hamid Farvaresh, Mohammad Mehdi Sepehri

Publication date: 31 March 2016

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-012-9173-3

zbMATH Keywords

branch and boundouter approximationbi-level programmingnetwork design problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (13)

A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions ⋮ The cost of environmental constraints in traffic networks: assessing the loss of optimality ⋮ A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design ⋮ A sustainable road network design problem with land use transportation interaction over time ⋮ Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem ⋮ An alternative approach for solving the environmentally-oriented discrete network design problem ⋮ Complex interactions in large government networks ⋮ A traffic restriction scheme for enhancing carpooling ⋮ A dynamic discrete network design problem for maintenance planning in traffic networks ⋮ BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems ⋮ Integrating link-based discrete credit charging scheme into discrete network design problem ⋮ An effective bilevel programming approach for the evasive flow capturing location problem ⋮ A multi-objective integrated model for selecting, scheduling, and budgeting road construction projects

Cites Work

• Unnamed Item
• Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks
• A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem
• Robust optimization model for a dynamic network design problem under demand uncertainty
• Hybrid meta-heuristic algorithms for solving network design problem
• Bilevel programming model and solution method for mixed transportation network design problem
• Solving mixed integer nonlinear programs by outer approximation
• Nonlinear integer programming
• Generalized Benders decomposition
• Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
• Origin-Based Algorithm for the Traffic Assignment Problem
• Using hybrid metaheuristics for the one-way and two-way network design problem

This page was built for publication: A branch and bound algorithm for bi-level discrete network design problem