Solution Search for the Capacitated P-Median Problem using Tabu Search
Capacitated p-median problem (CPMP) is an important facility location problem, where Capacitated p-medians are economically selected in order to serve a set of demand vertexes in such a way that the total demand placed on each of the candidate medians does not exceed their capacity. This work presents an efficient Tabu-search based metaheuristic to solve the CPMP. Said metaheuristic is tested using computational experiments aided with the OR-Library test instances, and in most cases, the optimum value is reached in reasonable computing times. The obtained results are compared and evaluated with the aid of Lingo 16.0. Lastly, an actual case is solved in which the objective is presenting new locations for a meat-product company’s distribution centers.