Optimization Online


A hybrid heuristic for the P-median problem

Mauricio G. C. Resende (mgcr***at***research.att.com)
Renato F. Werneck (rwerneck***at***cs.princeton.edu)

Abstract: 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.

Keywords: p-median, k-median, metaheuristic, GRASP, path-relinking, local search

Category 1: Combinatorial Optimization

Category 2: Combinatorial Optimization (Meta Heuristics )

Citation: AT&T Labs Research Technical Report TD-5NWRCR, June 27, 2003. Originally released as AT&T Labs Research Technical Report TD-5E53XL with title

Download: [PDF]

Entry Submitted: 06/27/2003
Entry Accepted: 06/30/2003
Entry Last Modified: 06/27/2003

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society