Closed-Loop Supply Chain Network Design Under Demand and Return Uncertainty

网络规划与设计 供应链 跳跃式监视 供应链网络 数学优化 产品(数学) 随机规划 计算机科学 线性规划 设施选址问题 逆向物流 整数规划 对偶(语法数字) 样品(材料) 运筹学 供应链管理 工程类 数学 色谱法 文学类 艺术 人工智能 化学 法学 计算机网络 政治学 几何学
作者
Halit Üster,Sung Ook Hwang
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
卷期号:51 (4): 1063-1085 被引量:54
标识
DOI:10.1287/trsc.2015.0663
摘要

This study considers an integrated closed-loop supply chain (CLSC) network design problem under uncertainty with regard to product demand and return quantities. To incorporate uncertainty in decision making, we formulate a two-stage stochastic mixed integer linear programming model to determine the optimal locations of (re)manufacturing and processing facilities along with their capacity levels and forward and reverse product flows in the CLSC network to minimize total design and expected operation costs. For the solution of the model and its analysis, we develop a Benders Decomposition approach enhanced for computational efficiency using induced constraints, strengthened Benders cuts, and multiple Benders cuts as well as mean-value scenario based lower-bounding inequalities obtained by dual subproblem disaggregation. Computational results illustrate that the enhancements provide substantial improvements in terms of solution times and quality. Using our model and the solution approach in a sample average approximation framework, we provide further analysis of network designs based on inspection location and recovery rates. Although product inspection at retailer or collection center locations generally reduce costs by avoiding unnecessary use of resources, our analysis also indicates that parameters such as product type and reason-for-return, expected recovery rates, inspection costs, and transportation costs can be instrumental in deciding where the return product inspection should take place and, in turn, dictating the overall cost as well as the structure of the CLSC network.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
雪白扬发布了新的文献求助10
刚刚
1秒前
biggun发布了新的文献求助10
1秒前
2秒前
香蕉觅云应助善良鱼哟采纳,获得10
2秒前
Jasper应助会飞的猪采纳,获得10
2秒前
didi完成签到 ,获得积分10
3秒前
怡然万声发布了新的文献求助20
3秒前
蓝天碧水发布了新的文献求助10
3秒前
simon完成签到,获得积分10
4秒前
4秒前
善学以致用应助hello采纳,获得10
4秒前
禅心发布了新的文献求助10
4秒前
loey完成签到,获得积分10
4秒前
墨酒子完成签到,获得积分10
5秒前
XiaobaoWang完成签到,获得积分10
5秒前
5秒前
希望天下0贩的0应助orang采纳,获得10
5秒前
顾矜应助金不换采纳,获得10
6秒前
日辰彗心完成签到 ,获得积分20
6秒前
汉堡包应助zenzi采纳,获得10
7秒前
传统的襄应助谦让真采纳,获得10
7秒前
lihe198900发布了新的文献求助10
8秒前
Akim应助XiaobaoWang采纳,获得50
8秒前
9秒前
舒适数据线应助自然思松采纳,获得10
9秒前
Liangc333完成签到,获得积分10
9秒前
云康肖发布了新的文献求助10
9秒前
9秒前
biggun完成签到,获得积分10
10秒前
独特成威完成签到 ,获得积分10
10秒前
10秒前
mao12wang完成签到,获得积分10
11秒前
雪白扬完成签到,获得积分10
11秒前
大个应助Waterson采纳,获得10
11秒前
11秒前
激昂的如柏完成签到,获得积分10
12秒前
12秒前
13秒前
13秒前
高分求助中
【重要!!请各位用户详细阅读此贴】科研通的精品贴汇总(请勿应助) 10000
International Code of Nomenclature for algae, fungi, and plants (Madrid Code) (Regnum Vegetabile) 1000
Robot-supported joining of reinforcement textiles with one-sided sewing heads 530
Apiaceae Himalayenses. 2 500
Beyond The Sentence: Discourse And Sentential Form 500
Maritime Applications of Prolonged Casualty Care: Drowning and Hypothermia on an Amphibious Warship 500
Overcoming Synthetic Challenges in Medicinal Chemistry Mechanistic Insights and Solutions 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4076150
求助须知:如何正确求助?哪些是违规求助? 3615169
关于积分的说明 11474715
捐赠科研通 3333050
什么是DOI,文献DOI怎么找? 1832019
邀请新用户注册赠送积分活动 901817
科研通“疑难数据库(出版商)”最低求助积分说明 820528