USING INJECTION POINTS IN REFORMULATION LOCAL SEARCH FOR SOLVING CONTINUOUS LOCATION PROBLEMS

  • Jack BRIMBERG Department of Mathematics and Computer Science, Royal Military College of Canada, Kingston, ON, K7K7B4, Canada
  • Zvi DREZNER Steven G. Mihaylo College of Business and Economics, California State University, Fullerton, CA 92634, USA
  • Nenad MLADENOVIĆ Mathematical Institiute, Serbian Academy of Sciences and Arts, Knez Mihajlova 36, 11000 Belgrade, Serbia
  • Said SALHI Centre for Logistics & Heuristic Optimization, Kent Business School, University of Kent, Canterbury CT2 7PE, United Kingdom

Abstract

Reformulation local search (RLS) has been recently proposed as a new approach for solving continuous location problems. The main idea, although not new, is to exploit the relation between the continuous model and its discrete counterpart. The RLS switches between the continuous model and a discrete relaxation in order to expand the search. In each iteration new points obtained in the continuous phase are added to the discrete formulation. Thus, the two formulations become equivalent in a limiting sense. In this paper we introduce the idea of adding ’injection points’ in the discrete phase of RLS in order to escape a current local solution. Preliminary results are obtained on benchmark data sets for the multi-source Weber problem that support further investigation of the RLS framework.

Published
Oct 18, 2016
How to Cite
BRIMBERG, Jack et al. USING INJECTION POINTS IN REFORMULATION LOCAL SEARCH FOR SOLVING CONTINUOUS LOCATION PROBLEMS. Yugoslav Journal of Operations Research, [S.l.], v. 27, n. 3, p. 291-300, oct. 2016. ISSN 2334-6043. Available at: <http://yujor.fon.bg.ac.rs/index.php/yujor/article/view/33>. Date accessed: 19 oct. 2017.
Section
Articles