Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/9891
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGhosh, Diptesh
dc.date.accessioned2010-10-22T05:18:27Z
dc.date.available2010-10-22T05:18:27Z
dc.date.copyright2003
dc.date.issued2003-10-22T05:18:27Z
dc.identifier.urihttp://hdl.handle.net/11718/9891
dc.descriptionEuropean Journal of Operational Research Vol. 150, No. 1,(2003), pp. 150-162en
dc.description.abstractThe uncapacitated facility location problem is one of choosing sites among a set of candidates in which facilities can be located, so that the demands of a given set of clients are satisfied at minimum costs. Applications of neighborhood search methods to this problem have not been reported in the literature. In this paper we first describe and compare several neighborhood structures used by local search to solve this problem. We then describe neighborhood search heuristics based on tabu search and complete local search with memory to solve large instances of the uncapacitated facility location problem. Our computational experiments show that on medium sized problem instances, both these heuristics return solutions with costs within 0.075% of the optimal with execution times that are often several orders of magnitude less than those required by exact algorithms. On large sized instances, the heuristics generate low cost solutions quite fast, and terminate with solutions whose costs are within 0.0345% of each other.
dc.language.isoenen
dc.subjectUncapacitated Facility Locationen
dc.subjectHeuristicsen
dc.subjectLocal Searchen
dc.subjectComplete Local Search with Memoryen
dc.titleNeighbourhood search heuristics for the uncapacitated facility location problemen
dc.typeArticleen
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
Neighborhood.pdf
  Restricted Access
430.86 kBAdobe PDFView/Open Request a copy


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.