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

Outer approximation and submodular cuts for maximum capture facility location problems with random utilities

Author

Listed:
  • Ljubić, Ivana
  • Moreno, Eduardo

Abstract

We consider a family of competitive facility location problems in which a “newcomer” company enters the market and has to decide where to locate a set of new facilities so as to maximize its market share. The multinomial logit model is used to estimate the captured customer demand. We propose a first branch-and-cut approach for this family of difficult mixed-integer non-linear problems. Our approach combines two types of cutting planes that exploit particular properties of the objective function: the first one are the outer-approximation cuts and the second one are the submodular cuts.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:266:y:2018:i:1:p:46-56
    DOI: 10.1016/j.ejor.2017.09.023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717308445
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.09.023?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. 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.
    2. Sven Müller & Knut Haase & Sascha Kless, 2009. "A Multiperiod School Location Planning Approach with Free School Choice," Environment and Planning A, , vol. 41(12), pages 2929-2945, December.
    3. 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.
    4. Aboolian, Robert & Berman, Oded & Krass, Dmitry, 2007. "Competitive facility location model with concave demand," European Journal of Operational Research, Elsevier, vol. 181(2), pages 598-619, September.
    5. 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.
    6. Gilbert Laporte & Jorge Riera-Ledesma & Juan-José Salazar-González, 2003. "A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem," Operations Research, INFORMS, vol. 51(6), pages 940-951, December.
    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. 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).
    9. Fischetti, Matteo & Ljubić, Ivana & Sinnl, Markus, 2016. "Benders decomposition without separability: A computational study for capacitated facility location problems," European Journal of Operational Research, Elsevier, vol. 253(3), pages 557-569.
    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, 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.
    2. Kitthamkesorn, Songyot & Chen, Anthony & Ryu, Seungkyu & Opasanon, Sathaporn, 2024. "Maximum capture problem based on paired combinatorial weibit model to determine park-and-ride facility locations," Transportation Research Part B: Methodological, Elsevier, vol. 179(C).
    3. 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.
    4. 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.
    5. 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.
    6. G．-Tóth, Boglárka & Anton-Sanchez, Laura & Fernández, José, 2024. "A Huff-like location model with quality adjustment and/or closing of existing facilities," European Journal of Operational Research, Elsevier, vol. 313(3), pages 937-953.
    7. 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.
    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. 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).
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. Laurent Alfandari & Victoire Denoyel & Aurélie Thiele, 2020. "Solving utility-maximization selection problems with Multinomial Logit demand: Is the First-Choice model a good approximation?," Annals of Operations Research, Springer, vol. 292(1), pages 553-573, September.
    15. Küçükaydin, Hande & Aras, Necati & Kuban AltInel, I., 2011. "Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution," European Journal of Operational Research, Elsevier, vol. 208(3), pages 206-220, February.
    16. Songyot Kitthamkesorn & Anthony Chen & Sathaporn Opasanon & Suwicha Jaita, 2021. "A P-Hub Location Problem for Determining Park-and-Ride Facility Locations with the Weibit-Based Choice Model," Sustainability, MDPI, vol. 13(14), pages 1-16, July.
    17. H Küçükaydın & N Aras & İ K Altınel, 2011. "A discrete competitive facility location model with variable attractiveness," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1726-1741, September.
    18. 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.
    19. 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.
    20. 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.

    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:266:y:2018:i:1:p:46-56. 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.