Authors: | Hansen, Pierre Brimberg, Jack Urošević, Dragan Mladenović, Nenad |
Affiliations: | Mathematical Institute of the Serbian Academy of Sciences and Arts | Title: | Primal-dual variable neighborhood search for the simple plant-location problem | Journal: | INFORMS Journal on Computing | Volume: | 19 | Issue: | 4 | First page: | 552 | Last page: | 564 | Issue Date: | 1-Jan-2007 | Rank: | M21a | ISSN: | 1091-9856 | DOI: | 10.1287/ijoc.1060.0196 | Abstract: | The variable neighborhood search metaheuristic is applied to the primal simple plant-location problem and to a reduced dual obtained by exploiting the complementary slackness conditions. This leads to (i) heuristic resolution of (metric) instances with uniform fixed costs, up to n = 15,000 users, and m = n potential locations for facilities with an error not exceeding 0.04%; (ii) exact solution of such instances with up to m = n = 7,000; and (iii) exact solutions of instances with variable fixed costs and up to m = n = 15,000. |
Keywords: | Branch and bound | Metaheuristics | Primal-dual methods | Simple plant-location problem | Variable-neighborhood search | Publisher: | INFORMS |
Show full item record
SCOPUSTM
Citations
46
checked on Nov 11, 2024
Page view(s)
22
checked on Nov 11, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.