A New Local Search for Continuous Location Problems

Brimberg, Jack and Drezner, Zvi and Mladenovic, Nenad and Salhi, Said (2014) A New Local Search for Continuous Location Problems. European Journal of Operational Research, 232 (2). pp. 256-265. ISSN 0377-2217. (doi:https://doi.org/10.1016/j.ejor.2013.06.022) (Full text available)

PDF (A new local search for continuous location problems)
Download (277kB) Preview
Official URL


This paper presents a new local search approach for solving continuous location problems. The main idea is to exploit the relation between the continuous model and its discrete counterpart. A local search is first conducted in the continuous space until a local optimum is reached. It then switches to a discrete space that represents a discretisation of the continuous model to find an improved solution from there. The process continues switching between the two problem formulations until no further improvement can be found in either. Thus, we may view the procedure as a new adaption of formulation space search. The local search is applied to the multi-source Weber problem where encouraging results are obtained. This local search is also embedded within Variable Neighbourhood Search producing excellent results.

Item Type: Article
Uncontrolled keywords: Continuous Location, Weber problem, Space search formulation, Variable neighbourhood
Subjects: H Social Sciences
H Social Sciences > HA Statistics > HA33 Management Science
Divisions: Faculties > Social Sciences > Kent Business School
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 Jun 2013 09:03 UTC
Last Modified: 07 Aug 2018 15:03 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/34400 (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year