Variable Neighborhood Search Approach for the Bi-criteria Competitive Location and Design Problem with Elastic Demand | Sciact - Система учета научной деятельности ИМ СО РАН

Variable Neighborhood Search Approach for the Bi-criteria Competitive Location and Design Problem with Elastic Demand Научная публикация

Конференция

22nd International conference "Mathematical Optimization Theory and Operations Research"
02-08 июл. 2023 , Екатеринбург

Сборник

Mathematical Optimization Theory and Operations Research: Recent Trends
Сборник, Springer. 2023. 406 c.

Журнал

Communications in Computer and Information Science
ISSN: 1865-0929

Вых. Данные

Год: 2023, Страницы: 243-258 Страниц : 16 DOI: 10.1007/978-3-031-43257-6_19

Ключевые слова

Robustness · Bi-criteria optimization · Integer programming · Competitive location problem · Variable neighborhood search

Авторы

Levanova Tatyana ¹ , Gnusarev Alexander ¹ , Rubtsova Ekaterina ² , Sigaev Vyatcheslav ³

Организации

1	Sobolev Institute of Mathematics, Omsk, Russia
2	Dostoevsky Omsk State University, Omsk, Russia
3	Avtomatika-Servis LLC, Omsk, Russia

Информация о финансировании (1)

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

FWNF-2022-0020

In this paper, we develop a bi-criteria approach to solving the competitive location and design problem with elastic demand. The problem involves a new company, its competitor, and its consumers. The competitor has already placed its enterprises. The new company can choose the locations and the design variants for its facilities within the budget. Consumers independently choose service points from the open facilities of the company or competitor based on their preferences. The goal of the new company is to capture the largest possible share of the total demand. This situation is described using a non-linear integer programming model. In real situations, demand data and other parameters may change. In this case, it is necessary to make a decision that would be stable regarding such changes. We consider one of the concepts of robustness and formulate a new bi-criteria statement of the problem under consideration. In addition to the criterion that maximizes the share of the total demand, it also contains a criterion that maximizes the robustness of the solutions obtained. To solve the bi-criteria problem, we propose an algorithm based on variable neighborhood search and a modified version of the SEMO evolutionary algorithm. The features of the problem and the presence of two criteria are taken into account. Experimental studies have been carried out. The quality of the solutions obtained is analyzed, and a comparison with previous developments is discussed.

Levanova T. , Gnusarev A. , Rubtsova E. , Sigaev V.
Variable Neighborhood Search Approach for the Bi-criteria Competitive Location and Design Problem with Elastic Demand
В сборнике Mathematical Optimization Theory and Operations Research: Recent Trends. – Springer., 2023. – Т.1881. – C.243-258. DOI: 10.1007/978-3-031-43257-6_19 Scopus OpenAlex

Опубликована в печати:	21 сент. 2023 г.
Опубликована online:	21 сент. 2023 г.

Scopus:	2-s2.0-85174563882
OpenAlex:	W4386891747

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