Author(s):
Dias, Joana 
; Captivo, M. ; Clímaco, João
Date: 2008
Persistent ID: http://hdl.handle.net/10316/7912
Origin: Estudo Geral - Universidade de Coimbra
Document details
A dynamic location problem with maximum decreasing capacities
Description
Abstract In this paper a capacitated dynamic location problem with opening, closure and reopening of facilities is formulated and a primal-dual heuristic that can solve this problem is described. The problem formulated considers the situation where a facility is open (or reopens) with a certain maximum capacity that decreases as clients are assigned to that facility during its operating periods. This problem is NP-hard. Computational results are presented and discussed. http://dx.doi.org/10.1007/s10100-008-0055-1
Abstract In this paper a capacitated dynamic location problem with opening, closure and reopening of facilities is formulated and a primal-dual heuristic that can solve this problem is described. The problem formulated considers the situation where a facility is open (or reopens) with a certain maximum capacity that decreases as clients are assigned to that facility during its operating periods. This problem is NP-hard. Computational results are presented and discussed. http://dx.doi.org/10.1007/s10100-008-0055-1
Document Type
Article
Language English
Language English
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||