AN EFFICIENT HYBRID METAHEURISTIC FOR CAPACITATED P-MEDIAN PROBLEM

Capacitated p-median problem (CPMP) is a well-known facilitylocation problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an efficient solution method for the problem has been a challenge during last decades in literature. In this paper, a hybrid met heuristic called GACO is developed to find high quality and fast solutions for the CPMP. The GACO combines elements of genetic algorithm and ant colony optimization met heuristics. Computational results on standard test problems show the robustness and efficiency of the algorithm and confirm that the proposed method is a good choice for solving the CPMP.

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

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

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

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

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

[6]  Roberto Baldacci,et al.  A new method for solving capacitated location problems based on a set partitioning approach , 2002, Comput. Oper. Res..

[7]  Giovanni Righini,et al.  A computational evaluation of a general branch-and-price framework for capacitated network location problems , 2009, Ann. Oper. Res..

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

[9]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

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

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

[12]  Christian Blum,et al.  Hybrid Metaheuristics, An Emerging Approach to Optimization , 2008, Hybrid Metaheuristics.

[13]  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.

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

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

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

[17]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[19]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .