|Title:||A Kernel search matheuristic to solve the discrete leader-follower location problem||Authors:||Santos Peñate, Dolores Rosa
Campos-Rodríguez, Clara M.
Moreno-Pérez, José A.
|UNESCO Clasification:||5304 Actividad económica||Keywords:||Competitive Location
|Issue Date:||2019||Journal:||Networks and Spatial Economics||Abstract:||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.||URI:||http://hdl.handle.net/10553/69962||ISSN:||1566-113X||DOI:||10.1007/s11067-019-09472-7||Source:||Networks and Spatial Economics[ISSN 1566-113X]|
|Appears in Collections:||Artículos|
checked on May 9, 2021
checked on May 10, 2021
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.