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

DOI10.1007/S11067-012-9173-3zbMATH Open1332.90351OpenAlexW2000900837MaRDI QIDQ264253FDOQ264253

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

Recommendations

• A modified active set algorithm for transportation discrete network design bi-level problem
• Bicriterion discrete equilibrium network design problem
• BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems
• A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem
• Methodological Advances and New Formulations for Bilevel Network Design Problems

zbMATH Keywords

outer approximationbi-level programmingbranch and boundnetwork 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)

Cites Work

• Title not available (Why is that?)
• Solving mixed integer nonlinear programs by outer approximation
• Nonlinear integer programming
• Generalized Benders decomposition
• Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks
• 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
• 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

Cited In (18)

• Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
• A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions
• A sustainable road network design problem with land use transportation interaction over time
• Integrating link-based discrete credit charging scheme into discrete network design problem
• Bi-level programming for emergency blood transshipment-allocation considering substitution against public health events
• A multi-objective integrated model for selecting, scheduling, and budgeting road construction projects
• A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
• The cost of environmental constraints in traffic networks: assessing the loss of optimality
• A dynamic discrete network design problem for maintenance planning in traffic networks
• An effective bilevel programming approach for the evasive flow capturing location problem
• Bicriterion discrete equilibrium network design problem
• Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem
• Complex interactions in large government networks
• An alternative approach for solving the environmentally-oriented discrete network design problem
• Methodological Advances and New Formulations for Bilevel Network Design Problems
• A traffic restriction scheme for enhancing carpooling
• A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
• BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264253)