Skip to Main content Skip to Navigation
Journal articles

A new local search for continuous location problems

Abstract : 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Julie Cagniard Connect in order to contact the contributor
Submitted on : Thursday, February 17, 2022 - 3:08:08 PM
Last modification on : Tuesday, August 30, 2022 - 5:14:20 PM

Links full text




Jack Brimberg, Zvi Drezner, Nenad Mladenovic, Said Salhi. A new local search for continuous location problems. European Journal of Operational Research, Elsevier, 2014, 232 (2), pp.256-265. ⟨10.1016/j.ejor.2013.06.022⟩. ⟨hal-03578772⟩



Record views