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

The follower competitive facility location problem under the nested logit choice rule

Author

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

Abstract

Recently, more realistic customer choice rules based on the Multinomial Logit have been proposed for the follower competitive facility location problem, together with efficient exact solution methods based on cut generation approaches. We address this problem in the case in which a new chain, the entrant, decides to locate some stores in a market where there are already incumbent chains offering substitute products, which differ from the entrant's product in secondary features. The entrant's stores are very similar to each other, and this is also the case for the incumbent chains. In this case, for a given customer, purchases made at the stores of one of the chains are correlated, given the similitude between these stores. The Multinomial Logit rule does not capture this correlation. We propose using a Nested Logit rule which does capture this correlation and, in addition, represents a sequential decision process by the customer, who first chooses the chain and then the store. We prove the concavity of the objective function in the problem and find exact solutions using Branch and Cut over a generalized linear reformulation of the problem and four different types of cuts: submodular and an improvement of these, outer-approximation, and a set of new cuts. Our results show locations that fit better the intuition and practice. Furthermore, our computational times improve in many cases upon the known results for similar problems.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:310:y:2023:i:2:p:834-846
    DOI: 10.1016/j.ejor.2023.03.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723002023
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2023.03.008?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. Lin, Yun Hui & Tian, Qingyun, 2021. "Branch-and-cut approach based on generalized benders decomposition for facility location with limited choice rule," European Journal of Operational Research, Elsevier, vol. 293(1), pages 109-119.
    2. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Alfandari, Laurent & Hassanzadeh, Alborz & Ljubić, Ivana, 2021. "An exact method for assortment optimization under the nested logit model," European Journal of Operational Research, Elsevier, vol. 291(3), pages 830-845.
    4. repec:ulb:ulbeco:2013/1759 is not listed on IDEAS
    5. Papageorgiou, Y. Y. & Thisse, J. -F., 1985. "Agglomeration as spatial interdependence between firms and households," Journal of Economic Theory, Elsevier, vol. 37(1), pages 19-31, October.
    6. de Palma, A, et al, 1985. "The Principle of Minimum Differentiation Holds under Sufficient Heterogeneity," Econometrica, Econometric Society, vol. 53(4), pages 767-781, July.
    7. 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.
    8. 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.
    9. Denoyel, Victoire & Alfandari, Laurent & Thiele, Aurélie, 2017. "Optimizing healthcare network design under reference pricing and parameter uncertainty," European Journal of Operational Research, Elsevier, vol. 263(3), pages 996-1006.
    10. Laurent Alfandari & Alborz Hassanzadeh & Ivana Ljubić, 2021. "An Exact Method for Assortment Optimization under the Nested Logit Model," Working Papers hal-02463159, HAL.
    11. Mai, Tien & Lodi, Andrea, 2020. "A multicut outer-approximation approach for competitive facility location under random utilities," European Journal of Operational Research, Elsevier, vol. 284(3), pages 874-881.
    12. Aros-Vera, Felipe & Marianov, Vladimir & Mitchell, John E., 2013. "p-Hub approach for the optimal park-and-ride facility location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 277-285.
    13. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    14. Vladimir Marianov & H. A. Eiselt, 2016. "On agglomeration in competitive location models," Annals of Operations Research, Springer, vol. 246(1), pages 31-55, November.
    15. Lüer-Villagra, Armin & Marianov, Vladimir, 2013. "A competitive hub location and pricing problem," European Journal of Operational Research, Elsevier, vol. 231(3), pages 734-744.
    16. Ljubić, Ivana & Moreno, Eduardo, 2018. "Outer approximation and submodular cuts for maximum capture facility location problems with random utilities," European Journal of Operational Research, Elsevier, vol. 266(1), pages 46-56.
    17. Haase, Knut & Müller, Sven, 2014. "A comparison of linear reformulations for multinomial logit choice probabilities in facility location models," European Journal of Operational Research, Elsevier, vol. 232(3), pages 689-691.
    18. Benati, Stefano & Hansen, Pierre, 2002. "The maximum capture problem with random utilities: Problem formulation and algorithms," European Journal of Operational Research, Elsevier, vol. 143(3), pages 518-530, December.
    19. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    20. Nemhauser, G.L. & Wolsey, L.A., 1981. "Maximizing submodular set functions: formulations and analysis of algorithms," LIDAM Reprints CORE 455, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    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. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    3. Shaoning Han & Andrés Gómez & Oleg A. Prokopyev, 2022. "Fractional 0–1 programming and submodularity," Journal of Global Optimization, Springer, vol. 84(1), pages 77-93, September.
    4. Georg Bechler & Claudius Steinhardt & Jochen Mackert, 2021. "On the Linear Integration of Attraction Choice Models in Business Optimization Problems," SN Operations Research Forum, Springer, vol. 2(1), pages 1-13, March.
    5. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2023. "Robust maximum capture facility location under random utility maximization models," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1128-1150.
    6. Lin, Yun Hui & Wang, Yuan & He, Dongdong & Lee, Loo Hay, 2020. "Last-mile delivery: Optimal locker location under multinomial logit choice model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    7. Basciftci, Beste & Ahmed, Shabbir & Shen, Siqian, 2021. "Distributionally robust facility location problem under decision-dependent stochastic demand," European Journal of Operational Research, Elsevier, vol. 292(2), pages 548-561.
    8. Steven Lamontagne & Margarida Carvalho & Emma Frejinger & Bernard Gendron & Miguel F. Anjos & Ribal Atallah, 2023. "Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1195-1213, September.
    9. Ljubić, Ivana & Moreno, Eduardo, 2018. "Outer approximation and submodular cuts for maximum capture facility location problems with random utilities," European Journal of Operational Research, Elsevier, vol. 266(1), pages 46-56.
    10. Ralf Krohn & Sven Müller & Knut Haase, 2021. "Preventive healthcare facility location planning with quality-conscious clients," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 59-87, March.
    11. Mai, Tien & Lodi, Andrea, 2020. "A multicut outer-approximation approach for competitive facility location under random utilities," European Journal of Operational Research, Elsevier, vol. 284(3), pages 874-881.
    12. Lin, Yun Hui & Tian, Qingyun, 2021. "Branch-and-cut approach based on generalized benders decomposition for facility location with limited choice rule," European Journal of Operational Research, Elsevier, vol. 293(1), pages 109-119.
    13. Ngan Ha Duong & Tien Thanh Dam & Thuy Anh Ta & Tien Mai, 2022. "Joint Location and Cost Planning in Maximum Capture Facility Location under Multiplicative Random Utility Maximization," Papers 2205.07345, arXiv.org, revised Feb 2023.
    14. Lin, Yunhui & Wang, Yuan & Lee, Loo Hay & Chew, Ek Peng, 2022. "Profit-maximizing parcel locker location problem under threshold Luce model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    15. Vladimir Marianov & H. A. Eiselt, 2016. "On agglomeration in competitive location models," Annals of Operations Research, Springer, vol. 246(1), pages 31-55, November.
    16. Juan Carlos Espinoza Garcia & Laurent Alfandari, 2018. "Robust location of new housing developments using a choice model," Annals of Operations Research, Springer, vol. 271(2), pages 527-550, December.
    17. 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.
    18. Zhang, Yue, 2015. "Designing a retail store network with strategic pricing in a competitive environment," International Journal of Production Economics, Elsevier, vol. 159(C), pages 265-273.
    19. Kübra Tanınmış & Markus Sinnl, 2022. "A Branch-and-Cut Algorithm for Submodular Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2634-2657, September.
    20. Güney, Evren & Leitner, Markus & Ruthmair, Mario & Sinnl, Markus, 2021. "Large-scale influence maximization via maximal covering location," European Journal of Operational Research, Elsevier, vol. 289(1), pages 144-164.

    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:310:y:2023:i:2:p:834-846. 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.