An efficient heuristic algorithm for the capacitated $$p-\!$$ median problem

The capacitated $$p$$-median problem (CPMP) is one of the well-known facility-location problems. The objective of the problem is to minimize total cost of locating a set of capacitated service points and allocating a set of demand points to the located service points, while the total allocated demand for each service point is not be greater than its capacity limit. This paper presents an efficient heuristic algorithm based on the local branching and relaxation induced neighborhood search methods for the CPMP. The proposed algorithm is a heuristic technique that utilizes a general mixed integer programming solver to explore neighborhoods. The parameters of the proposed algorithm are tuned by design of experiments. The proposed method is tested on a large set of benchmark instances. The results show that the method outperforms the best method found in the literature.

[1]  Orhan Engin,et al.  Investigation of Ant System parameter interactions by using design of experiments for job-shop scheduling problems , 2009, Comput. Ind. Eng..

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

[3]  Manuel Laguna,et al.  Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search , 2006, Oper. Res..

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

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

[6]  Saïd Salhi,et al.  A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location–Allocation Problem , 2003, Ann. Oper. Res..

[7]  J. Reese,et al.  Solution methods for the p-median problem: An annotated bibliography , 2006 .

[8]  Daniel Kudenko,et al.  Tuning the Performance of the MMAS Heuristic , 2007, SLS.

[9]  Nicos Christofides,et al.  Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .

[10]  Erwin Kreyszig,et al.  Introductory Mathematical Statistics. , 1970 .

[11]  Leon Cooper,et al.  Heuristic Methods for Location-Allocation Problems , 1964 .

[12]  Giovanni Righini,et al.  A branch‐and‐price algorithm for the capacitated p‐median problem , 2005, Networks.

[13]  Mauricio G. C. Resende,et al.  A fast swap-based local search procedure for location problems , 2007, Ann. Oper. Res..

[14]  Alberto Ceselli,et al.  Two exact algorithms for the capacitated p-median problem , 2003, 4OR.

[15]  Claudio Sterle,et al.  A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes , 2008, J. Math. Model. Algorithms.

[16]  Rolf Wendolsky,et al.  A scatter search heuristic for the capacitated clustering problem , 2006, Eur. J. Oper. Res..

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

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

[19]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[20]  Pierre Hansen,et al.  The p-median problem: A survey of metaheuristic approaches , 2005, Eur. J. Oper. Res..

[21]  Dominique Peeters,et al.  A comparison of two dual-based procedures for solving the p-median problem , 1985 .

[22]  Luiz Antonio Nogueira Lorena,et al.  Clustering search algorithm for the capacitated centered clustering problem , 2010, Comput. Oper. Res..

[23]  Daniel Kudenko,et al.  Tuning an Algorithm Using Design of Experiments , 2010, Experimental Methods for the Analysis of Optimization Algorithms.

[24]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[25]  G. Righini,et al.  A branch-and-price algorithm for the capacitated p-median problem , 2005 .

[26]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[27]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[28]  George C. Runger,et al.  Using Experimental Design to Find Effective Parameter Settings for Heuristics , 2001, J. Heuristics.

[29]  Christopher R. Houck,et al.  Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems , 1996, Comput. Oper. Res..

[30]  É. Taillard,et al.  Improvements and Comparison of Heuristics for solving the Multisource Weber Problem , 1997 .

[31]  William H. Press,et al.  Numerical Recipes in FORTRAN - The Art of Scientific Computing, 2nd Edition , 1987 .

[32]  Luiz Antonio Nogueira Lorena,et al.  Clustering Search Heuristic for the Capacitated p -Median Problem , 2008, Innovations in Hybrid Intelligent Systems.

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

[34]  Alex Alves Freitas,et al.  A Genetic Algorithm for Solving a Capacitated p-Median Problem , 2004, Numerical Algorithms.