A vertex weighting-based double-tabu search algorithm for the classical p-center problem

The p-center problem, which is NP-hard, aims to select p centers from a set of candidates to serve all clients while minimizing the maximum distance between each client and its assigned center. To solve this challenging optimization problem, we transform the p-center problem into a series of decision subproblems, and propose a vertex weighting-based double-tabu search (VWDT) algorithm. It integrates a vertex weighting strategy and a double-tabu search which combines both solution-based and attribute-based tabu strategies to help the search to escape from the local optima trap. Computational experiments on totally 510 public instances in the literature show that VWDT is highly competitive comparing to the state-of-the-art algorithms. Specifically, VWDT improves the previous best known results for 84 large instances and matches the best results for all the remaining ones. Apart from the improvements in solution quality, VWDT is much faster than other state-of-the-art algorithms in the literature, especially on some large instances. Furthermore, we perform additional experiments to analyze the impact of the key components to VWDT, such as the vertex weighting and the double-tabu search strategy. •A vertex weighting-based double-tabu search algorithm for the p-center problem.•Decomposing the problem into a series of maximal covering location subproblems.•An age strategy to break ties when there exist multiple choices.•The proposed algorithm efficiently solves large-scale problem instances.•Our algorithm significantly outperforms state-of-the-art methods in the literature.