Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/5490
Title: | Efficient primal-dual heuristic for a dynamic location problem | Authors: | Dias, Joana Captivo, M. Eugénia Clímaco, João |
Keywords: | Location; Heuristics; Branch and bound | Issue Date: | 2007 | Citation: | Computers & Operations Research. 34:6 (2007) 1800-1823 | Abstract: | In this paper the dynamic location problem with opening, closure and reopening of facilities is formulated and an efficient primal-dual heuristic that computes both upper and lower limits to its optimal solution is described. The problem here studied considers the possibility of reconfiguring any location more than once over the planning horizon. This problem is NP-hard (the simple plant location problem is a special case of the problem studied). A primal-dual heuristic based on the work of Erlenkotter [A dual-based procedure for uncapacitated facility location. Operations Research 1978;26:992-1009] and Van Roy and Erlenkotter [A dual-based procedure for dynamic facility location. Management Science 1982;28:1091-105] was developed and tested over a set of randomly generated test problems. The results obtained are quite good, both in terms of the quality of lower and upper bounds calculated as in terms of the computational time spent by the heuristic. A branch-and-bound procedure that enables to optimize the problem is also described and tested over the same set of randomly generated problems. | URI: | https://hdl.handle.net/10316/5490 | DOI: | 10.1016/j.cor.2005.07.005 | Rights: | openAccess |
Appears in Collections: | FEUC- Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
filee7401603620749e6a734f82b1cb7b710.pdf | 273.01 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
51
checked on Sep 9, 2024
WEB OF SCIENCETM
Citations
49
checked on Sep 2, 2024
Page view(s) 50
415
checked on Sep 10, 2024
Download(s) 20
911
checked on Sep 10, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.