Authors: Davydov, Ivan
Kochetov, Yu
Mladenović, Nenad 
Urošević, Dragan 
Title: Fast metaheuristics for the discrete (r|p)-centroid problem
Journal: Automation and Remote Control
Volume: 75
Issue: 4
First page: 677
Last page: 687
Issue Date: 1-Jan-2014
Rank: M23
ISSN: 0005-1179
DOI: 10.1134/S0005117914040080
Two 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.
Publisher: Springer Link

Show full item record


checked on May 18, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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