A Hybrid VNS/TABU Search Algorithm for Solution the P-Median Problem

Authors

  • Mauricio Romero Montoya Instituto Tecnológico de Orizaba (ITO)
  • Erika Granillo Benemerita Universidad Autonoma de Puebla
  • Rogelio González Velázquez Benemérita Universidad Autónoma de Puebla (BUAP)
  • María Beatriz Bernabé Loranca Benemérita Universidad Autónoma de Puebla (BUAP)
  • Martín Estrada Analco Benemérita Universidad Autónoma de Puebla (BUAP)

Keywords:

VNS, Tabu Search, Metaheuristic, p-median, Np-Hard

Abstract

The p-median problem is an excellent tool to solve location facilities problems. There are many applications in which the problem of the p-median can be used, some of these can be; location of fire stations, location of police stations and location of distribution centers, among others. This work introduces the use of A Hybrid VNS / TABU Search Algorithm to determine the correct location of p centers. Experimental results on benchmark and the application to a real case indicate the potential of the proposed approach, which is able to produce good solutions with the use of VNS / TABU Search.

Downloads

Published

2020-01-02

How to Cite

Romero Montoya, M., Granillo, E., González Velázquez, R., Bernabé Loranca, M. B., & Estrada Analco, M. (2020). A Hybrid VNS/TABU Search Algorithm for Solution the P-Median Problem. International Journal of Combinatorial Optimization Problems and Informatics, 11(2), 67–74. Retrieved from https://ijcopi.org/ojs/article/view/137

Issue

Vol. 11 No. 2 (2020)

Section

Articles

Most read articles by the same author(s)