An Efficient Hybrid Metaheuristic for Capacitated p-Median Problem

Capacitated p-rnedian 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 far solving the cpmp.