Sciact
  • EN
  • RU

On the Robust Capacitated Facility Location and Design Problem with Elastic Demand Full article

Journal International Journal of Artificial Intelligence
ISSN: 0974-0635
Output data Year: 2023, Volume: 21, Number: 2, Pages: 93-108 Pages count : 16
Tags robustness, discrete facility location, elastic demand, variable neighborhood search
Authors Levanova Tatyana V. 1,2 , Gnusarev Alexander Y. 1 , Rubtsova Ekaterina A. 2
Affiliations
1 Sobolev Institute of Mathematics
2 Dostoevsky Omsk State University

Funding (1)

1 Russian Science Foundation 21-41-09017

Abstract: In the capacitated facility location and design problem with elastic demand, a new Company plans to open service facilities. The Company fights with a Competitor for a serviced share of all customer demand. This share varies elastically depending on the location and design of the facilities being opened. In this formulation, customer demand is known and assumed to be unchanged. However, in real-world situations, when planning for a certain period, the demand changes, and instead of exact values, its estimates can be given. Therefore, robust location problems have appeared that take this fact into account. In this paper, we formulate a new robust model of the capacitated facility location and design problem with elastic demand. A problem-specified version of the Variable Neighborhood Search algorithm is developed. To organize the search for a solution, special types of neighborhoods are constructed. The results of computational experiments are performed.
Cite: Levanova T.V. , Gnusarev A.Y. , Rubtsova E.A.
On the Robust Capacitated Facility Location and Design Problem with Elastic Demand
International Journal of Artificial Intelligence. 2023. V.21. N2. P.93-108. Scopus
Dates:
Published print: May 13, 2023
Published online: May 13, 2023
Identifiers:
Scopus: 2-s2.0-85153341955
Citing:
DB Citing
Scopus 1