DC FieldValueLanguage
dc.contributor.authorDavydov, Ivanen
dc.contributor.authorKochetov, Yuen
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorUrošević, Draganen
dc.date.accessioned2020-05-01T20:13:55Z-
dc.date.available2020-05-01T20:13:55Z-
dc.date.issued2014-01-01en
dc.identifier.issn0005-1179en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1786-
dc.description.abstractTwo players, the leader and his competitor, open facilities, striving to capture the largest market share. The leader opens p facilities, then the follower opens r facilities. Each client chooses the nearest facility as his supplier. We need to choose p facilities of the leader in such a way as to maximize his market share. This problem can be represented as a bilevel programming problem. Based on this representation, in this work we propose two numerical approaches: local search with variable neighborhoods and stochastic tabu search. We pay the most attention to improving the methods' efficiency at no loss to the quality of the resulting solutions. Results of numerical experiments support the possibility to quickly find an exact solution for the problem and solutions with small error.en
dc.publisherSpringer Link-
dc.relation.ispartofAutomation and Remote Controlen
dc.titleFast metaheuristics for the discrete (r|p)-centroid problemen
dc.typeArticleen
dc.identifier.doi10.1134/S0005117914040080en
dc.identifier.scopus2-s2.0-84899553118en
dc.relation.firstpage677en
dc.relation.lastpage687en
dc.relation.issue4en
dc.relation.volume75en
dc.description.rankM23-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0003-3607-6704-
Show simple item record

SCOPUSTM   
Citations

40
checked on Nov 9, 2024

Page view(s)

18
checked on Nov 8, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.