Using injection points in reformulation local search for solving continuous location problems
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...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Belgrade
2017-01-01
|
Series: | Yugoslav Journal of Operations Research |
Subjects: | |
Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2017/0354-02431600018B.pdf |
_version_ | 1828769853097377792 |
---|---|
author | Brimberg Jack Drezner Zvi Mladenović Nenad Salhi Said |
author_facet | Brimberg Jack Drezner Zvi Mladenović Nenad Salhi Said |
author_sort | Brimberg Jack |
collection | DOAJ |
description | 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. |
first_indexed | 2024-12-11T13:56:23Z |
format | Article |
id | doaj.art-81389a6b90844c19a64b2dee68ee4214 |
institution | Directory Open Access Journal |
issn | 0354-0243 1820-743X |
language | English |
last_indexed | 2024-12-11T13:56:23Z |
publishDate | 2017-01-01 |
publisher | University of Belgrade |
record_format | Article |
series | Yugoslav Journal of Operations Research |
spelling | doaj.art-81389a6b90844c19a64b2dee68ee42142022-12-22T01:04:02ZengUniversity of BelgradeYugoslav Journal of Operations Research0354-02431820-743X2017-01-0127329130010.2298/YJOR160517018B0354-02431600018BUsing injection points in reformulation local search for solving continuous location problemsBrimberg Jack0Drezner Zvi1Mladenović Nenad2Salhi Said3Royal Military College of Canada, Department of Mathematics and Computer Science, Kingston, CanadaCalifornia State University, Steven G. Mihaylo College of Business and Economics, Fullerton, USASerbian Academy of Sciences and Arts, Mathematical Institiute, BelgradeUniversity of Kent, Centre for Logistics & Heuristic Optimization, Kent Business School, Canterbury, United KingdomReformulation 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.http://www.doiserbia.nb.rs/img/doi/0354-0243/2017/0354-02431600018B.pdfContinuous LocationWeber problemFormulation space searchReformulation descentVariable neighbourhood search |
spellingShingle | Brimberg Jack Drezner Zvi Mladenović Nenad Salhi Said Using injection points in reformulation local search for solving continuous location problems Yugoslav Journal of Operations Research Continuous Location Weber problem Formulation space search Reformulation descent Variable neighbourhood search |
title | Using injection points in reformulation local search for solving continuous location problems |
title_full | Using injection points in reformulation local search for solving continuous location problems |
title_fullStr | Using injection points in reformulation local search for solving continuous location problems |
title_full_unstemmed | Using injection points in reformulation local search for solving continuous location problems |
title_short | Using injection points in reformulation local search for solving continuous location problems |
title_sort | using injection points in reformulation local search for solving continuous location problems |
topic | Continuous Location Weber problem Formulation space search Reformulation descent Variable neighbourhood search |
url | http://www.doiserbia.nb.rs/img/doi/0354-0243/2017/0354-02431600018B.pdf |
work_keys_str_mv | AT brimbergjack usinginjectionpointsinreformulationlocalsearchforsolvingcontinuouslocationproblems AT dreznerzvi usinginjectionpointsinreformulationlocalsearchforsolvingcontinuouslocationproblems AT mladenovicnenad usinginjectionpointsinreformulationlocalsearchforsolvingcontinuouslocationproblems AT salhisaid usinginjectionpointsinreformulationlocalsearchforsolvingcontinuouslocationproblems |