IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v302y2022i2p470-481.html
   My bibliography  Save this article

The leader multipurpose shopping location problem

Author

Listed:
  • Lüer-Villagra, Armin
  • Marianov, Vladimir
  • Eiselt, H.A.
  • Méndez-Vogel, Gonzalo

Abstract

This paper extends the follower's retail store location problem of Marianov et al. (2018) to include the leader's decisions. The leader locates its stores knowing that a follower will enter the market later offering a different product. Both maximize their markets given that customers can purchase none, one or two non-essential products on the same trip. The paper determines the best locations for a first and a second entrants through exact and approximated procedures. It turns out that, by locating with foresight, a first entrant can increase the total business in an area for himself and subsequent entrants. We solve the binary programming bi-level resulting problem for small instances by adapting an ad-hoc procedure. Furthermore, a new bi-level reactive GRASP procedure finds solutions for instances of up to 100 nodes in under 3,600 s of CPU time.

Suggested Citation

  • Lüer-Villagra, Armin & Marianov, Vladimir & Eiselt, H.A. & Méndez-Vogel, Gonzalo, 2022. "The leader multipurpose shopping location problem," European Journal of Operational Research, Elsevier, vol. 302(2), pages 470-481.
    • Handle: RePEc:eee:ejores:v:302:y:2022:i:2:p:470-481
    DOI: 10.1016/j.ejor.2022.01.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722000340
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.01.016?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hakimi, S. Louis, 1983. "On locating new facilities in a competitive environment," European Journal of Operational Research, Elsevier, vol. 12(1), pages 29-35, January.
    2. Andresson Silva Firmino & Ricardo Martins Abreu Silva & Valéria Cesário Times, 2019. "A reactive GRASP metaheuristic for the container retrieval problem to reduce crane’s working time," Journal of Heuristics, Springer, vol. 25(2), pages 141-173, April.
    3. Martha-Selene Casas-Ramírez & José-Fernando Camacho-Vallejo & Juan A. Díaz & Dolores E. Luna, 2020. "A bi-level maximal covering location problem," Operational Research, Springer, vol. 20(2), pages 827-855, June.
    4. Matteo Fischetti & Ivana Ljubić & Michele Monaci & Markus Sinnl, 2017. "A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs," Operations Research, INFORMS, vol. 65(6), pages 1615-1637, December.
    5. Marcelo Prais & Celso C. Ribeiro, 2000. "Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 164-176, August.
    6. Vladimir Marianov & H. A. Eiselt, 2016. "On agglomeration in competitive location models," Annals of Operations Research, Springer, vol. 246(1), pages 31-55, November.
    7. Oded Berman & Zvi Drezner & George O. Wesolowsky, 2002. "The collection depots location problem on networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(1), pages 15-24, February.
    8. Oded Berman & Rongbing Huang, 2007. "The Minisum Multipurpose Trip Location Problem on Networks," Transportation Science, INFORMS, vol. 41(4), pages 500-515, November.
    9. Li, Qing & Li, Mingchu & Zhang, Runfa & Gan, Jianyuan, 2021. "A stochastic bilevel model for facility location-protection problem with the most likely interdiction strategy," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    10. Vyacheslav V. Kalashnikov & Stephan Dempe & Gerardo A. Pérez-Valdés & Nataliya I. Kalashnykova & José-Fernando Camacho-Vallejo, 2015. "Bilevel Programming and Applications," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-16, March.
    11. Abareshi, Maryam & Zaferanieh, Mehdi, 2019. "A bi-level capacitated P-median facility location problem with the most likely allocation solution," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 1-20.
    12. Eaton, B Curtis & Lipsey, Richard G, 1982. "An Economic Theory of Central Places," Economic Journal, Royal Economic Society, vol. 92(365), pages 56-72, March.
    13. Marianov, Vladimir & Eiselt, H.A. & Lüer-Villagra, Armin, 2018. "Effects of multipurpose shopping trips on retail store location in a duopoly," European Journal of Operational Research, Elsevier, vol. 269(2), pages 782-792.
    14. Wen, U. P. & Huang, A. D., 1996. "A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 563-571, February.
    15. Espejo, Inmaculada & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2012. "Closest assignment constraints in discrete location problems," European Journal of Operational Research, Elsevier, vol. 219(1), pages 49-58.
    16. Maria Teresa Alonso & Ramon Alvarez-Valdes & Jose Manuel Tamarit & Francisco Parreño, 2014. "A reactive GRASP algorithm for the container loading problem with load-bearing constraints," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 8(5), pages 669-694.
    17. Li, Ran & Tong, Daoqin, 2017. "Incorporating activity space and trip chaining into facility siting for accessibility maximization," Socio-Economic Planning Sciences, Elsevier, vol. 60(C), pages 1-14.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Drezner, Zvi & Eiselt, H.A., 2024. "Competitive location models: A review," European Journal of Operational Research, Elsevier, vol. 316(1), pages 5-18.
    2. Méndez-Vogel, Gonzalo & Marianov, Vladimir & Lüer-Villagra, Armin, 2023. "The follower competitive facility location problem under the nested logit choice rule," European Journal of Operational Research, Elsevier, vol. 310(2), pages 834-846.
    3. Hyoji Choi & Frank Neffke & Donghyeon Yu & Bogang Jun, 2024. "Close to Home: Analyzing Urban Consumer Behavior and Consumption Space in Seoul," Papers 2407.20587, arXiv.org.
    4. Méndez-Vogel, Gonzalo & Marianov, Vladimir & Lüer-Villagra, Armin & Eiselt, H.A., 2023. "Store location with multipurpose shopping trips and a new random utility customers’ choice model," European Journal of Operational Research, Elsevier, vol. 305(2), pages 708-721.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Méndez-Vogel, Gonzalo & Marianov, Vladimir & Lüer-Villagra, Armin & Eiselt, H.A., 2023. "Store location with multipurpose shopping trips and a new random utility customers’ choice model," European Journal of Operational Research, Elsevier, vol. 305(2), pages 708-721.
    2. Vladimir Marianov & H. A. Eiselt & Armin Lüer-Villagra, 2020. "The Follower Competitive Location Problem with Comparison-Shopping," Networks and Spatial Economics, Springer, vol. 20(2), pages 367-393, June.
    3. Marianov, Vladimir & Eiselt, H.A. & Lüer-Villagra, Armin, 2018. "Effects of multipurpose shopping trips on retail store location in a duopoly," European Journal of Operational Research, Elsevier, vol. 269(2), pages 782-792.
    4. Tammy Drezner & Morton O’Kelly & Zvi Drezner, 2023. "Multipurpose shopping trips and location," Annals of Operations Research, Springer, vol. 321(1), pages 191-208, February.
    5. Parreño, Francisco & Pacino, Dario & Alvarez-Valdes, Ramon, 2016. "A GRASP algorithm for the container stowage slot planning problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 141-157.
    6. Vladimir Marianov & H. A. Eiselt, 2016. "On agglomeration in competitive location models," Annals of Operations Research, Springer, vol. 246(1), pages 31-55, November.
    7. Fischetti, Matteo & Monaci, Michele & Sinnl, Markus, 2018. "A dynamic reformulation heuristic for Generalized Interdiction Problems," European Journal of Operational Research, Elsevier, vol. 267(1), pages 40-51.
    8. Freire, Alexandre S. & Moreno, Eduardo & Yushimito, Wilfredo F., 2016. "A branch-and-bound algorithm for the maximum capture problem with random utilities," European Journal of Operational Research, Elsevier, vol. 252(1), pages 204-212.
    9. Parreño-Torres, Consuelo & Alvarez-Valdes, Ramon & Ruiz, Rubén & Tierney, Kevin, 2020. "Minimizing crane times in pre-marshalling problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 137(C).
    10. Xiang Li & Tianyu Zhang & Liang Wang & Hongguang Ma & Xiande Zhao, 2022. "A minimax regret model for the leader–follower facility location problem," Annals of Operations Research, Springer, vol. 309(2), pages 861-882, February.
    11. U. Seppaelae, 1997. "An Evolutionary Model for Spatial Location of Economic Facilities," Working Papers ir97003, International Institute for Applied Systems Analysis.
    12. Cerulli, Martina & Serra, Domenico & Sorgente, Carmine & Archetti, Claudia & Ljubić, Ivana, 2023. "Mathematical programming formulations for the Collapsed k-Core Problem," European Journal of Operational Research, Elsevier, vol. 311(1), pages 56-72.
    13. Nascimento, Paulo Jorge & Silva, Cristóvão & Antunes, Carlos Henggeler & Moniz, Samuel, 2024. "Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems," European Journal of Operational Research, Elsevier, vol. 317(1), pages 92-110.
    14. Thomas Byrne & Sándor P. Fekete & Jörg Kalcsics & Linda Kleist, 2023. "Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game," Annals of Operations Research, Springer, vol. 321(1), pages 79-101, February.
    15. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    16. Cao, Dong & Chen, Mingyuan, 2006. "Capacitated plant selection in a decentralized manufacturing environment: A bilevel optimization approach," European Journal of Operational Research, Elsevier, vol. 169(1), pages 97-110, February.
    17. Foad Mahdavi Pajouh, 2020. "Minimum cost edge blocker clique problem," Annals of Operations Research, Springer, vol. 294(1), pages 345-376, November.
    18. F. Parreño & R. Alvarez-Valdes & J. M. Tamarit & J. F. Oliveira, 2008. "A Maximal-Space Algorithm for the Container Loading Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 412-422, August.
    19. Gilles Duranton, 1997. "La nouvelle économie géographique : agglomération et dispersion," Économie et Prévision, Programme National Persée, vol. 131(5), pages 1-24.
    20. Giat, Yahel & Manes, Eran, 2023. "Firm response to ethically motivated boycotts," European Journal of Operational Research, Elsevier, vol. 305(1), pages 300-311.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:302:y:2022:i:2:p:470-481. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.