Facility Location Problem: Modeling Joint Disruptions Using Subordination

接头(建筑物) 设施选址问题 计算机科学 从属关系(语言学) 运输工程 运筹学 工程类 运营管理 土木工程 哲学 语言学
作者
Vishwakant Malladi,Kumar Muthuraman
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
卷期号:58 (5): 1016-1032
标识
DOI:10.1287/trsc.2023.0103
摘要

We study the facility location problem with disruptions where the objective is to choose a set of locations that minimizes the sum of expected servicing and setup costs. Disruptions can affect multiple locations simultaneously and are caused by multiple factors like geography, supply chain characteristics, politics, and ownership. Accounting for the various factors when modeling disruptions is challenging due to a large number of required parameters, the lack of calibration methodologies, the sparsity of disruption data, and the number of scenarios to be considered in the optimization. Because of these reasons, existing models neglect dependence or prespecify the dependence structures. Using partially subordinated Markov chains, we present a comprehensive approach that starts from disruption data, models dependencies, calibrates the disruption model, and optimizes location choices. We construct a metric and a calibration algorithm that learns from the data the strength of dependence, the number of necessary factors (subordinators), and the locations each subordinator affects. We prove that our calibration approach yields consistent estimates of the model parameters. Then, we introduce a variant of the standard approach to the underlying optimization problem, which leverages partially subordinated Markov chains to solve it quickly and precisely. Finally, we demonstrate the efficacy of our approach using twelve different disruption data sets. Our calibrated parameters are robust, and our optimization algorithm performs better than the simulation-based algorithm. The solutions from our model for disruptions have lower costs than those from other disruption models. Our approach allows for better modeling of disruptions from historical data and can be adapted to other problems in logistics, like the hub location, capacitated facility location, and so on., with joint disruptions. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0103 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
1秒前
1秒前
zaizai完成签到,获得积分10
1秒前
上官若男应助tuyfytjt采纳,获得10
1秒前
研友_Z60ObL完成签到,获得积分10
2秒前
小蘑菇应助欢呼尔烟采纳,获得10
2秒前
周宇飞发布了新的文献求助20
2秒前
败者食尘完成签到,获得积分10
3秒前
科目三应助nan采纳,获得10
3秒前
量子星尘发布了新的文献求助10
3秒前
3秒前
彭于晏应助mumu采纳,获得10
3秒前
李爱国应助Fareth采纳,获得10
4秒前
聪慧小霜应助zfcaabbcc采纳,获得10
4秒前
momo发布了新的文献求助10
4秒前
申左一发布了新的文献求助10
4秒前
ZYH发布了新的文献求助10
5秒前
KK发布了新的文献求助10
5秒前
斯文败类应助shusen采纳,获得10
5秒前
5秒前
lincool完成签到,获得积分10
6秒前
ldkl应助收手吧大哥采纳,获得30
6秒前
完美世界应助haoqisheng采纳,获得10
6秒前
小马甲应助郑zz采纳,获得10
7秒前
魔幻小蚂蚁完成签到,获得积分10
7秒前
7秒前
xzp发布了新的文献求助10
7秒前
YU关注了科研通微信公众号
7秒前
7秒前
cw发布了新的文献求助10
7秒前
7秒前
之之完成签到,获得积分10
8秒前
8秒前
8秒前
8秒前
tty发布了新的文献求助10
8秒前
xldhts完成签到,获得积分10
9秒前
不太想学习完成签到 ,获得积分10
9秒前
9秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Manipulating the Mouse Embryo: A Laboratory Manual, Fourth Edition 1000
Comparison of spinal anesthesia and general anesthesia in total hip and total knee arthroplasty: a meta-analysis and systematic review 500
INQUIRY-BASED PEDAGOGY TO SUPPORT STEM LEARNING AND 21ST CENTURY SKILLS: PREPARING NEW TEACHERS TO IMPLEMENT PROJECT AND PROBLEM-BASED LEARNING 500
Founding Fathers The Shaping of America 500
Distinct Aggregation Behaviors and Rheological Responses of Two Terminally Functionalized Polyisoprenes with Different Quadruple Hydrogen Bonding Motifs 460
Writing to the Rhythm of Labor Cultural Politics of the Chinese Revolution, 1942–1976 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 催化作用 遗传学 冶金 电极 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 4576354
求助须知:如何正确求助?哪些是违规求助? 3995613
关于积分的说明 12369373
捐赠科研通 3669547
什么是DOI,文献DOI怎么找? 2022294
邀请新用户注册赠送积分活动 1056342
科研通“疑难数据库(出版商)”最低求助积分说明 943562