A stochastic closed-loop supply chain network design problem with multiple recovery options

被引:38
|
作者
Jerbia, Rim [1 ]
Boujelben, Mouna Kchaou [2 ]
Sehli, Mohamed Amine [1 ]
Jemai, Zied [1 ,3 ]
机构
[1] OASIS ENIT Univ Tunis El Manar, Tunis, Tunisia
[2] UAE Univ, Coll Business & Econ, POB 15551, Al Ain, U Arab Emirates
[3] Univ Paris Saclay, Cent Supelec, LGI, Chatenay Malabry, France
关键词
Closed loop supply chain network design; Reverse logistics; Facility location; MILP; Two-stage stochastic program; REVERSE LOGISTICS; FACILITY LOCATION; PRODUCT-RECOVERY; MODEL; UNCERTAINTY; QUALITY;
D O I
10.1016/j.cie.2018.02.011
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, a closed-loop supply chain network design problem with multiple recovery options is studied. First, the deterministic problem is formulated as a Mixed Integer Linear Program (MILP). A sensitivity analysis is carried out in order to investigate the impact of variations of the main input parameters such as customer return rates, revenues, costs as well as the proportions of returns assigned to each recovery option, on the network structure and the company profit. Then, a stochastic version of the model is developed to account for the high uncertainties faced by companies. A scenario-based approach is used to model the uncertainties of return rates, revenues, costs and the quality of returns. The computational results show that the solution of the stochastic problem is stable over different replications and that the benefit from using stochastic modeling increases when the penalty over non collected returns increases.
引用
收藏
页码:23 / 32
页数:10
相关论文
共 50 条
  • [41] Sustainable closed-loop supply chain network design with discount supposition
    Hajiaghaei-Keshteli, Mostafa
    Fard, Amir Mohammad Fathollahi
    NEURAL COMPUTING & APPLICATIONS, 2019, 31 (09): : 5343 - 5377
  • [42] Sustainable closed-loop supply chain network design with discount supposition
    Mostafa Hajiaghaei-Keshteli
    Amir Mohammad Fathollahi Fard
    Neural Computing and Applications, 2019, 31 : 5343 - 5377
  • [43] A robust fuzzy stochastic programming model for the design of a reliable green closed-loop supply chain network
    Fazli-Khalaf, Mohamadreza
    Mirzazadeh, Abolfazl
    Pishvaee, Mir Saman
    HUMAN AND ECOLOGICAL RISK ASSESSMENT, 2017, 23 (08): : 2119 - 2149
  • [44] Modeling and optimizing the integrated problem of closed-loop supply chain network design and disassembly line balancing
    Ozceylan, Eren
    Paksoy, Turan
    Bektas, Tolga
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2014, 61 : 142 - 164
  • [45] A set of calibrated metaheuristics to address a closed-loop supply chain network design problem under uncertainty
    Abdi, Anita
    Abdi, Andisheh
    Fathollahi-Fard, Amir Mohammad
    Hajiaghaei-Keshteli, Mostafa
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE-OPERATIONS & LOGISTICS, 2021, 8 (01) : 23 - 40
  • [46] Tabu Search and Benders Decomposition Approaches for a Capacitated Closed-Loop Supply Chain Network Design Problem
    Easwaran, Gopalakrishnan
    Uester, Halit
    TRANSPORTATION SCIENCE, 2009, 43 (03) : 301 - 320
  • [47] A network designing method for closed-loop supply chain
    Yao Weixin
    Proceeding of the 2006 International Conference on Management of Logistics and Supply Chain, 2006, : 252 - 256
  • [48] A robust design for a closed-loop supply chain network under an uncertain environment
    Ramezani, Majid
    Bashiri, Mahdi
    Tavakkoli-Moghaddam, Reza
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 66 (5-8): : 825 - 843
  • [49] A robust design for a closed-loop supply chain network under an uncertain environment
    Majid Ramezani
    Mahdi Bashiri
    Reza Tavakkoli-Moghaddam
    The International Journal of Advanced Manufacturing Technology, 2013, 66 : 825 - 843
  • [50] Remanufacturing Network Design for Dual-Channel Closed-Loop Supply Chain
    Chen, Chao
    Zhang, Guoqing
    Shi, Jianmai
    Xia, Yangsheng
    11TH CIRP CONFERENCE ON INDUSTRIAL PRODUCT-SERVICE SYSTEMS, 2019, 83 : 479 - 484