Robust optimization approach to capacitated single and multiple allocation hub location problems
From MaRDI portal
Publication:291363
DOI10.1007/S40314-014-0179-YzbMath1338.90211OpenAlexW2127061258MaRDI QIDQ291363
F. Blanchet-Sadri, M. Dambrine
Publication date: 7 June 2016
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-014-0179-y
uncertaintyfacility locationcapacitated single and multiple allocationhub location problemrobust optimization (RO)
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (10)
Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution ⋮ Benders decomposition applied to a robust multiple allocation incomplete hub location problem ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach ⋮ On hub location problems in geographically flexible networks ⋮ A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds ⋮ Adjustable robust balanced hub location problem with uncertain transportation cost ⋮ A single allocation hub location and pricing problem ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
Cites Work
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- An \(M/M/c\) queue model for hub covering location problem
- Stochastic uncapacitated hub location
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- Adapting polyhedral properties from facility to hub location problems
- Single-allocation ordered median hub location problems
- Stochastic air freight hub location and flight routes planning
- New formulations for the uncapacitated multiple allocation hub location problem
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Multiple allocation hub-and-spoke network design under hub congestion
- Tight bounds from a path based formulation for the tree of hub location problem
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- The stochastic \(p\)-hub center problem with service-level constraints
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Preprocessing and cutting for multiple allocation hub location problems.
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Solving large single allocation \(p\)-hub problems with two or three hubs
- A hybrid heuristic for the uncapacitated hub location problem
- A branch and cut algorithm for hub location problems with single assignment
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- Formulating and solving splittable capacitated multiple allocation hub location problems
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- Network hub location problems: The state of the art
- Capacitated single allocation hub location problem-A bi-criteria approach
- An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Projecting the flow variables for hub location problems
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- The single allocation problem in the interacting three-hub network
- HubLocator: An exact solution method for the multiple allocation hub location problem
- Unnamed Item
This page was built for publication: Robust optimization approach to capacitated single and multiple allocation hub location problems
