A variable neighborhood search algorithm for the (r∣ p) hub–centroid problem under the price war

Dimitrije D. Čvokić, Yury A. Kochetov, Aleksandr V. Plyasunov, Aleksandar Savić

Результат исследования: Научные публикации в периодических изданияхстатьярецензирование

Аннотация

This study considers the (r∣ p) hub–centroid problem under the price war, which was recently proposed in the literature. The objective is profit maximization by choosing the best hub and spoke topology, with the corresponding price structure, in a leader–follower setting. Because this bi–level optimization problem is NP–hard, the use of metaheuristics is a natural choice for solving real–size instances. A variable neighborhood search algorithm is designed as a solution approach for the leader. The characterization of optimal routes under the price equilibrium is given in order to simplify and improve the algorithm. When it comes to the follower, we have shown how to reformulate in a linear fashion the initial non–linear model. The computational experiments are conducted on the CAB instances. The results of these experiments are thoroughly discussed, highlighting the effects of different parameters and providing some interesting managerial insights.

Язык оригиналаанглийский
ЖурналJournal of Global Optimization
DOI
СостояниеОпубликовано - 22 мая 2021

Предметные области OECD FOS+WOS

  • 5.09 ПРОЧИЕ СОЦИАЛЬНЫЕ НАУКИ
  • 1.02 КОМПЬЮТЕРНЫЕ И ИНФОРМАЦИОННЫЕ НАУКИ
  • 1.01 МАТЕМАТИКА
  • 5.02.PE ИССЛЕДОВАНИЕ ОПЕРАЦИЙ И НАУКА УПРАВЛЕНИЯ

Fingerprint

Подробные сведения о темах исследования «A variable neighborhood search algorithm for the (r∣ p) hub–centroid problem under the price war». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать