Unified Framework for Choice-Based Facility Location Problem

设施选址问题 计算机科学 单中心问题 数学优化 运筹学 数学
作者
Yun Hui Lin,Qingyun Tian,Yanlu Zhao
出处
期刊:Informs Journal on Computing 卷期号:36 (6): 1436-1458
标识
DOI:10.1287/ijoc.2022.0366
摘要

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. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0366 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0366 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
1秒前
思源应助米尔的猫采纳,获得10
2秒前
kudoukoumei发布了新的文献求助10
2秒前
fancyking发布了新的文献求助10
3秒前
桃子爱学习完成签到,获得积分10
9秒前
Waris完成签到 ,获得积分10
9秒前
Ava应助kudoukoumei采纳,获得10
10秒前
科研通AI5应助秋子采纳,获得10
12秒前
GIA完成签到,获得积分10
13秒前
梁小氓完成签到 ,获得积分10
15秒前
贤惠的早晨完成签到,获得积分10
16秒前
科研通AI2S应助清茶韵心采纳,获得10
16秒前
HEIKU应助WYN采纳,获得10
16秒前
科研通AI5应助爱吃黄豆采纳,获得10
18秒前
怕孤独的草莓完成签到,获得积分10
19秒前
阿托品完成签到 ,获得积分10
24秒前
27秒前
深情安青应助贱小贱采纳,获得10
28秒前
刘帅发布了新的文献求助20
30秒前
31秒前
搜集达人应助希希采纳,获得10
34秒前
34秒前
35秒前
genau000完成签到 ,获得积分10
36秒前
冷静映安完成签到,获得积分10
36秒前
淡淡桐完成签到,获得积分10
37秒前
归尘发布了新的文献求助10
40秒前
科研通AI2S应助徐佳乐采纳,获得10
41秒前
42秒前
Kwanman完成签到,获得积分10
42秒前
HEIKU应助科研通管家采纳,获得10
42秒前
NexusExplorer应助科研通管家采纳,获得10
42秒前
脑洞疼应助科研通管家采纳,获得10
42秒前
搜集达人应助科研通管家采纳,获得10
42秒前
情怀应助科研通管家采纳,获得10
42秒前
43秒前
李爱国应助科研通管家采纳,获得10
43秒前
小马甲应助科研通管家采纳,获得10
43秒前
852应助科研通管家采纳,获得10
43秒前
高分求助中
【此为提示信息,请勿应助】请按要求发布求助,避免被关 20000
Encyclopedia of Geology (2nd Edition) 2000
Maneuvering of a Damaged Navy Combatant 650
Периодизация спортивной тренировки. Общая теория и её практическое применение 310
Mixing the elements of mass customisation 300
the MD Anderson Surgical Oncology Manual, Seventh Edition 300
Nucleophilic substitution in azasydnone-modified dinitroanisoles 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 物理 生物化学 纳米技术 计算机科学 化学工程 内科学 复合材料 物理化学 电极 遗传学 量子力学 基因 冶金 催化作用
热门帖子
关注 科研通微信公众号,转发送积分 3780310
求助须知:如何正确求助?哪些是违规求助? 3325580
关于积分的说明 10223667
捐赠科研通 3040766
什么是DOI,文献DOI怎么找? 1668988
邀请新用户注册赠送积分活动 798962
科研通“疑难数据库(出版商)”最低求助积分说明 758648