Construction of a new robust dual-channel supply chain network with forward logistics and reverse logistics

IF 6.7 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Qianxue Zhang , Hongliang Li , Huili Pei , Naiqi Liu
{"title":"Construction of a new robust dual-channel supply chain network with forward logistics and reverse logistics","authors":"Qianxue Zhang ,&nbsp;Hongliang Li ,&nbsp;Huili Pei ,&nbsp;Naiqi Liu","doi":"10.1016/j.cie.2025.111075","DOIUrl":null,"url":null,"abstract":"<div><div>Dual-channel closed-loop supply chain (CLSC) is a new supply chain model that integrates the offline and online sales channels into a CLSC. Dual-channel CLSC involves more echelons, which often leads to uncertainty in the dual-channel CLSC design. Although some studies have focused on uncertain dual-channel CLSC designs, there are still research gaps in the existing literature, such as a lack of robust models, inefficiencies in existing designs, and limited attention to certain industries. To fill these research gaps, we examine the design of the CLSC network based on partially known distribution information about uncertain transportation costs and demand. We construct a moment ambiguity set for uncertain costs and a bounded unimodal ambiguity set for uncertain demand. Using these ambiguity sets, we develop a new distributionally robust optimization (DRO) model with ambiguous chance constraints (ACCs) for the dual-channel CLSC design problem, which can be reformulated as a computationally tractable mixed-integer linear programming (MILP) model. To enhance solving efficiency, we build an accelerated Benders decomposition (BD) algorithm for the MILP model. A case study on BYD automotive illustrates the effectiveness of our developed approach. The computational results demonstrate that our proposed model withstands uncertainties in transportation costs and demand with a probability of 95%, establishing a dual-channel CLSC network that balances robustness and cost-effectiveness, resulting in a total cost reduction of approximately 14% compared to the deterministic model. Additionally, the sensitivity analysis reveal that the adjustment of the ACC tolerance level, the proportion of online and offline sales, and the handling methods of products significantly influence BYD Auto.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111075"},"PeriodicalIF":6.7000,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835225002219","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Dual-channel closed-loop supply chain (CLSC) is a new supply chain model that integrates the offline and online sales channels into a CLSC. Dual-channel CLSC involves more echelons, which often leads to uncertainty in the dual-channel CLSC design. Although some studies have focused on uncertain dual-channel CLSC designs, there are still research gaps in the existing literature, such as a lack of robust models, inefficiencies in existing designs, and limited attention to certain industries. To fill these research gaps, we examine the design of the CLSC network based on partially known distribution information about uncertain transportation costs and demand. We construct a moment ambiguity set for uncertain costs and a bounded unimodal ambiguity set for uncertain demand. Using these ambiguity sets, we develop a new distributionally robust optimization (DRO) model with ambiguous chance constraints (ACCs) for the dual-channel CLSC design problem, which can be reformulated as a computationally tractable mixed-integer linear programming (MILP) model. To enhance solving efficiency, we build an accelerated Benders decomposition (BD) algorithm for the MILP model. A case study on BYD automotive illustrates the effectiveness of our developed approach. The computational results demonstrate that our proposed model withstands uncertainties in transportation costs and demand with a probability of 95%, establishing a dual-channel CLSC network that balances robustness and cost-effectiveness, resulting in a total cost reduction of approximately 14% compared to the deterministic model. Additionally, the sensitivity analysis reveal that the adjustment of the ACC tolerance level, the proportion of online and offline sales, and the handling methods of products significantly influence BYD Auto.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Industrial Engineering
Computers & Industrial Engineering 工程技术-工程:工业
CiteScore
12.70
自引率
12.70%
发文量
794
审稿时长
10.6 months
期刊介绍: Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.
×
引用
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学术官方微信