需求不确定和社会捐赠条件下瓦塞尔斯坦分布稳健型紧急救援网络设计的分解方案

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Weiqiao Wang , Kai Yang , Lixing Yang , Ziyou Gao , Jianjun Dong , Haifeng Zhang
{"title":"需求不确定和社会捐赠条件下瓦塞尔斯坦分布稳健型紧急救援网络设计的分解方案","authors":"Weiqiao Wang ,&nbsp;Kai Yang ,&nbsp;Lixing Yang ,&nbsp;Ziyou Gao ,&nbsp;Jianjun Dong ,&nbsp;Haifeng Zhang","doi":"10.1016/j.cor.2024.106913","DOIUrl":null,"url":null,"abstract":"<div><div>Social donations have played a crucial role in providing effective emergency relief and need to be particularly valued and used wisely. In this study, we address a Wasserstein distributionally robust emergency relief network design problem with demand uncertainty by taking into account the social donations. Specifically, we first formulate the problem into a two-stage stochastic programming model that requires the probability distribution information of the uncertain demand is completely known in advance, where the first stage decides on the location and pre-positioning of resources, and the second stage optimizes the delivery volume of the reserved and donated supplies offered by social organizations and individual. As the probability distribution of the demand cannot be known precisely (i.e., ambiguous) in reality, we further extend the stochastic model to a Wasserstein distributionally robust optimization model, in which the ambiguous demand is captured by the Wasserstein ambiguity set. Theoretically, we derive the tractable deterministic reformulations of the proposed distributionally robust optimization model under Type-<span><math><mi>∞</mi></math></span> and Type-1 Wasserstein metrics. To solve the extensive reformulations, we design a decomposition scheme on the basis of the Benders decomposition framework by adopting aggregated multiple cuts, cut-loop stabilization at root node and stabilized k-opt local branching acceleration strategies. Finally, we carry out numerical experiments to illustrate the computational advantage of the proposed solution method over the single acceleration implementation on hypothetical instances, and demonstrate the superiority of the proposed modeling approach compared with the traditional stochastic programming and robust optimization models on a real case study. The results show that the distributionally robust optimization approach used better trade-offs between cost and risk.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"175 ","pages":"Article 106913"},"PeriodicalIF":4.1000,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A decomposition scheme for Wasserstein distributionally robust emergency relief network design under demand uncertainty and social donations\",\"authors\":\"Weiqiao Wang ,&nbsp;Kai Yang ,&nbsp;Lixing Yang ,&nbsp;Ziyou Gao ,&nbsp;Jianjun Dong ,&nbsp;Haifeng Zhang\",\"doi\":\"10.1016/j.cor.2024.106913\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Social donations have played a crucial role in providing effective emergency relief and need to be particularly valued and used wisely. In this study, we address a Wasserstein distributionally robust emergency relief network design problem with demand uncertainty by taking into account the social donations. Specifically, we first formulate the problem into a two-stage stochastic programming model that requires the probability distribution information of the uncertain demand is completely known in advance, where the first stage decides on the location and pre-positioning of resources, and the second stage optimizes the delivery volume of the reserved and donated supplies offered by social organizations and individual. As the probability distribution of the demand cannot be known precisely (i.e., ambiguous) in reality, we further extend the stochastic model to a Wasserstein distributionally robust optimization model, in which the ambiguous demand is captured by the Wasserstein ambiguity set. Theoretically, we derive the tractable deterministic reformulations of the proposed distributionally robust optimization model under Type-<span><math><mi>∞</mi></math></span> and Type-1 Wasserstein metrics. To solve the extensive reformulations, we design a decomposition scheme on the basis of the Benders decomposition framework by adopting aggregated multiple cuts, cut-loop stabilization at root node and stabilized k-opt local branching acceleration strategies. Finally, we carry out numerical experiments to illustrate the computational advantage of the proposed solution method over the single acceleration implementation on hypothetical instances, and demonstrate the superiority of the proposed modeling approach compared with the traditional stochastic programming and robust optimization models on a real case study. The results show that the distributionally robust optimization approach used better trade-offs between cost and risk.</div></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":\"175 \",\"pages\":\"Article 106913\"},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S030505482400385X\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S030505482400385X","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

社会捐赠在提供有效的紧急救援方面发挥了至关重要的作用,需要特别重视并合理使用。在本研究中,我们通过考虑社会捐赠,解决了一个具有需求不确定性的 Wasserstein 分布稳健型紧急救援网络设计问题。具体来说,我们首先将该问题表述为一个两阶段随机编程模型,要求事先完全知道不确定需求的概率分布信息,其中第一阶段决定资源的位置和预置,第二阶段优化社会组织和个人提供的预留和捐赠物资的交付量。由于现实中需求的概率分布无法精确获知(即模糊性),我们进一步将随机模型扩展为瓦瑟斯坦分布稳健优化模型,其中模糊需求由瓦瑟斯坦模糊集捕捉。从理论上讲,我们推导出了所提出的分布稳健优化模型在 Type-∞ 和 Type-1 Wasserstein 度量下的可操作性确定性重构。为了解决广泛的重构问题,我们在本德斯分解框架的基础上设计了一种分解方案,采用了聚合多重切割、根节点切割环稳定和稳定的 k-opt 局部分支加速策略。最后,我们进行了数值实验,在假设实例上说明了所提求解方法相对于单一加速实现的计算优势,并在实际案例研究中证明了所提建模方法相对于传统随机编程和鲁棒优化模型的优越性。结果表明,分布稳健优化方法能更好地权衡成本和风险。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A decomposition scheme for Wasserstein distributionally robust emergency relief network design under demand uncertainty and social donations
Social donations have played a crucial role in providing effective emergency relief and need to be particularly valued and used wisely. In this study, we address a Wasserstein distributionally robust emergency relief network design problem with demand uncertainty by taking into account the social donations. Specifically, we first formulate the problem into a two-stage stochastic programming model that requires the probability distribution information of the uncertain demand is completely known in advance, where the first stage decides on the location and pre-positioning of resources, and the second stage optimizes the delivery volume of the reserved and donated supplies offered by social organizations and individual. As the probability distribution of the demand cannot be known precisely (i.e., ambiguous) in reality, we further extend the stochastic model to a Wasserstein distributionally robust optimization model, in which the ambiguous demand is captured by the Wasserstein ambiguity set. Theoretically, we derive the tractable deterministic reformulations of the proposed distributionally robust optimization model under Type- and Type-1 Wasserstein metrics. To solve the extensive reformulations, we design a decomposition scheme on the basis of the Benders decomposition framework by adopting aggregated multiple cuts, cut-loop stabilization at root node and stabilized k-opt local branching acceleration strategies. Finally, we carry out numerical experiments to illustrate the computational advantage of the proposed solution method over the single acceleration implementation on hypothetical instances, and demonstrate the superiority of the proposed modeling approach compared with the traditional stochastic programming and robust optimization models on a real case study. The results show that the distributionally robust optimization approach used better trade-offs between cost and risk.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信