Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
Pierre Hansen, Jack Brimberg, Dragan Urošević, Nenad Mladenović
INFORMS Journal on Computing · 2007 · Volume 19 · Issue 4
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
metaheuristics, variable-neighborhood search, primal-dual methods, branch and bound, simple plant-location problem
Enable JavaScript for citation tools and additional paper interactions.