Skip to main content
SpringerLink
Log in

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

  • Published:
Networks and Spatial Economics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Alekseeva E, Kochetova N, Kochetov Y, Plyasunov A (2010) Heuristic and exact methods for the discrete (r|p)-centroid problem. In: Cowling P, Merz P (eds) Proceedings of the 10th European conference on evolutionary computation in combinatorial optimization. Springer, Berlin, pp 11–22

  • Alekseeva E, Kochetov Y, Plyasunov A (2015) An exact method for the discrete (r|p)-centroid problem. J Glob Optim 63(3):445–460

    Google Scholar 

  • Alekseeva E, Kochetov Y (2013) Matheuristics and exact methods for the discrete (r|p)-centroid problem. In: Talbi E (ed) Metaheuristics for bi-level optimization SCI, vol 482, pp 189–219

  • Alekseeva E, Kochetov Y, Talbi E (2017) A matheuristic for the discrete bilevel problem with multiple objectives at the lower level. Int Trans Oper Res 24:959–981

    Google Scholar 

  • Alexandris GP, Bardis NG (2012) A penetration strategy in a competitive environment, recent researches in applications of electrical and computer engineering. In: Proceedings of the 11th international conference on applications of electrical and computer engineering, pp 132–136

  • Aras N, Küçükaydin H (2017) Bilevel models on the competitive facility location problem. In: Mallozzi L, D’Amato E, Pardalos PM (eds) Spatial interaction models. Springer optimization and its applications, vol 118, pp 1–19

  • Ashtiani MG (2016) Competitive location: a-state-of-art review. Int J Ind Eng Comput 7:1–18

    Google Scholar 

  • Ashtiani MG, Makui A, Ramezanian R (2013) A robust model for a leader-follower competitive facility location problem in a discrete space. Appl Math Model 37:62–71

    Google Scholar 

  • Benati S, Laporte G (1994) Tabu search algorithms for the (r|xp)-medianoid and (r|p)-centroid problems. Locat Sci 2:193–204

    Google Scholar 

  • Beresnev V, Melnikov A, et al. (2016) Facility location in unfair competition. In: Kochetov Y (ed) DOOR 2016, LNCS 9869, pp 325–335

  • Berglund PG, Kwon C (2014) Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms. Netw Spat Econ 14:117–132

    Google Scholar 

  • Bhadury J, Eiselt HA, Jaramillo JH (2003) An alternating heuristic for medianoid and centroid problems in the plane. Comput Oper Res 30(4):553–565

    Google Scholar 

  • Biersinger B, Hu B, Raidl G (2016) Models and algorithms for competitive facility location problems with different customer behaviour. Ann Math Artif Intell 76:93–119

    Google Scholar 

  • Biersinger B, Hu B, Raidl G (2015) A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem. J Heuristics 21:391–431

    Google Scholar 

  • Borndörfer R, Omont B, Sagnol G, Swarat E (2012) A Stackelberg game to optimize the distribution of controls in transportation networks. In: Lecture notes of ICST, Proceedings of the 3rd international conference on game theory for networks (GAMENETS 2012), Vancouver, Canada, pp 24–26

  • Campos-Rodríguez CM, Santos-Peñate DR, Moreno-Pérez JA (2010) An exact procedure and LP formulations for the leader-follower location problem. TOP 18(1):97–121

    Google Scholar 

  • Carrizosa E, Davydov I, Kochetov Y (2011) A new alternating heuristic for the (r|p)-centroid problem on the plane. In: Operations research proceedings. Springer, pp 275–280

  • Čvokić DD, Kochetov YA, Plyasunov AV, et al. (2016) A leader-follower hub location problem under fixed markups. In: Kochetov Y (ed) DOOR 2016, LNCS 9869. Springer, pp 350–363

  • Davydov I, Coupechoux M, Iellamo S et al (2016) Tabu search approach for the Bi-Level competitive base station location problem. In: Kochetov Y (ed) DOOR 2016, LNCS 9869. Springer, pp 364–372

  • Davydov I, Kochetov Y, Carrizosa E (2014) A local search heuristic for the (r|p)-centroid problem in the plane. Comput Oper Res 52:334–340

    Google Scholar 

  • Davydov IA, Kochetov YA, Mladenovic N, Urosevic D (2014) Fast metaheuristics for the discrete (r|p)-centroid problem. Autom Remote Control 75(4):677–687

    Google Scholar 

  • Drezner T, Drezner Z (2017) Leader-follower models in facility location. In: Mallozzi L, D’Amato E, Pardalos P M (eds) Spatial interaction models. Springer optimization and its applications, vol 118, pp 73–104

  • Drezner T, Drezner Z, Kalczynski P (2015) A leader-follower model for discrete competitive facility location. Comput Oper Res 64(C):51–59

    Google Scholar 

  • Eiselt HA, Bhadury J, Burkey ML (2011) An optimization-based framework for modeling counterterrorism strategies. OR Insight 26(1):7–31

    Google Scholar 

  • Eiselt HA, Marianov V (2017) Asymmetries in competitive location models on the line. In: Mallozzi L, D’Amato E, Pardalos P M (eds) Spatial interaction models. Springer optimization and its applications, vol 118. Springer, pp 105–128

  • Eiselt HA, Marianov V, Drezner T (2015) Competitive location models. In: Laporte G, Nickel S, Saldanha da Gama F (eds) Location science. Springer, pp 365–398

  • Fukuyama K, Kimura J, Ikeda Y (2012) Locating vendors in stackelberg competition in a linear monocentric city. In: IEEE international conference on systems man, and cybernetics, pp 2785–2790

  • García Pérez MD, Pelegrín Pelegrín B (2003) All stackelberg location equilibria in the hotelling’s duopoly model on a tree with parametric prices. Ann Oper Res 122:177–192

    Google Scholar 

  • Gentile J, Pessoa AA, Poss M, Roboredo MC (2018) Integer programming formulations for three sequential discrete competitive location problems with foresight. Eur J Oper Res 265(3):872–881

    Google Scholar 

  • Ghosh A, Craig CS (1984) A location-allocation model for facility planning in a competitive environment. Geogr Anal 16(1):39–51

    Google Scholar 

  • Guastaroba G, Speranza MG (2012) Kernel search for the capacitated facility location problem. J Heuristics 18(6):877–917

    Google Scholar 

  • Guastaroba G, Speranza MG (2014) A heuristic for BILP problems: the single source capacitated facility location problem. Eur J Oper Res 238:438–450

    Google Scholar 

  • G.-Tóth B, Kovács K (2016) Solving a Huff-like Stackelberg location problem on networks. J Glob Optim 64:233–247

    Google Scholar 

  • Hakimi SL Mirchandani PB, Francis RL (eds) (1990) Location with spatial interactions: competitive locations and games. Wiley, New York

  • Hendrix EMT (2016) On competition in a Stackelberg location-design model with deterministic supplier choice. Ann Oper Res 246:19–30

    Google Scholar 

  • Hooshmand F, Mirhassani SA (2018), An effective bilevel programming approach for the evasive flow capturing location problem. Networks and Spatial Economics, https://doi.org/10.1007/s11067-018-9415-0

  • Karakitsiou A (2015) Modeling discrete competitive facility location, SpringerBriefs in Optimization, Springer

  • Kress D, Pesch E (2012) Sequential competitive location on networks. Eur J Oper Res 217(3):483–499

    Google Scholar 

  • Mahmutogullari AI, Kara BY (2015) Hub location under competition. Eur J Oper Res 250(1):214–225

    Google Scholar 

  • Majumder P (2008) Leadership and competition in networks supply chains. Manag Sci 54(6):1189–1204

    Google Scholar 

  • Mansini R, Speranza MG (1999) Heuristic algorithms for the portfolio selection problem with minimum transaction lots. Eur J Oper Res 114:219–233

    Google Scholar 

  • Marianov V, Eiselt HA (2016) On agglomeration in competitive location models. Ann Oper Res 246(1):31–55

    Google Scholar 

  • Miller TC, Friesz TL, Tobin RL (1996) Equilibrium facility location on networks. Springer, Berlin

    Google Scholar 

  • Miller TC, Friesz TL, Tobin RL, Kwon C (2007) Reaction function based dynamic location modeling in Stackelberg-Nash-Cournot competition. Netw Spat Econ 7:77–97

    Google Scholar 

  • Plastria F, Vanhaverbeke L (2008) Discrete models for competitive location with foresight. Comput Oper Res 35:683–700

    Google Scholar 

  • Qi M, Xia M, Zhang Y, Miao L (2017) Competitive facility location problem with foresight considering service distance limitations. Comput Ind Eng 112:483–491

    Google Scholar 

  • Redondo JL, Fernández J, García I, Ortigosa PM (2010) Heuristics for the facility location and design (1|1)-centroid problem on the plane. Comput Optim Appl 45(1):111–141

    Google Scholar 

  • Rhim H, Ho TH, Karmarkar US (2003) Competitive location, production, and market selection. Eur J Oper Res 149:211–228

    Google Scholar 

  • Roboredo MC, Pessoa AA (2013) A branch-and-bound algorithm for the discrete (r|p)-centroid problem. Eur J Oper Res 224:101–109

    Google Scholar 

  • Sáiz M E, Hendrix EMT, Fernández J, Pelegrín B (2009) On a branch-and-bound approach for a Huff-like Stackelberg location problem. OR Spectr 31:679–705

    Google Scholar 

  • Santos-Peñate DR, Campos-Rodríguez CM, Moreno-Pérez JA (2019) The generalized discrete centroid problem. Int Trans Oper Res 26:340–363

    Google Scholar 

  • Santos-Peñate DR, Suárez-Vega R, Dorta-Gonzalez P (2007) The leader-follower location model. Netw Spat Econ 7:45–61

    Google Scholar 

  • Sasaki M, Campbell JF, Krishnamoorthy M, Ernst AT (2014) A Stackelberg hub arc location model for a competitive environment. Comput Oper Res 47:27–41

    Google Scholar 

  • Sasaki M, Fukushima M (2001) Stackelberg hub location problem. J Oper Res Soc Jpn 44(4):390–402

    Google Scholar 

  • Snyder LV (2006) Facility location under uncertainty: a review. IIE Trans 38 (7):547–564

    Google Scholar 

  • Spoerhase J, Wirth HC (2009) (r|p)-centroid problems on paths and trees. Theor Comput Sci 410:5128–5137

    Google Scholar 

  • Teraoka Y, Osumi S, Hohjo H (2003) Some stackelberg type location game. Computers and Mathematics with Applications 46:1147–1154

    Google Scholar 

  • Uno T, Katagiri H, Kosukec K (2012) A Stackelberg solution for fuzzy random competitive location problems with demand site uncertainty. Intelligent Decision Technologies 6(1):69–75

    Google Scholar 

  • Yang D, Jiao J, Ji Y, Du G, Helo P, Valete A (2015) Joint optimization for coordinated configuration of product families and supply chains by a leader-follower Stackelberg game. Eur J Oper Res 246:263–280

    Google Scholar 

  • Yue D, You F (2014) Game-theoretic modeling and optimization of multi-echelon supply chain design and operation under Stackelberg game and market equilibrium. Comput Chem Eng 71:347–361

    Google Scholar 

  • Zadeh LA (1978) Fuzzy sets as a basis for a theory of possibility. Fuzzy Set Syst 1:3–28

    Google Scholar 

  • Zhang Y, Snyder LV, Ralphs TK, Xue Z (2016) The competitive facility location problem under disruption risks. Transp Res E 93:453–473

    Google Scholar 

Download references

Acknowledgements

This study was partially funded by Ministerio de Economía y Competitividad (Spanish Government) with FEDER funds, through grants ECO2014-59067-P and TIN2015-70226-R, and also by Fundación Cajacanarias (grant 2016TUR19).

Author information

Authors and Affiliations

  1. Instituto de Turismo y Desarrollo Económico Sostenible/Dpto de Métodos Cuantitativos en Economía y Gestión, Universidad de Las Palmas de G.C., 35017, Las Palmas de Gran Canaria, Spain

    Dolores R. Santos-Peñate

  2. Instituto Universitario de Desarrollo Regional, Universidad de La Laguna, 38271, La Laguna, Spain

    Clara M. Campos-Rodríguez & José A. Moreno-Pérez

Authors
  1. Dolores R. Santos-Peñate
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Clara M. Campos-Rodríguez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. José A. Moreno-Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dolores R. Santos-Peñate.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Santos-Peñate, D.R., Campos-Rodríguez, C.M. & Moreno-Pérez, J.A. A Kernel Search Matheuristic to Solve The Discrete Leader-Follower Location Problem. Netw Spat Econ 20, 73–98 (2020). https://doi.org/10.1007/s11067-019-09472-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11067-019-09472-7

Keywords

Search

Navigation