Solution Search for the Capacitated P-Median Problem using Tabu Search

Authors

  • Mauricio Romero Montoya Universidad Popular Autónoma del Estado de Puebla
  • Rogelio González Velázquez Benemérita Universidad Autónoma de Puebla
  • Martín Estrada Analco Benemérita Universidad Autónoma de Puebla
  • José Luis Martínez Flores Universidad Popular Autónoma del Estado de Puebla
  • María Beatriz Bernábe Loranca Benemérita Universidad Autónoma de Puebla

Keywords:

Tabu Search, Metaheuristic, Capacited p-median

Abstract

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.

Downloads

Published

2018-12-09

How to Cite

Romero Montoya, M., González Velázquez, R., Estrada Analco, M., Martínez Flores, J. L., & Bernábe Loranca, M. B. (2018). Solution Search for the Capacitated P-Median Problem using Tabu Search. International Journal of Combinatorial Optimization Problems and Informatics, 10(2), 17–25. Retrieved from https://ijcopi.org/ojs/article/view/118

Issue

Vol. 10 No. 2 (2019)

Section

Articles

Most read articles by the same author(s)