DC FieldValueLanguage
dc.contributor.authorHansen, Pierreen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:42:17Z-
dc.date.available2020-05-02T16:42:17Z-
dc.date.issued1997-12-01en
dc.identifier.issn0966-8349en
dc.description.abstractConsider 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.en
dc.publisherElsevier-
dc.relationONR, Grant N00014-95-1-0917-
dc.relationNSERC, Grant GPO105574-
dc.relationFCAR, Grant 95ER1048-
dc.relation.ispartofLocation Scienceen
dc.titleVariable neighborhood search for the p-medianen
dc.typeArticleen
dc.identifier.doi10.1016/S0966-8349(98)00030-8en
dc.identifier.scopus2-s2.0-0031390388en
dc.relation.firstpage207en
dc.relation.lastpage226en
dc.relation.issue4en
dc.relation.volume5en
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

277
checked on Nov 27, 2022

Page view(s)

28
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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