绿色视野:动态供应链管理中的可持续全球物流

IF 4.3 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Mahsa Mohammadi, Babak Mohamadpour Tosarkani
{"title":"绿色视野:动态供应链管理中的可持续全球物流","authors":"Mahsa Mohammadi,&nbsp;Babak Mohamadpour Tosarkani","doi":"10.1016/j.cor.2025.107226","DOIUrl":null,"url":null,"abstract":"<div><div>Supply chain management in a global scale involves addressing numerous uncertainties, from demand fluctuations to unforeseen disruptions. Developing advanced solution approaches is critical to manage such complexities and ensure resilience. This study presents a multi-stage stochastic–dynamic model for the global supply chain, incorporating hedging policies. The aim is to identify optimal order scheduling for bill of materials, production planning, and inventory management across warehouses (i.e., materials and finished products). Due to the dynamic nature of the global supply chain (e.g., demand fluctuations, disruptions, and lead time), a multi-stage stochastic model is developed for the stochastic–dynamic supply chain network. To address dynamic factors of real-world global supply chain, an accelerated parallel stochastic dual dynamic integer programming <strong><em>(SDDiP)</em></strong> approach is proposed to deal with disruptions (e.g., political unrest, natural disasters, and pandemics), enhancing supply chain resiliency. To validate the proposed parallel <strong><em>SDDiP</em></strong>, various scenarios with different sizes are generated using the case study and compared to the <strong><em>SDDiP</em></strong> with Benders cuts and integrated stage-wise Lagrangian dual cut (<strong><em>SWLDC</em></strong>) (i.e., <strong><em>SDDiP-SWLDC</em></strong>). According to the obtained results, the proposed parallel node strategy for accelerated <strong><em>SDDiP</em></strong> consistently outperforms the basic stochastic dual dynamic programming <strong><em>(SDDP)</em></strong> and demonstrated robust CPU scalability. Evaluation across various scenario sizes shows stochastic dual dynamic integer programming-mixed integer rounding cuts (<strong><em>SDDiP-MIR</em></strong>) achieving faster computation and a smaller 7% optimality gap compared to <strong><em>SDDiP-SWLDC</em></strong> and <strong><em>SDDiP</em></strong> in large-size instances, highlighting its superior performance in complex supply chain settings.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"185 ","pages":"Article 107226"},"PeriodicalIF":4.3000,"publicationDate":"2025-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Green horizons: Sustainable global logistics in dynamic supply chain management\",\"authors\":\"Mahsa Mohammadi,&nbsp;Babak Mohamadpour Tosarkani\",\"doi\":\"10.1016/j.cor.2025.107226\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Supply chain management in a global scale involves addressing numerous uncertainties, from demand fluctuations to unforeseen disruptions. Developing advanced solution approaches is critical to manage such complexities and ensure resilience. This study presents a multi-stage stochastic–dynamic model for the global supply chain, incorporating hedging policies. The aim is to identify optimal order scheduling for bill of materials, production planning, and inventory management across warehouses (i.e., materials and finished products). Due to the dynamic nature of the global supply chain (e.g., demand fluctuations, disruptions, and lead time), a multi-stage stochastic model is developed for the stochastic–dynamic supply chain network. To address dynamic factors of real-world global supply chain, an accelerated parallel stochastic dual dynamic integer programming <strong><em>(SDDiP)</em></strong> approach is proposed to deal with disruptions (e.g., political unrest, natural disasters, and pandemics), enhancing supply chain resiliency. To validate the proposed parallel <strong><em>SDDiP</em></strong>, various scenarios with different sizes are generated using the case study and compared to the <strong><em>SDDiP</em></strong> with Benders cuts and integrated stage-wise Lagrangian dual cut (<strong><em>SWLDC</em></strong>) (i.e., <strong><em>SDDiP-SWLDC</em></strong>). According to the obtained results, the proposed parallel node strategy for accelerated <strong><em>SDDiP</em></strong> consistently outperforms the basic stochastic dual dynamic programming <strong><em>(SDDP)</em></strong> and demonstrated robust CPU scalability. Evaluation across various scenario sizes shows stochastic dual dynamic integer programming-mixed integer rounding cuts (<strong><em>SDDiP-MIR</em></strong>) achieving faster computation and a smaller 7% optimality gap compared to <strong><em>SDDiP-SWLDC</em></strong> and <strong><em>SDDiP</em></strong> in large-size instances, highlighting its superior performance in complex supply chain settings.</div></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":\"185 \",\"pages\":\"Article 107226\"},\"PeriodicalIF\":4.3000,\"publicationDate\":\"2025-08-26\",\"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/S0305054825002552\",\"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/S0305054825002552","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

全球范围内的供应链管理涉及处理从需求波动到不可预见的中断等众多不确定因素。开发先进的解决方案方法对于管理此类复杂性和确保弹性至关重要。本研究提出了一个包含套期保值政策的全球供应链多阶段随机动态模型。其目的是确定物料清单、生产计划和仓库(即材料和成品)库存管理的最佳订单调度。由于全球供应链的动态性(例如,需求波动、中断和交货时间),为随机动态供应链网络开发了一个多阶段随机模型。为了解决现实世界全球供应链的动态因素,提出了一种加速并行随机对偶动态整数规划(SDDiP)方法来处理中断(如政治动荡、自然灾害和流行病),增强供应链的弹性。为了验证所提出的并行SDDiP,使用案例研究生成了不同尺寸的各种场景,并将其与具有Benders切割和集成分段拉格朗日双切割(即SDDiP-SWLDC)的SDDiP进行了比较。结果表明,所提出的加速SDDiP并行节点策略优于基本随机对偶动态规划(SDDP),具有较强的CPU可扩展性。在各种场景规模下的评估表明,与SDDiP- swldc和SDDiP相比,随机对偶动态整数规划-混合整数四舍五入切割(SDDiP- mir)在大型实例中实现了更快的计算速度和更小的7%最优性差距,突出了其在复杂供应链环境中的优越性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Green horizons: Sustainable global logistics in dynamic supply chain management
Supply chain management in a global scale involves addressing numerous uncertainties, from demand fluctuations to unforeseen disruptions. Developing advanced solution approaches is critical to manage such complexities and ensure resilience. This study presents a multi-stage stochastic–dynamic model for the global supply chain, incorporating hedging policies. The aim is to identify optimal order scheduling for bill of materials, production planning, and inventory management across warehouses (i.e., materials and finished products). Due to the dynamic nature of the global supply chain (e.g., demand fluctuations, disruptions, and lead time), a multi-stage stochastic model is developed for the stochastic–dynamic supply chain network. To address dynamic factors of real-world global supply chain, an accelerated parallel stochastic dual dynamic integer programming (SDDiP) approach is proposed to deal with disruptions (e.g., political unrest, natural disasters, and pandemics), enhancing supply chain resiliency. To validate the proposed parallel SDDiP, various scenarios with different sizes are generated using the case study and compared to the SDDiP with Benders cuts and integrated stage-wise Lagrangian dual cut (SWLDC) (i.e., SDDiP-SWLDC). According to the obtained results, the proposed parallel node strategy for accelerated SDDiP consistently outperforms the basic stochastic dual dynamic programming (SDDP) and demonstrated robust CPU scalability. Evaluation across various scenario sizes shows stochastic dual dynamic integer programming-mixed integer rounding cuts (SDDiP-MIR) achieving faster computation and a smaller 7% optimality gap compared to SDDiP-SWLDC and SDDiP in large-size instances, highlighting its superior performance in complex supply chain settings.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术文献互助群
群 号:604180095
Book学术官方微信