A multiplier adjustment method for the generalized assignment problem
Management Science
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
An Exact Solution Approach Based on Shortest-Paths for P-Hub Median Problems
INFORMS Journal on Computing
A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
Transportation Science
A branch and cut algorithm for hub location problems with single assignment
Mathematical Programming: Series A and B
Adapting polyhedral properties from facility to hub location problems
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Computers and Operations Research
Computers and Operations Research
Benders decomposition for the uncapacitated multiple allocation hub location problem
Computers and Operations Research
Star p-hub median problem with modular arc capacities
Computers and Operations Research
Capacitated single allocation hub location problem-A bi-criteria approach
Computers and Operations Research
Benders Decomposition for Hub Location Problems with Economies of Scale
Transportation Science
Solving the hub location problem with modular link capacities
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Formulating and solving splittable capacitated multiple allocation hub location problems
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
INFORMS Journal on Computing
The Dynamic Uncapacitated Hub Location Problem
Transportation Science
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
INFORMS Journal on Computing
Benders Decomposition for Large-Scale Uncapacitated Hub Location
Operations Research
The integer L-shaped method for stochastic integer programs with complete recourse
Operations Research Letters
Hi-index | 0.00 |
This paper presents an extension of the classical capacitated hub location problem with multiple assignments in which the amount of capacity installed at the hubs is part of the decision process. An exact algorithm based on a Benders decomposition of a strong path-based formulation is proposed to solve large-scale instances of two variants of the problem: the splittable and nonsplittable commodities cases. The standard decomposition algorithm is enhanced through the inclusion of features such as the generation of strong optimality cuts and the integration of reduction tests. Given that in the nonsplittable case the resulting subproblem is an integer program, we develop an efficient enumeration algorithm. Extensive computational experiments are performed to evaluate the efficiency and robustness of the proposed algorithms. Computational results obtained on benchmark instances with up to 300 nodes and five capacity levels confirm their efficiency.