Dynamic Facility Location Under Cumulative Customer Demand

设施选址问题 运输工程 计算机科学 业务 运筹学 工程类
作者
Warley Almeida Silva,Margarida Carvalho,Sanjay Dominik Jena
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
标识
DOI:10.1287/trsc.2025.0104
摘要

Dynamic facility location problems aim at placing one or more valuable resources over a planning horizon to meet customer demand. The existing literature commonly assumes that customer demand quantities are defined independently for each time period. In many planning contexts, however, unmet demand carries over to future time periods. Unmet demand at some time periods may, therefore, affect decisions of subsequent time periods. This work studies a novel location problem, where the decision maker places facilities over time to capture cumulative customer demand. We propose two mixed-integer programming formulations for this problem, and we show that one of them has a tighter continuous relaxation and allows the representation of more general customer demand behavior. We characterize the computational complexity for this problem and analyze which problem characteristics result in NP hardness. We then propose an exact branch-and-Benders-cut method and show that this method is approximately five times faster, on average, than solving the tighter formulation directly in our computational experiments. Our results also quantify the benefit of accounting for cumulative customer demand within the optimization framework because the corresponding planning solutions perform much better than those obtained by ignoring cumulative demand or employing myopic heuristics. We also draw managerial insights on the quality of service perceived by customers when the provider places facilities under cumulative customer demand. Funding: This work was supported by the Fonds de recherche du Québec [Grant FRQ-Institut de valorisation des données Research Chair], IVADO [Grant FRQ-IVADO Research Chair], and the Natural Sciences and Engineering Research Council of Canada [Grants 2017-05224 and 2024-04051]. Additionally, this work was funded by the Fonds de recherche du Québec - Nature et Technologie [Grant Doctoral Scholarship B2X-328911], and this research was enabled in part by support provided by Calcul Québec and the Digital Research Alliance of Canada. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2025.0104 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
虚心的函完成签到,获得积分10
1秒前
Huang完成签到 ,获得积分10
3秒前
Stone发布了新的文献求助50
5秒前
Mark完成签到 ,获得积分10
7秒前
俺寻思者完成签到,获得积分10
7秒前
ZGH完成签到,获得积分10
7秒前
冷傲的花生完成签到,获得积分10
7秒前
方方完成签到,获得积分10
8秒前
韶可愁完成签到,获得积分10
11秒前
小穆完成签到,获得积分10
11秒前
yuewang完成签到,获得积分10
11秒前
真饿啊完成签到,获得积分10
16秒前
菜吃饭完成签到,获得积分10
17秒前
耶果完成签到,获得积分10
21秒前
adamchris完成签到,获得积分10
21秒前
情怀应助搞怪的萃采纳,获得10
23秒前
25秒前
11完成签到,获得积分10
25秒前
向广宇完成签到 ,获得积分10
26秒前
HCody完成签到 ,获得积分10
27秒前
细心溪流完成签到 ,获得积分10
27秒前
无极微光应助Stone采纳,获得20
27秒前
袁暖完成签到 ,获得积分10
27秒前
大气的湘完成签到,获得积分10
29秒前
lkymxt完成签到,获得积分10
29秒前
hongtaoli2024完成签到 ,获得积分10
30秒前
谢文强完成签到,获得积分10
31秒前
32秒前
CHANG完成签到,获得积分10
33秒前
1111完成签到,获得积分10
39秒前
追梦人2016完成签到 ,获得积分10
39秒前
假装有昵称完成签到,获得积分10
39秒前
隶书完成签到,获得积分10
42秒前
15rtt完成签到 ,获得积分10
44秒前
稿它完成签到,获得积分10
47秒前
健壮的凝冬完成签到 ,获得积分0
47秒前
帅气的祥完成签到,获得积分10
47秒前
阿中完成签到,获得积分10
49秒前
范旭东完成签到,获得积分20
49秒前
49秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Principles of town planning: translating concepts to applications 1000
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
核安全综合知识2024版 500
Photothermal Science and Techniques 500
Digital Displacement Hydrostatic Transmission for Rotorcraft and Distributed Propulsion 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7711581
求助须知:如何正确求助?哪些是违规求助? 9267787
关于积分的说明 20068145
捐赠科研通 7288149
什么是DOI,文献DOI怎么找? 3297256
关于科研通互助平台的介绍 2451805
邀请新用户注册赠送积分活动 2304271