Sciact
  • EN
  • RU

Variable neighborhood search algorithm for the robust p-median problem Full article

Journal Journal of Mathematical Sciences (United States)
ISSN: 1072-3374 , E-ISSN: 1573-8795
Output data Year: 2025,
Authors Levanova Tatiana 1 , Khmara Ivan 1
Affiliations
1 Sobolev Institute of Mathematics, Omsk Division

Funding (1)

1 Омский филиал ФГБУН «Институт математики им. С.Л. Соболева СО РАН». FWNF-2022-0020

Abstract: The paper is devoted to the development of methods for solving the robust $p$-Median problem in which stability associated with consumer demand is optimized. Using well-known software for this problem requires a lot of CPU time and computer RAM, so we are developing approximate methods. To solve this problem, a problem-oriented versions of the Variable Neighborhood Search Algorithms is proposed. A comparative analysis of the quality of the developments with best known results is carried out, and the experimental data are discussed. Bibliography: 38 titles.
Cite: Levanova T. , Khmara I.
Variable neighborhood search algorithm for the robust p-median problem
Journal of Mathematical Sciences (United States). 2025.
Dates:
Submitted: Jan 20, 2025
Accepted: Jan 20, 2025
Identifiers: No identifiers
Citing: Пока нет цитирований