Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование
Local search approach for the medianoid problem with multi-purpose shopping trips. / Khapugin, Sergey; Melnikov, Andrey.
Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings. ред. / Michael Khachay; Panos Pardalos; Yury Kochetov. Springer-Verlag GmbH and Co. KG, 2019. стр. 328-341 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11548 LNCS).Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование
}
TY - GEN
T1 - Local search approach for the medianoid problem with multi-purpose shopping trips
AU - Khapugin, Sergey
AU - Melnikov, Andrey
PY - 2019/1/1
Y1 - 2019/1/1
N2 - We consider a modification to the classic medianoid problem, where facilities of different types are present on the market. A newcomer firm opens facilities providing a specific type of products and competes with existing facilities of that type. Each customer requires multiple products of different types and chooses the shortest route visiting facilities providing the needed types of products. A local search approach to maximize the market share of the newcomer firm is proposed, utilizing upper and lower bounds for the customers’ trip lengths to avoid time-consuming computations.
AB - We consider a modification to the classic medianoid problem, where facilities of different types are present on the market. A newcomer firm opens facilities providing a specific type of products and competes with existing facilities of that type. Each customer requires multiple products of different types and chooses the shortest route visiting facilities providing the needed types of products. A local search approach to maximize the market share of the newcomer firm is proposed, utilizing upper and lower bounds for the customers’ trip lengths to avoid time-consuming computations.
KW - Competitive location
KW - Local search
KW - Multi-purpose trips
KW - LOCATION
KW - ALGORITHM
UR - http://www.scopus.com/inward/record.url?scp=85067696379&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-22629-9_23
DO - 10.1007/978-3-030-22629-9_23
M3 - Conference contribution
AN - SCOPUS:85067696379
SN - 9783030226282
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 328
EP - 341
BT - Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings
A2 - Khachay, Michael
A2 - Pardalos, Panos
A2 - Kochetov, Yury
PB - Springer-Verlag GmbH and Co. KG
T2 - 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019
Y2 - 8 July 2019 through 12 July 2019
ER -
ID: 20643421