Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/6675
Title: | Solving the p-center problem with tabu search and variable neighborhood search |
Authors: | Mladenović, N Labbe, M Hansen, P |
Keywords: | Location;p-center;Heuristics;Tabu search;Variable neighborhood search |
Issue Date: | 2003 |
Publisher: | Wiley Periodicals |
Citation: | NetworksS, 42(1): 48 - 64, Aug 2003 |
Abstract: | 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. (C) 2003 Wiley Periodicals, Inc. |
Description: | Copyright @ 2003 Wiley Periodicals - This article can be accessed from the link below. |
URI: | http://onlinelibrary.wiley.com/doi/10.1002/net.10081/abstract http://bura.brunel.ac.uk/handle/2438/6675 |
DOI: | http://dx.doi.org/10.1002/net.10081 |
ISSN: | 0028-3045 |
Appears in Collections: | Publications Computer Science Dept of Mathematics Research Papers Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 91.9 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.