Vertex Weighting-Based Tabu Search for p-Center Problem - Archive ouverte HAL
Communication Dans Un Congrès Année : 2021

Vertex Weighting-Based Tabu Search for p-Center Problem

Qingyun Zhang
  • Fonction : Auteur
Zhouxing Su
  • Fonction : Auteur
  • PersonId : 1319796
Yuan Fang
  • Fonction : Auteur
Fuda Ma
  • Fonction : Auteur

Résumé

The p-center problem consists of choosing p centers from a set of candidates to minimize the maximum distance between any client and its assigned center. In this paper, we transform the p-center problem into a series of set covering subproblems, and propose a vertex weighting-based tabu search (VWTS) algorithm to solve them. The proposed VWTS algorithm integrates distinguishing features such as a vertex weighting technique and a tabu search strategy to help the search to jump out of the local optima. Computational experiments on 138 most commonly used benchmark instances show that VWTS is highly competitive comparing to the state-of-the-art methods in spite of its simplicity. As a well-known NP-hard problem which has already been studied for over half a century, it is a challenging task to break the records on these classic datasets. Yet VWTS improves the best known results for 14 out of 54 large instances, and matches the optimal results for all remaining 84 ones. In addition, the computational time taken by VWTS is much shorter than other algorithms in the literature.
Fichier non déposé

Dates et versions

hal-04322217 , version 1 (08-12-2023)

Identifiants

  • HAL Id : hal-04322217 , version 1

Citer

Qingyun Zhang, Zhouxing Su, Chumin Li, Yuan Fang, Fuda Ma. Vertex Weighting-Based Tabu Search for p-Center Problem. IJCAI'20: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, Jan 2021, Yokohama Yokohama, Japan. pp.1481-1487. ⟨hal-04322217⟩

Collections

U-PICARDIE MIS
7 Consultations
1 Téléchargements

Partager

More