Skip to main content

New local searches for solving the multi-source Weber problem

Drezner, Zvi, Brimberg, Jack, Mladenovic, Nenad, Salhi, Said (2015) New local searches for solving the multi-source Weber problem. Annals of Operation Research, 246 . pp. 181-203. ISSN 0254-5330. E-ISSN 0254-5330. (doi:10.1007/s10479-015-1797-5) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:58142)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1007/s10479-015-1797-5

Abstract

This paper presents three new heuristic approaches for the solution of the multisourceWeber

a decomposition approach which uses Delaunay triangulation, and a new efficient neighborhood

incorporating all these approaches provided high quality solutions in reasonable computing

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.

Item Type: Article
DOI/Identification number: 10.1007/s10479-015-1797-5
Uncontrolled keywords: Constructive heuristic, Decomposition, Limited distance median, Locate‚Äďallocate, Continuous p-median, Weiszfeld algorithm
Subjects: H Social Sciences > H Social Sciences (General)
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Faculties > Social Sciences > Kent Business School > Centre for Logistics and Heuristic Organisation (CLHO)
Depositing User: Said Salhi
Date Deposited: 25 Oct 2016 14:18 UTC
Last Modified: 08 Feb 2020 04:08 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/58142 (The current URI for this page, for reference purposes)
Salhi, Said: https://orcid.org/0000-0002-3384-5240
  • Depositors only (login required):