Design of a location and transportation optimization model including quality of service using constrained multinomial logit

H López-Ospina, Á Agudelo-Bernal… - Applied Mathematical …, 2021 - Elsevier
The design of an integrated network with decisions about tactical transportation and
strategic locations is complicated and challenging. In addition to the need to consider cost …

Multiple perspective centrality measures based on facility location problem under inter-group competitive environment

T Fushimi, S Okubo, K Saito - Applied Network Science, 2020 - Springer
In this study, we propose novel centrality measures considering multiple perspectives of
nodes or node groups based on the facility location problem on a spatial network. The …

On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines

EK Gimadi, OY Tsidulko - Proceedings of the Steklov Institute of …, 2021 - Springer
We study the network facility location problem with constraints on the capacities of
communication lines, called Restricted Facility Location Problem (RFLP). It is required to …

Comparative analysis of store opening strategy based on movement behavior model over urban street networks

T Fushimi, M Yazaki - Complex Networks XI: Proceedings of the 11th …, 2020 - Springer
In this study, we address the problem of identifying trade-areas of facilities, such as
convenience stores, gas stations, and supermarkets, based on closeness centrality and …

О ЗАДАЧЕ РАЗМЕЩЕНИЯ С ОГРАНИЧЕНИЯМИ НА ПРОПУСКНЫЕ СПОСОБНОСТИ И ОБЪЕМЫ ПРОИЗВОДСТВА

ЭХ Гимади, АА Курочкина, ЕА Нагорная… - … оптимизации и их …, 2018 - elibrary.ru
1, 4 Институт математики им. СЛ Соболева СО РАН, Новосибирск, Россия 1, 3, 4
Новосибирский государственный университет, Новосибирск, Россия 2 Сибирский …

О сетевой задаче размещения с ограничениями на пропускные способности и объемы производства

ЭХ Гимади, АА Курочкина, ОЮ Цидулко - Интеллектуализация …, 2018 - elibrary.ru
В классической NP-трудной задаче размещения на сети (Facility location problem или
FLP) задан n-вершинный граф G=(V, E), в каждой вершине i∈ V находится клиент c …