M.G.C. Resende and R.F. Werneck
Submitted to J. of Heuristics, 2002
Given N customers and a set F of M potential facilities, the P-median problem consists in finding a subset of F with P facilities such that the cost of serving all customers is minimized. This is a well-known NP-complete problem with important applications in location science and classification (clustering). We present a multistart hybrid heuristic that combines elements of several traditional metaheuristics to find near-optimal solutions to this problem. Empirical results on instances from the literature attest the robustness of the algorithm, which performs at least as well as other methods, and often better in terms of both running time and solution quality. In all cases the solutions obtained by our method were within 0.1% of the best known upper bounds.
This paper was originally released in 2002 with the title "A GRASP with path-relinking the for the p-median problem."
PDF file of full paper
DJVU file of full paper
PDF file of full paper of 2002 version
Mauricio G.C. Resende's Home PageLast modified: 27 June 2003