Solving a dynamic facility location problem with partial closing and reopening

Motivated by an industrial application, we consider a recently introduced multi-period facility location problem with multiple commodities and multiple capacity levels. The problem allows for the relocation of facilities, as well as for the temporary closing of parts of the facilities, while other p...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 67; s. 143 - 154
Hlavní autoři: Jena, Sanjay Dominik, Cordeau, Jean-François, Gendron, Bernard
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.03.2016
Pergamon Press Inc
Témata:
Commodities
Computing time
Demand
Dynamic capacity adjustment
Facility location
Heuristic
Industrial application
Integer programming
Lagrange multiplier
Lagrangian relaxation
Mathematical models
Mixed-integer programming
Operations research
Programming
Relocation of industry
Site selection
Studies
Facility location
Dynamic capacity adjustment
Lagrangian relaxation
Mixed-integer programming
Industrial application
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Motivated by an industrial application, we consider a recently introduced multi-period facility location problem with multiple commodities and multiple capacity levels. The problem allows for the relocation of facilities, as well as for the temporary closing of parts of the facilities, while other parts remain open. In addition, it uses particular capacity constraints that involve integer rounding of the allocated demands. In this paper, we propose a strong formulation for the problem, as well as a hybrid heuristic that first applies Lagrangian relaxation and then constructs a restricted mixed-integer programming model based on the previously obtained Lagrangian solutions. Computational results for large-scale instances emphasize the usefulness of the heuristic in practice. While general-purpose mixed-integer programming solvers do not find feasible solutions for about half of the instances, the heuristic consistently provides high-quality solutions in short computing times, as well as tight bounds on their optimality. •We provide a new formulation for a complex multi-period facility location that allows for the partial closing and reopening of facilities.•The new formulation provides integrality gaps that are, on average, 29 times smaller than those of traditional formulations.•We develop a Lagrangian relaxation based heuristic, able to solve large-scale problem instances for which state-of-the-art mixed integer programming solvers do not find feasible solutions.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2015.10.011