Single-assignment hub location problems with multiple capacity levels
In this paper, an extension of the classical capacitated single-allocation hub location problem is studied in which the size of the hubs is part of the decision making process. For each potential hub a set of capacities is assumed to be available among which one can be chosen. Several formulations are proposed for the problem, which are compared in terms of the bound provided by the linear programming relaxation. Different sets of inequalities are proposed to enhance the models. Several preprocessing tests are also presented with the goal of reducing the size of the models for each particular instance. The results of the computational experiments performed using the proposed models are reported.
Year of publication: |
2010
|
---|---|
Authors: | Correia, Isabel ; Nickel, Stefan ; Saldanha-da-Gama, Francisco |
Published in: |
Transportation Research Part B: Methodological. - Elsevier, ISSN 0191-2615. - Vol. 44.2010, 8-9, p. 1047-1066
|
Publisher: |
Elsevier |
Keywords: | Hub location Capacity decisions MILP formulations |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
The capacitated single-allocation hub location problem revisited : a note on a classical formulation
Correia, Isabel Horta, (2010)
-
Multi-product capacitated single-allocation hub location problems : formulations and inequalities
Correia, Isabel, (2014)
-
Single-allocation hub location problems with capacity choices
Correia, Isabel, (2009)
- More ...