Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/6675
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mladenović, N | - |
dc.contributor.author | Labbe, M | - |
dc.contributor.author | Hansen, P | - |
dc.date.accessioned | 2012-09-17T11:11:45Z | - |
dc.date.available | 2012-09-17T11:11:45Z | - |
dc.date.issued | 2003 | - |
dc.identifier.citation | NetworksS, 42(1): 48 - 64, Aug 2003 | en_US |
dc.identifier.issn | 0028-3045 | - |
dc.identifier.uri | http://onlinelibrary.wiley.com/doi/10.1002/net.10081/abstract | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/6675 | - |
dc.description | Copyright @ 2003 Wiley Periodicals - This article can be accessed from the link below. | en_US |
dc.description.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. | en_US |
dc.language | English | - |
dc.language.iso | en | en_US |
dc.publisher | Wiley Periodicals | en_US |
dc.subject | Location | en_US |
dc.subject | p-center | en_US |
dc.subject | Heuristics | en_US |
dc.subject | Tabu search | en_US |
dc.subject | Variable neighborhood search | en_US |
dc.title | Solving the p-center problem with tabu search and variable neighborhood search | en_US |
dc.type | Article | en_US |
dc.identifier.doi | http://dx.doi.org/10.1002/net.10081 | - |
pubs.organisational-data | /Brunel | - |
pubs.organisational-data | /Brunel/Brunel Active Staff | - |
pubs.organisational-data | /Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths | - |
pubs.organisational-data | /Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths/Maths | - |
pubs.organisational-data | /Brunel/University Research Centres and Groups | - |
pubs.organisational-data | /Brunel/University Research Centres and Groups/School of Information Systems, Computing and Mathematics - URCs and Groups | - |
pubs.organisational-data | /Brunel/University Research Centres and Groups/School of Information Systems, Computing and Mathematics - URCs and Groups/Centre for the Analysis of Risk and Optimisation Modelling Applications | - |
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.