Variable neighborhood search algorithm for the robust p-median problem Научная публикация
| Конференция |
8th International conference Nonlinear Analysis and Extremal Problems (NLA-2024) 24-28 июн. 2024 , Иркутск |
||
|---|---|---|---|
| Журнал |
Journal of Mathematical Sciences (United States)
ISSN: 1072-3374 , E-ISSN: 1573-8795 |
||
| Вых. Данные | Год: 2026, Том: 300, Номер: 3, Страницы: 354-362 Страниц : 9 DOI: 10.1007/s10958-026-08508-x | ||
| Ключевые слова | location problem, p-median, robustness, approximate methods, local search, variable neighborhood search, artificial intelligence algorithms | ||
| Авторы |
|
||
| Организации |
|
Информация о финансировании (1)
| 1 | Омский филиал ФГБУН «Институт математики им. С.Л. Соболева СО РАН». | FWNF-2022-0020 |
Реферат:
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.
Библиографическая ссылка:
Levanova T.
, Khmara I.
Variable neighborhood search algorithm for the robust p-median problem
Journal of Mathematical Sciences (United States). 2026. V.300. N3. P.354-362. DOI: 10.1007/s10958-026-08508-x Scopus
Variable neighborhood search algorithm for the robust p-median problem
Journal of Mathematical Sciences (United States). 2026. V.300. N3. P.354-362. DOI: 10.1007/s10958-026-08508-x Scopus
Даты:
| Поступила в редакцию: | 20 дек. 2024 г. |
| Принята к публикации: | 10 июн. 2026 г. |
| Опубликована online: | 19 июн. 2026 г. |
Идентификаторы БД:
| ≡ Scopus: | 2-s2.0-105042362397 |