Solving the planar p-median problem by variable neighborhood and concentric searches

摘要

Two new approaches for the solution of the p-median problemudin the plane are proposed. One is a Variable Neighborhood Search (VNS)udand the other one is a concentric search. Both approaches are enhanced by audfront-end procedure for finding good starting solutions and a decompositionudheuristic acting as a post optimization procedure. Computational resultsudconfirm the effectiveness of the proposed algorithms.