A fast swap-based local search procedure for location problems

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.

[1]  Michael C. Fu,et al.  Guest editorial , 2003, TOMC.

[2]  M. J. Hodgson.  Toward More Realistic Allocation in Location—Allocation Models: An Interaction Approach , 1978 .

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

[4]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[5]  Luiz Antonio Nogueira Lorena,et al.  Lagrangean/Surrogate Heuristics for p-Median Problems , 2000 .

[6]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[7]  Belén Melián-Batista,et al.  Parallelization of the scatter search for the p-median problem , 2003, Parallel Comput..

[8]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

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

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

[11]  Francesco E. Maranzana,et al.  On the Location of Supply Points to Minimize Transportation Costs , 1963, IBM Syst. J..

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

[13]  L. A. Lorena,et al.  Stabilizing column generation using Lagrangean/surrogate relaxation: an application to p-median location problems , 2003 .

[14]  K. E. Rosing,et al.  The p-Median and its Linear Programming Relaxation: An Approach to Large Problems , 1979 .

[15]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[16]  Igor Vasil'ev,et al.  Computational study of large-scale p-Median problems , 2007, Math. Program..

[17]  Éric D. Taillard,et al.  Heuristic Methods for Large Centroid Clustering Problems , 2003, J. Heuristics.

[18]  Kamesh Munagala,et al.  Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

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

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

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

[22]  Olivier Briant,et al.  The Optimal Diversity Management Problem , 2004, Oper. Res..

[23]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[24]  Mauricio G. C. Resende,et al.  On the implementation of a swap-based local search procedure for the p -median problem ∗ , 2002 .

[25]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[26]  Celso C. Ribeiro,et al.  GRASP with Path-Relinking: Recent Advances and Applications , 2005 .

[27]  Igor Vasil'ev,et al.  A heuristic for large-scale p-median instances , 2003, Electron. Notes Discret. Math..

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

[29]  Roberto D. Galvão,et al.  A Dual-Bounded Algorithm for the p-Median Problem , 1980, Oper. Res..

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

[31]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[32]  Luiz Antonio Nogueira Lorena,et al.  A branch-and-price approach to p-median location problems , 2005, Comput. Oper. Res..

[33]  Kamesh Munagala,et al.  Local search heuristic for k-median and facility location problems , 2001, STOC '01.

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

[35]  F. E. Maranzana,et al.  On the Location of Supply Points to Minimize Transport Costs , 1964 .

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

[37]  Mauricio G. C. Resende,et al.  A Hybrid Heuristic for the p-Median Problem , 2004, J. Heuristics.