Please use this identifier to cite or link to this item:
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
Issue 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
ISSN: 0030-364X
Appears in Collections:Publications
Computer Science
Dept of Mathematics Research Papers
Mathematical Sciences

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.