Journal
TRANSPORTATION SCIENCE
Volume 46, Issue 4, Pages 439-459Publisher
INFORMS
DOI: 10.1287/trsc.1110.0398
Keywords
hub location; Benders decomposition; Pareto-optimal cuts; elimination tests
Categories
Funding
- Canadian Natural Sciences and Engineering Research Council [227837-09, 39682-10]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available