Resilient downstream oil supply chain under interdiction and recovery resources allocation using a Column and Constraint Generation algorithm

IF 4.3 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2025-05-01 Epub Date: 2025-01-25 DOI:10.1016/j.cor.2025.106978
Leyla Ahmadpour , Rashed Sahraeian , Kourosh Eshghi
{"title":"Resilient downstream oil supply chain under interdiction and recovery resources allocation using a Column and Constraint Generation algorithm","authors":"Leyla Ahmadpour ,&nbsp;Rashed Sahraeian ,&nbsp;Kourosh Eshghi","doi":"10.1016/j.cor.2025.106978","DOIUrl":null,"url":null,"abstract":"<div><div>A downstream oil supply chain designates the last section of an oil supply chain, which involves the distribution of refined oil products to demand zones. We study in this paper intentional disruptions called interdictions in this supply chain to provide a secure and resilient system. Such a system, which is enabled by fortification elements, is capable of restoring its operations as fast as possible after interdictions. It is vital to take into account the product delivery times affected by interdiction, especially in critical supply chains such as the oil industry. Also, the recovery resources after an interdiction are limited. So, we propose a tri-level defender-attacker-defender model to address the problem in which product delivery time and recovery resources allocation are included. Next, we present two exact solution approaches, including Implicit Enumeration (IE) and Column and Constraint Generation (C&amp;CG), to solve the tri-level model. C&amp;CG provides high-quality solutions in a reasonable time compared to the IE. We apply the proposed algorithms to a case study regarding an Iranian downstream oil supply chain. We also conduct an analysis to assess the robustness of the solutions. Sensitivity analysis indicates that increasing the recovery capacity results in a cost reduction of 5 percent on average.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106978"},"PeriodicalIF":4.3000,"publicationDate":"2025-05-01","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/S0305054825000061","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/25 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

A downstream oil supply chain designates the last section of an oil supply chain, which involves the distribution of refined oil products to demand zones. We study in this paper intentional disruptions called interdictions in this supply chain to provide a secure and resilient system. Such a system, which is enabled by fortification elements, is capable of restoring its operations as fast as possible after interdictions. It is vital to take into account the product delivery times affected by interdiction, especially in critical supply chains such as the oil industry. Also, the recovery resources after an interdiction are limited. So, we propose a tri-level defender-attacker-defender model to address the problem in which product delivery time and recovery resources allocation are included. Next, we present two exact solution approaches, including Implicit Enumeration (IE) and Column and Constraint Generation (C&CG), to solve the tri-level model. C&CG provides high-quality solutions in a reasonable time compared to the IE. We apply the proposed algorithms to a case study regarding an Iranian downstream oil supply chain. We also conduct an analysis to assess the robustness of the solutions. Sensitivity analysis indicates that increasing the recovery capacity results in a cost reduction of 5 percent on average.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于列约束生成算法的拦截和回收资源分配下的弹性下游石油供应链
下游石油供应链指的是石油供应链的最后一段,包括将成品油产品分销到需求区域。在本文中,我们研究了在供应链中被称为阻断的故意中断,以提供一个安全和有弹性的系统。这种由防御工事组成的系统能够在封锁后尽快恢复其运作。至关重要的是要考虑到受封锁影响的产品交付时间,特别是在石油行业等关键供应链中。此外,拦截后的恢复资源是有限的。因此,我们提出了一个三层防御者-攻击者-防御者模型来解决包含产品交付时间和恢复资源分配的问题。接下来,我们提出了两种精确解决方法,包括隐式枚举(IE)和列与约束生成(C&;CG),以解决三层模型。与IE相比,CG可以在合理的时间内提供高质量的解决方案。我们将提出的算法应用于一个关于伊朗下游石油供应链的案例研究。我们还进行了分析,以评估解决方案的稳健性。敏感性分析表明,提高采油能力平均可使成本降低5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
A dual-heuristic crossover genetic algorithm with variable neighborhood search for flexible job shop scheduling with transportation times Solving heterogeneous vehicle routing problems using decomposition and set covering Multi-depot electric vehicle routing problem with half-open rotations: a formulation and metaheuristic algorithms The covering tour problem with path upgrades Combining relax-and-fix and fix-and-optimize approaches to solve the Multi-Item Capacitated Lot-Sizing Problem with Unrelated Parallel Machines
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1