DC Field | Value | Language |
---|---|---|
dc.contributor.author | Brimberg, Jack | en |
dc.contributor.author | Drezner, Zvi | en |
dc.contributor.author | Mladenović, Nenad | en |
dc.contributor.author | Salhi, Said | en |
dc.date.accessioned | 2020-05-02T16:41:54Z | - |
dc.date.available | 2020-05-02T16:41:54Z | - |
dc.date.issued | 2017-09-21 | en |
dc.identifier.issn | 0354-0243 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/2392 | - |
dc.description.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 pha.se 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 pha.se 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. | en |
dc.publisher | Faculty of Organizational Sciences, University of Belgrade | - |
dc.relation | NaturalSciences and Engineering Research Council of Canada Discovery Grant (NSERC#205041-2014) | - |
dc.relation | UK Research Council EPSRC (EP/ I009299/1) | - |
dc.relation | Spanish Ministry of Economy and Competitiveness (research project #MTM2015-70260-P) | - |
dc.relation | Mathematical Modelas and Optimization Methods on Large-Scale Systems | - |
dc.relation | Ministry of Education and Science, Republic of Kazakhstan (Institute of Information and Computer Technologies, project no. 0115PK00546) | - |
dc.relation.ispartof | Yugoslav Journal of Operations Research | en |
dc.subject | Continuous location | Formulation space search | Reformulation descent | Variable neighbourhood search | Weber oroblem | en |
dc.title | Using injection points in reformulation local search for solving continuous location problems | en |
dc.type | Article | en |
dc.identifier.doi | 10.2298/YJOR160517018B | en |
dc.identifier.scopus | 2-s2.0-85030453984 | en |
dc.relation.firstpage | 291 | en |
dc.relation.lastpage | 300 | en |
dc.relation.issue | 3 | en |
dc.relation.volume | 27 | en |
dc.description.rank | M51 | - |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.openairetype | Article | - |
item.fulltext | No Fulltext | - |
crisitem.author.orcid | 0000-0001-6655-0409 | - |
crisitem.project.projectURL | http://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php | - |
crisitem.project.fundingProgram | Directorate for Engineering | - |
crisitem.project.openAire | info:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103 | - |
SCOPUSTM
Citations
8
checked on Dec 12, 2024
Page view(s)
19
checked on Dec 12, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.