M.G.C. Resende and R.F. Werneck
Annals of Operations Research, vol. 150, pp. 205-230, 2007 [doi:10.1007/s10479-006-0154-0]
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 it does not have a better worst-case complexity, 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.
PDF file of full paper
DJVU file of full paper
Mauricio G.C. Resende's Home PageLast modified: 12 June 2008