Authors: Brimberg, Jack
Drezner, Zvi
Mladenović, Nenad 
Salhi, Said
Title: A new local search for continuous location problems
Journal: European Journal of Operational Research
Volume: 232
Issue: 2
First page: 256
Last page: 265
Issue Date: 1-Jan-2014
Rank: M21
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2013.06.022
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.
Keywords: Continuous location | Space search formulation | Variable neighbourhood | Weber problem
Publisher: Elsevier
Project: Natural Sciences and Engineering Research Council of Canada Discovery, Grant #205041-2008
UK Research Council EPSRC EP/I009299/1

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.