论文标题
用于救灾用品的位置和库存预介的随机优化模型
Stochastic Optimization Models for Location and Inventory Prepositioning of Disaster Relief Supplies
论文作者
论文摘要
我们考虑了通过确定在哪里开设仓库以及每个供应项目库存来介绍的问题。然后,在每次灾难之后,将介词的项目分配给垃圾后阶段的需求节点,并根据需要采购和分发其他项目。在灾难层面,受影响的地区,救济项目的需求,可用的临时项目的可用部分,垃圾供应后,采购数量和ARC容量的可用部分通常存在不确定性。为了解决不确定性,我们提出和分析两阶段的随机编程(SP)和分布强大的优化(DRO)模型,假设已知和未知(模棱两可的)不确定性分布。第一阶段和第二阶段分别对应于前盘前和后阶段。我们还提出了一个模型,该模型可以最大程度地减少考虑分布歧义和遵循分配信念之间的权衡。我们使用样品平均近似值获得SP模型的近乎最佳解决方案,并提出了一种计算有效的分解算法来求解我们的DRO模型。我们使用飓风季节和地震作为案例研究进行了广泛的实验,以研究这些方法的计算和运营性能。
We consider the problem of preparing for a disaster season by determining where to open warehouses and how much relief item inventory to preposition in each. Then, after each disaster, prepositioned items are distributed to demand nodes during the post-disaster phase, and additional items are procured and distributed as needed. There is often uncertainty in the disaster level, affected areas locations, the demand for relief items, the usable fraction of prepositioned items post-disaster, procurement quantity, and arc capacity. To address uncertainty, we propose and analyze two-stage stochastic programming (SP) and distributionally robust optimization (DRO) models, assuming known and unknown (ambiguous) uncertainty distributions. The first and second stages correspond to pre- and post-disaster phases, respectively. We also propose a model that minimizes the trade-off between considering distributional ambiguity and following distributional belief. We obtain near-optimal solutions of our SP model using sample average approximation and propose a computationally efficient decomposition algorithm to solve our DRO models. We conduct extensive experiments using a hurricane season and an earthquake as case studies to investigate these approaches' computational and operational performance.