Brunel University Research Archive (BURA) >
University >
Publications >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/6681

Title: Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem
Authors: Brimberg, J
Hansen, P
Mladenović, N
Taillard, ED
Keywords: Facilities/equipment planning, location, continuous
Heuristic solution methods
Publication Date: 2000
Publisher: INFORMS
Citation: Operations Research, 48(3): 444 - 460, May 2000
Abstract: The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to minimize the total transportation cost for satisfying the demand of n fixed users, each supplied from its closest facility. Many heuristics have been proposed for this problem, as well as a few exact algorithms. Heuristics are needed to solve quickly large problems and to provide good initial solutions for exact algorithms. We compare various heuristics, i.e., alternative location-allocation (Cooper 1964), projection (Bongartz et al. 1994), Tabu search (Brimberg and Mladenovic 1996a), p-Median plus Weber (Hansen ct al. 1996), Genetic search and several versions of Variable Neighbourhood search. Based on empirical tests that are reported, it is found that most traditional and some recent heuristics give poor results when the number of facilities to locate is large and that Variable Neighbourhood search gives consistently best results, on average, in moderate computing time.
Description: Copyright @ 2000 INFORMS
Sponsorship: This study was supported by the Department of National Defence (Canada) Academic Research; Office of Naval Research Grant N00014-92-J-1194, Natural Sciences and Engineering Research Council of Canada Grant GPO 105574 and Fonds pour la Formation des Chercheurs et l’Aide a la Recherche Grant 32EQ 1048; and by an International Postdoctoral Fellowship of the Natural Sciences and Engineering Research Council of Canada, Grant OGPOO 39682.
URI: http://or.journal.informs.org/content/48/3/444.short
http://bura.brunel.ac.uk/handle/2438/6681
DOI: http://dx.doi.org/10.1287/opre.48.3.444.12431
ISSN: 0030-364X
Appears in Collections:Mathematical Science
Publications
Computer Science
Dept of Mathematics Research Papers

Files in This Item:

File Description SizeFormat
Fulltext.pdf128.64 kBAdobe PDFView/Open

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