A New Hybrid-Heuristic Approach for Vertex p-Median Location Problems

In this paper, a new hybridization of a Myopic and Neighborhood approaches is proposed to solve large-size vertex p-median location problems. The effectiveness and efficiency of our approach are demonstrated empirically through an intensive computational experiment on large-size instances taken from TSPLib and BIRCH datasets, with the number of nodes varying from 734 to 9,976 for the former and from 9,600 to 20,000 nodes for the latter. The results show that the new approach, though relatively simple, yields better solutions compared to the ones in the literature. This demonstrates that a simpler approach that takes into account the advantages of other methods can lead to promising outcome and has the potential of being adopted in other combinatorial optimization problems.

@article{Rabie2022,
  title     = {A New Hybrid-Heuristic Approach for Vertex p-Median Location Problems},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {13},
  number    = {7},
  year      = {2022},
  publisher = {The Science and Information Organization},
  author    = {Hassan Mohamed Rabie and Said Salhi},
  doi       = {10.14569/IJACSA.2022.0130705},
  url       = {https://doi.org/10.14569/IJACSA.2022.0130705}
}