Authors: Hansen, Pierre
Mladenović, Nenad 
Title: Variable neighborhood search for the p-median
Journal: Location Science
Volume: 5
Issue: 4
First page: 207
Last page: 226
Issue Date: 1-Dec-1997
ISSN: 0966-8349
DOI: 10.1016/S0966-8349(98)00030-8
Consider a set L of potential locations for p facilities and a set U of locations of given users. The p-median problem is to locate simultaneously the p facilities at locations of L in order to minimize the total transportation cost for satisfying the demand of the users, each supplied from its closest facility. This model is a basic one in location theory and can also be interpreted in terms of cluster analysis where locations of users are then replaced by points in a given space. We propose several new Variable Neighborhood Search heuristics for the p-median problem and compare them with Greedy plus Interchange, and two Tabu Search heuristics.
Publisher: Elsevier
Project: ONR, Grant N00014-95-1-0917
NSERC, Grant GPO105574
FCAR, Grant 95ER1048

Show full item record


checked on Sep 16, 2022

Page view(s)

checked on Sep 16, 2022

Google ScholarTM




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