Authors: Mladenović, Nenad 
Labbé, Martine
Hansen, Pierre
Title: Solving the p-Center Problem with Tabu Search and Variable Neighborhood Search
Journal: Networks
Volume: 42
Issue: 1
First page: 48
Last page: 64
Issue Date: 1-Aug-2003
Rank: M22
ISSN: 0028-3045
DOI: 10.1002/net.10081
The p-Center problem consists of locating p facilities and assigning clients to them in order to minimize the maximum distance between a client and the facility to which he or she is allocated. In this paper, we present a basic Variable Neighborhood Search and two Tabu Search heuristics for the p-Center problem without the triangle inequality. Both proposed methods use the 1-interchange (or vertex substitution) neighborhood structure. We show how this neighborhood can be used even more efficiently than for solving the p-Median problem. Multistart 1-interchange, Variable Neighborhood Search, Tabu Search, and a few early heuristics are compared on small-and large-scale test problems from the literature.
Keywords: Heuristics | Location | P-center | Tabu search | Variable neighborhood search
Publisher: Wiley

Show full item record


checked on Jun 15, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.