A fast swap-based local search procedure for location problems

A fast swap-based local search procedure for location problems

0.00 Avg rating0 Votes
Article ID: iaor20073210
Country: Netherlands
Volume: 150
Issue: 1
Start Page Number: 205
End Page Number: 230
Publication Date: Mar 2007
Journal: Annals of Operations Research
Authors: ,
Keywords: heuristics: local search
Abstract:

We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We also show that our method can be easily adapted to handle the facility location problem and to implement related procedures, such as path-relinking and tabu search.

Reviews

Required fields are marked *. Your email address will not be published.