Variable neighborhood search algorithm for the robust p-median problem | Sciact - Система учета научной деятельности ИМ СО РАН

Variable neighborhood search algorithm for the robust p-median problem Научная публикация

Журнал

Journal of Mathematical Sciences (United States)
ISSN: 1072-3374 , E-ISSN: 1573-8795

Вых. Данные

Год: 2025,

Авторы

Levanova Tatiana ¹ , Khmara Ivan ¹

Организации

1	Sobolev Institute of Mathematics, Omsk Division

Информация о финансировании (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). 2025.

Поступила в редакцию:	20 янв. 2025 г.
Принята к публикации:	20 янв. 2025 г.

Нет идентификаторов

Пока нет цитирований