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

Qingyun Zhang, Zhipeng Lü, Zhouxing Su, Chumin Li

Abstract: Highlights•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.