A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels
In this paper we consider an extended version of the classical capacitated single allocation hub location problem in which the size of the hubs must be chosen from a finite and discrete set of allowable capacities. We develop a Lagrangian relaxation approach that exploits the problem structure and decomposes the problem into a set of smaller subproblems that can be solved efficiently. Upper bounds are derived by Lagrangian heuristics followed by a local search method. Moreover, we propose some reduction tests that allow us to decrease the size of the problem. Our computational experiments on some challenging benchmark instances from literature show the advantage of the decomposition approach over commercial solvers.
KeywordsHub location Capacity decisions Lagrangian relaxation
- 13.Meier, J.F., Clausen, U., Rostami, B., Buchheim, C.: A compact linearisation of Euclidean single allocation hub location problems. Electronic Notes in Discrete Mathematics Accepted for Publication (2015)Google Scholar
- 16.Rostami, B., Buchheim, C., Meier, J.F., Clausen, U.: Lower bounding procedures for the single allocation hub location problem. Electronic Notes in Discrete Mathematics Accepted for Publication (2015)Google Scholar
- 17.Rostami, B., Meier, J.F., Buchheim, C., Clausen, U.: The uncapacitated single allocation \(p\)-hub median problem with stepwise cost function. Technical report, Optimization Online (2015). http://www.optimization-online.org/DB_HTML/2015/07/5044.html