@inproceedings{3cb9848fe53340579ce5092b4424515a,
title = "Local Search Approach for the (r|p)-Centroid Problem Under ℓ1 Metric",
abstract = "In the-centroid problem, two players, called the Leader and the Follower, open facilities to service customers. We assume that customers are identified with their location on the plane, and facilities can be opened anywhere on the plane. The Leader opens p facilities. Later on, the Follower opens r facilities. Each customer patronizes the closest facility. The distances are calculated according to-metric. The goal is to find the location of the Leader{\textquoteright}s facilities maximizing her market share. We provide the results on the computational complexity of this problem and develop a local search heuristic, based on the VNS framework. Computational experiments on the randomly generated test instances show that the proposed approach performs well.",
keywords = "(R-P)-centroid, Bilevel programming, Facility location, Manhattan metric, Stackelberg game, Variable neighborhood search",
author = "Ivan Davydov and Petr Gusev",
note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; 7th International Conference on Variable Neighborhood Search, ICVNS 2019 ; Conference date: 03-10-2019 Through 05-10-2019",
year = "2020",
month = jan,
day = "1",
doi = "10.1007/978-3-030-44932-2_6",
language = "English",
isbn = "9783030449315",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Gabler",
pages = "81--94",
editor = "Rachid Benmansour and Angelo Sifaleras and Nenad Mladenovic",
booktitle = "Variable Neighborhood Search - 7th International Conference, ICVNS 2019, Revised Selected Papers",
address = "Germany",
}