Solving Capacitated P-Median Problem by Hybrid K-Means Clustering and Fixed Neighborhood Search algorithm

Capacitated P-median problem (CPMP) is one of the popular discrete location problems. CPMP locates P facilities between the candidate points, in order to satisfy the customer demand. This problem is a NP-hard problem. In this paper, a new hybrid algorithm is proposed to solve CPMP. In proposed method, K-means clustering algorithm will find a proper solution for Fixed Neighborhood Search algorithm (FNS). Then, FNS algorithm improves the quality of obtained solutions for standard benchmark instances with facilities locations exchange and omit the unsuitable candidates' points. The Computational results show the efficiency proposed algorithm in regard of the quality of solution.

[1]  J. Mulvey,et al.  Solving capacitated clustering problems , 1984 .

[2]  Krzysztof Fleszar,et al.  An effective VNS for the capacitated p-median problem , 2008, Eur. J. Oper. Res..

[3]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[4]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

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

[6]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

[8]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[9]  Hasan Pirkul,et al.  Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..

[10]  Juan A. Díaz,et al.  Hybrid scatter search and path relinking for the capacitated p , 2006, Eur. J. Oper. Res..

[11]  Luiz Antonio Nogueira Lorena,et al.  A column generation approach to capacitated p-median problems , 2004, Comput. Oper. Res..

[12]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[13]  Gilbert Laporte,et al.  A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..

[14]  Fred W. Glover,et al.  A path relinking approach with ejection chains for the generalized assignment problem , 2006, Eur. J. Oper. Res..