论文信息 - On the implementation of a swap-based local search procedure for the p -median problem ∗

On the implementation of a swap-based local search procedure for the p -median problem ∗

We present a new implementation of a widely used swap-based local search procedure for the p-median problem. It produces the same output as the best implementation described in the literature and has the same worst-case complexity, but, through the use of extra memory, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed.

Mauricio G. C. Resende | Renato F. Werneck | M. Resende | M. G. Resende

[1] Kenneth E. Rosing,et al. An Empirical Investigation of the Effectiveness of a Vertex Substitution Heuristic , 1997 .

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] Takuji Nishimura,et al. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[4] R. A. Whitaker,et al. A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems , 1983 .

[5] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[6] J. Beasley. A note on solving large p-median problems , 1985 .

[7] Mikkel Thorup,et al. Quick k-Median, k-Center, and Facility Location for Sparse Graphs , 2001, SIAM J. Comput..

[8] C. Revelle,et al. Heuristic concentration: Two stage solution construction , 1997 .

[9] Polly Bart,et al. Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[10] J. Current,et al. An efficient tabu search procedure for the p-Median Problem , 1997 .

[11] P. Hansen,et al. Variable neighborhood search for the p-median , 1997 .

[12] Pierre Hansen,et al. Variable Neighborhood Decomposition Search , 1998, J. Heuristics.