Unified Framework for Choice-Based Facility Location Problem

Yun Hui Lin (), Qingyun Tian () and Yanlu Zhao ()
Additional contact information
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

INFORMS Journal on Computing, 2024, vol. 36, issue 6, 1436-1458

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.

Keywords: choice-based facility location; consideration set; preference dominance; decomposition algorithm (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2022.0366 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:36:y:2024:i:6:p:1436-1458

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().