Journal Article10.1002/(SICI)1097-0037(199609)28:2<117::AID-NET5>3.0.CO;2-H
Solving the dynamic facility location problem
75
TL;DR: In this article, the authors considered the multi-period, or dynamic, uncapacited facility location problem (DUFLP), where the demand varies between time-periods and the solution should answer the questions of where and when establish facilities.
read more
Abstract: This paper addresses with the multiperiod, or dynamic, uncapacited facility location problem (DUFLP): The demand varies between time-periods and the solution should answer the questions of where and when establish facilities. We modelize the problem as a 0–1 quadratic program and, since the DUFLP is NP-hard, we focus on methods for generating heuristic solutions (by simulated annealing) and good lower bounds (by Lagrangian relaxation). We prove that our bound is equal to the optimal solution of the continuous relaxation of a linearization of the initial program. Then we show that the method can take into account some additional costs needed to solve some practical problems arising in telecommunication and intelligent networks. Finally, we present experimental results: The small size of the duality gaps explains the good quality of the obtained solutions. © 1996 John Wiley & Sons, Inc.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities
TL;DR: This paper proposes Lagrangian heuristics, based on subgradient and bundle methods, to find good quality solutions for large-scale instances with up to 250 facility locations and 1,000 customers, and proposes a restricted MIP model that is solved based on the information collected through the solution of thelagrangian dual.
Computational comparison of two formulations for dynamic supply chain reconfiguration with capacity expansion and contraction
TL;DR: Research objectives of this paper are a traditional formulation and a network-based model of the DSCR problem, tests to promote intuitive interpretation of the models, and tests to identify computational characteristics of each model to determine if one offers superior solvability.
50
Dynamic location of modular manufacturing facilities with relocation of individual modules
Andrew Allman,Qi Zhang +1 more
TL;DR: This work presents a generic mixed-integer linear programming (MILP) framework for determining optimal location and relocation of mobile production modules given time-varying demands, and introduces a new metric, the value of module mobility, to quantify the economic benefits of mobileproduction modules.
45
Heuristics for the dynamic facility location problem with modular capacities
TL;DR: For the scenarios where construction costs are higher and module sizes are lower, the GA+VND proved to be effective to solve the problem, outperforming the LRH and the MIP.
44
Facility Location and Supply Chain Management – A comprehensive review
T. Melo,Stefan Nickel,F. Saldanha da Gama +2 more
- 01 Jan 2007
TL;DR: An extensive literature review of facility location models in the context of supply chain management is given in this paper, where the authors identify basic features that such models must capture to support decision-making involved in strategic supply chain planning.
39
References
The uncapacitated facility location problem
Gérard Cornuéjols,George L. Nemhauser,Lairemce A Wolsey +2 more
- 01 Jan 1990
TL;DR: The capacitated facility location problem as discussed by the authors is an economic problem of great practical importance, where the goal is to choose the location of facilities such as industrial plants or warehouses, in order to minimize the cost (or maximize the profit) of satisfying the demand for some commodity.
596
A Dual-Based Procedure for Dynamic Facility Location
TL;DR: A branch-and-bound procedure incorporating a dual ascent method is presented and shown to be superior to previously developed methods and comparable to the most efficient methods for solving static single-period location problems.