G-2003-64
Primal-Dual Variable Neighborhood Search for the Simple Plant Location Problem
Pierre Hansen, Jack Brimberg, Dragan Urosević et Nenad Mladenović
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; (iii) exact solution of instances with variable fixed costs and up to m = n = 15, 000.
Paru en octobre 2003 , 32 pages
Ce cahier a été révisé en avril 2005