Standard

Tabu Search for the (rvert p)-Centroid Problem Under Uncertainty. / Davydov, Ivan; Kozhevnikov, Roman.

Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023. Institute of Electrical and Electronics Engineers Inc., 2023. p. 25-30 (Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Davydov, I & Kozhevnikov, R 2023, Tabu Search for the (rvert p)-Centroid Problem Under Uncertainty. in Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023. Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023, Institute of Electrical and Electronics Engineers Inc., pp. 25-30. https://doi.org/10.1109/OPCS59592.2023.10275754

APA

Davydov, I., & Kozhevnikov, R. (2023). Tabu Search for the (rvert p)-Centroid Problem Under Uncertainty. In Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023 (pp. 25-30). (Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/OPCS59592.2023.10275754

Vancouver

Davydov I, Kozhevnikov R. Tabu Search for the (rvert p)-Centroid Problem Under Uncertainty. In Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023. Institute of Electrical and Electronics Engineers Inc. 2023. p. 25-30. (Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023). doi: 10.1109/OPCS59592.2023.10275754

Author

Davydov, Ivan ; Kozhevnikov, Roman. / Tabu Search for the (rvert p)-Centroid Problem Under Uncertainty. Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023. Institute of Electrical and Electronics Engineers Inc., 2023. pp. 25-30 (Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023).

BibTeX

@inproceedings{c0d048cb242244919eb3bb23e725fc34,
title = "Tabu Search for the (rvert p)-Centroid Problem Under Uncertainty",
abstract = "We consider the (r vert p)-centroid problem under an assumption of uncertainty in the input data. Two players, the leader and the follower, open facilities, striving to capture the largest market share. The leader opens p facilities, then the follower opens r facilities. Each customer chooses the nearest facility as his supplier and bring a particular income to the corresponding player. The aim is to choose p facilities of the leader in such a way as to maximize his market share. However, it is assumed that customers' purchasing power is not known exactly and can change after the decision made. This problem can be represented as a bilevel programming problem. In this work, we propose a local search approach based on a stochastic tabu search framework to tackle the problem. We provide the results of numerical experiments and compare the behavior of both players compared to the deterministic setting of the same problem.",
keywords = "bi-level programming, centroid, metaheuristic, uncertain data",
author = "Ivan Davydov and Roman Kozhevnikov",
note = "This work was supported by the Russian Science Foundation, project no. 21–41–09017. Публикация для корректировки.",
year = "2023",
doi = "10.1109/OPCS59592.2023.10275754",
language = "English",
isbn = "9798350331134",
series = "Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "25--30",
booktitle = "Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023",
address = "United States",

}

RIS

TY - GEN

T1 - Tabu Search for the (rvert p)-Centroid Problem Under Uncertainty

AU - Davydov, Ivan

AU - Kozhevnikov, Roman

N1 - This work was supported by the Russian Science Foundation, project no. 21–41–09017. Публикация для корректировки.

PY - 2023

Y1 - 2023

N2 - We consider the (r vert p)-centroid problem under an assumption of uncertainty in the input data. Two players, the leader and the follower, open facilities, striving to capture the largest market share. The leader opens p facilities, then the follower opens r facilities. Each customer chooses the nearest facility as his supplier and bring a particular income to the corresponding player. The aim is to choose p facilities of the leader in such a way as to maximize his market share. However, it is assumed that customers' purchasing power is not known exactly and can change after the decision made. This problem can be represented as a bilevel programming problem. In this work, we propose a local search approach based on a stochastic tabu search framework to tackle the problem. We provide the results of numerical experiments and compare the behavior of both players compared to the deterministic setting of the same problem.

AB - We consider the (r vert p)-centroid problem under an assumption of uncertainty in the input data. Two players, the leader and the follower, open facilities, striving to capture the largest market share. The leader opens p facilities, then the follower opens r facilities. Each customer chooses the nearest facility as his supplier and bring a particular income to the corresponding player. The aim is to choose p facilities of the leader in such a way as to maximize his market share. However, it is assumed that customers' purchasing power is not known exactly and can change after the decision made. This problem can be represented as a bilevel programming problem. In this work, we propose a local search approach based on a stochastic tabu search framework to tackle the problem. We provide the results of numerical experiments and compare the behavior of both players compared to the deterministic setting of the same problem.

KW - bi-level programming

KW - centroid

KW - metaheuristic

KW - uncertain data

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85175475020&origin=inward&txGid=373a91e6568f9111467dcefc12ab6435

UR - https://www.mendeley.com/catalogue/7edd3a8b-2032-3f6c-b8b3-ce414b43c3cd/

U2 - 10.1109/OPCS59592.2023.10275754

DO - 10.1109/OPCS59592.2023.10275754

M3 - Conference contribution

SN - 9798350331134

T3 - Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023

SP - 25

EP - 30

BT - Proceedings - 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems, OPCS 2023

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

ID: 59187976