IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v36y2024i6p1436-1458.html
   My bibliography  Save this article

Unified Framework for Choice-Based Facility Location Problem

Author

Listed:
  • Yun Hui Lin

    (Institute of High Performance Computing (IHPC), Agency for Science, Technology and Research (A*STAR), Singapore 138632, Republic of Singapore)

  • Qingyun Tian

    (School of Civil and Environmental Engineering, Nanyang Technological University, Singapore 639798, Republic of Singapore)

  • Yanlu Zhao

    (Durham University Business School, Durham University, Durham DH1 3LB, United Kingdom)

Abstract

The choice-based facility location (CBFL) problem arises in various industrial and business contexts. The problem stands on a decentralized perspective: Companies set up chains of facilities, and customers determine from which chain or facility to seek service according to their own preferences. Essentially, customer preferences or choices play a key role in characterizing various CBFL problems, which differ mainly in the models or rules used to characterize the choice. Consequently, a large number of formulations appear and are often solved by dedicatedly designed approaches in the literature. Such a situation significantly complicates practitioners’ decision-making process when they are facing practical problems but are unsure which ad hoc model is suitable for their cases. In this article, we address this dilemma by providing a unified modeling framework based on the concept of preference dominance. Specifically, we conceptualize the choice behavior as a sequential two-step procedure: Given a set of open facilities, each customer first forms a nondominated consideration set and then splits the buying power within the set. Such an interpretation renders practitioners high modeling flexibility as they can tailor how preference dominance is constructed according to their specific contexts. In particular, we show that our model can represent several streams of CBFL problems. To support our model’s applicability, we design an efficient exact decomposition algorithm. Extensive computational studies reveal that although the algorithm is designed for a general purpose, it outperforms most approaches that are tailored for ad hoc problems by a large margin, which justifies both the effectiveness and the efficiency of the unified framework.

Suggested Citation

  • Yun Hui Lin & Qingyun Tian & Yanlu Zhao, 2024. "Unified Framework for Choice-Based Facility Location Problem," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1436-1458, December.
  • Handle: RePEc:inm:orijoc:v:36:y:2024:i:6:p:1436-1458
    DOI: 10.1287/ijoc.2022.0366
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2022.0366
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2022.0366?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Merve Bodur & James R. Luedtke, 2017. "Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty," Management Science, INFORMS, vol. 63(7), pages 2073-2091, July.
    3. Aboolian, Robert & Berman, Oded & Krass, Dmitry, 2007. "Competitive facility location and design problem," European Journal of Operational Research, Elsevier, vol. 182(1), pages 40-62, October.
    4. 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.
    5. Yun Hui Lin & Qingyun Tian & Yanlu Zhao, 2024. "Unified Framework for Choice-Based Facility Location Problem," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1436-1458, December.
    6. Teodora Dan & Patrice Marcotte, 2019. "Competitive Facility Location with Selfish Users and Queues," Operations Research, INFORMS, vol. 67(2), pages 479-497, March.
    7. 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.
    8. 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.
    9. 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.
    10. Peter Peeters & Frank Plastria, 1998. "Discretization results for the Huff and Pareto-Huff competitive location models on networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(2), pages 247-260, December.
    11. 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.
    12. 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.
    13. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
    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. Yun Hui Lin & Qingyun Tian & Yanlu Zhao, 2024. "Unified Framework for Choice-Based Facility Location Problem," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1436-1458, December.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    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. 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).
    9. 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.
    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. Lin, Yun Hui & Wang, Yuan & Lee, Loo Hay & Chew, Ek Peng, 2022. "Omnichannel facility location and fulfillment optimization," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 187-209.
    12. 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.
    13. 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.
    14. 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).
    15. 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.
    16. 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.
    17. Kyosang Hwang & Tooba Binte Asif & Taesik Lee, 2022. "Choice-driven location-allocation model for healthcare facility location problem," Flexible Services and Manufacturing Journal, Springer, vol. 34(4), pages 1040-1065, December.
    18. Julia Heger & Robert Klein, 2024. "Assortment optimization: a systematic literature review," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(4), pages 1099-1161, December.
    19. Zhang, Yue & Liang, Liping & Liu, Emma & Chen, Chong & Atkins, Derek, 2016. "Patient choice analysis and demand prediction for a health care diagnostics company," European Journal of Operational Research, Elsevier, vol. 251(1), pages 198-205.
    20. 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.

    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:inm:orijoc:v:36:y:2024:i:6:p:1436-1458. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.