Optimization Online


A decomposition approach for single allocation hub location problems with multiple capacity levels

Borzou Rostami(borzou.rostami***at***math.tu-dortmund.de)
Christopher Strothmann(christopher.strothmann***at***tu-dortmund.de )
Christoph Buchheim(christoph.buchheim***at***math.tu-dortmund.de )

Abstract: 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 Lagrangean 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.

Keywords: Hub location, Capacity decisions, Lagrangian relaxation

Category 1: Combinatorial Optimization

Category 2: Applications -- OR and Management Sciences


Download: [PDF]

Entry Submitted: 02/24/2016
Entry Accepted: 02/24/2016
Entry Last Modified: 02/24/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society