Authors: Drezner, Zvi
Brimberg, Jack
Mladenović, Nenad 
Salhi, Said
Title: New local searches for solving the multi-source Weber problem
Journal: Annals of Operations Research
Volume: 246
Issue: 1-2
First page: 181
Last page: 203
Issue Date: 1-Nov-2016
Rank: M22
ISSN: 0254-5330
DOI: 10.1007/s10479-015-1797-5
This paper presents three new heuristic approaches for the solution of the multi-source Weber problem in the plane: a constructive heuristic that finds a good starting solution, a decomposition approach which uses Delaunay triangulation, and a new efficient neighborhood structure based on the single facility limited distance median problem. A new heuristic incorporating all these approaches provided high quality solutions in reasonable computing time. We conclude that these heuristics successfully compete with the metaheuristic based methods found in the literature improving ten best known solutions. The ideas here may be extended to a variety of other continuous location as well as data mining problems.
Keywords: Constructive heuristic | Continuous p-median | Decomposition | Limited distance median | Locate–allocate | Weiszfeld algorithm
Publisher: Springer Link
Project: Natural Sciences and Engineering Research Council of Canada Discovery Grant (NSERC #20541-2008)
RSF Grant 14-41-00039

Show full item record


checked on Jun 22, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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