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 decisio...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research 2023-12, Vol.160, p.106373, Article 106373
Hauptverfasser:	Zhang, Qingyun, Lü, Zhipeng, Su, Zhouxing, Li, Chumin
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science Location problem p-Center problem Solution-based tabu strategy Tabu search Vertex weighting
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!