A Kernel Search Matheuristic to Solve The Discrete Leader-Follower Location Problem

In the leader-follower, ( r | p )-centroid or Stackelberg location problem, two players sequentially enter the market and compete to provide goods or services. This paper considers this competitive facility location problem in a discrete space. To solve it, the linear programming formulations for th...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Networks and spatial economics Ročník 20; číslo 1; s. 73 - 98
Hlavní autori: Santos-Peñate, Dolores R., Campos-Rodríguez, Clara M., Moreno-Pérez, José A.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.03.2020
Springer Nature B.V
Predmet:
ISSN:1566-113X, 1572-9427
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In the leader-follower, ( r | p )-centroid or Stackelberg location problem, two players sequentially enter the market and compete to provide goods or services. This paper considers this competitive facility location problem in a discrete space. To solve it, the linear programming formulations for the leader and the follower are integrated into an algorithm which, in an iterative process, finds a solution by solving a sequence of these linear problems. We propose a matheuristic procedure that provides solutions for the leader via a kernel search algorithm. Taking into account binary and S-shaped customer choice rules, we present the computational results obtained and compare the exact algorithm with two versions of the kernel search procedure.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1566-113X
1572-9427
DOI:10.1007/s11067-019-09472-7