A vertex weighting-based double-tabu search algorithm for the classical p -center problem - Université de Picardie Jules Verne Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2023

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

Qingyun Zhang
  • Fonction : Auteur
Zhouxing Su

Résumé

The -center problem, which is NP-hard, aims to select 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 -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.
Fichier non déposé

Dates et versions

hal-04179925 , version 1 (10-08-2023)

Identifiants

Citer

Qingyun Zhang, Zhipeng Lü, Zhouxing Su, Chumin Li. A vertex weighting-based double-tabu search algorithm for the classical p -center problem. Computers and Operations Research, 2023, pp.106373. ⟨10.1016/j.cor.2023.106373⟩. ⟨hal-04179925⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More