Local search approach for the medianoid problem with multi-purpose shopping trips

Sergey Khapugin, Andrey Melnikov

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationMathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings
EditorsMichael Khachay, Panos Pardalos, Yury Kochetov
PublisherSpringer-Verlag GmbH and Co. KG
Pages328-341
Number of pages14
ISBN (Print)9783030226282
DOIs
Publication statusPublished - 1 Jan 2019
Event18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019 - Ekaterinburg, Russian Federation
Duration: 8 Jul 201912 Jul 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11548 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019
CountryRussian Federation
CityEkaterinburg
Period08.07.201912.07.2019

Keywords

  • Competitive location
  • Local search
  • Multi-purpose trips
  • LOCATION
  • ALGORITHM

Fingerprint

Dive into the research topics of 'Local search approach for the medianoid problem with multi-purpose shopping trips'. Together they form a unique fingerprint.

Cite this