Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem

Authors:
Pierre Hansen;Jack Brimberg;Dragan Urošević;Nenad Mladenović
Affiliations:
GERAD and HEC Montréal, Montréal, Quebéc H3T 2A7, Canada;GERAD and Royal Military College of Canada, Kingston, Ontario K7K 5L0, Canada;Mathematical Institute, SANU, Belgrade, Serbia;School of Mathematics, Brunel University, West London, Uxbridge UB8 3PH, United Kingdom
Venue:
INFORMS Journal on Computing
Year:
2007

Citing 0
Cited 5

Fast bounding procedures for large instances of the Simple Plant Location Problem

Computers and Operations Research
An aggregation heuristic for large scale p-median problem

Computers and Operations Research
A new primal-dual genetic algorithm: case study for the winner determination problem

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
A genetic algorithm hybridized with the discrete lagrangian method for trap escaping

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
A General VNS heuristic for the traveling salesman problem with time windows

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

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.