A distribution-free-based approach for stochastic food closed-loop supply chain

被引:2
作者
Chen, Ding [1 ,2 ]
Chu, Feng [2 ]
Liu, Ming [3 ]
Huang, Yufei [4 ]
机构
[1] Fuzhou Univ, Sch Econ & Management, Fuzhou, Peoples R China
[2] Univ Evry, Univ Paris Saclay, Lab IBISC, Evry, France
[3] Tongji Univ, Sch Econ & Management, Shanghai, Peoples R China
[4] Trinity Coll Dublin, Trinity Business Sch, Dublin, Ireland
基金
中国国家自然科学基金;
关键词
Circular economy; closed-loop supply chain; perishability; returnable transport items; distribution-free; Lagrangian relaxation; FACILITY LOCATION PROBLEM; INVENTORY-ROUTING PROBLEM; LOT-SIZE MODEL; RETURNABLE TRANSPORT; FLEET DEPLOYMENT; NETWORK DESIGN; SEARCH; OPTIMIZATION; LOGISTICS; PRODUCTS;
D O I
10.1080/00207543.2024.2406994
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Resource scarcity has driven growing interest in circular economy (CE). Closed-loop supply chain (CLSC) with returnable transport items (RTIs) in the food industry is an important component of CE. However, existing works on food CLSC with RTIs have not simultaneously considered the perishability, facility location, and uncertain demand under limited information. Therefore, this work addresses a new food CLSC optimisation problem. We first propose a non-linear chance-constrained programming model. It is then transformed into a mixed-integer linear programming model via using the distribution-free (DF) method and sample average approximation (SAA) method, respectively. An illustrative example reveals that the DF method needs only 10.50% of the computation time of the SAA method. To address large-scale problems, an improved Lagrangian relaxation (LR) method is developed. To address the computational challenge in large-scale problems, an improved Lagrangian relaxation (LR) algorithm is developed. Results show that CPLEX achieves a gap of 75.57%, while the LR surpasses it by finding near-optimal solutions with a gap of 1.22%, using only 31.82% of the computation time required by CPLEX. For this work, the main insights are summarised: (1) extending product shelf life can reduce the total cost; and (2) to alleviate uncertain demand and production risks, production capacity and product inventory capacity can be appropriately expanded, but excessive investment may not improve returns.
引用
收藏
页数:30
相关论文
共 88 条
[1]   Managing uncertain inventories, washing, and transportation of reusable containers in food retailer supply chains [J].
Accorsi, Riccardo ;
Cholette, Susan ;
Manzini, Riccardo ;
Mucci, Lorenzo .
SUSTAINABLE PRODUCTION AND CONSUMPTION, 2022, 31 :331-345
[2]   Robust supply chain network design with multi-products for a company in the food sector [J].
Aras, Necati ;
Bilge, Umit .
APPLIED MATHEMATICAL MODELLING, 2018, 60 :526-539
[3]  
Battini D, 2016, PACKAG TECHNOL SCI, V29, P25, DOI [10.1002/p, 10.1002/pts.2185]
[4]  
Birge JR, 2011, SPRINGER SER OPER RE, P3, DOI 10.1007/978-1-4614-0237-4
[5]   Bi-objective design of fresh food supply chain networks with reusable and disposable packaging containers [J].
Bortolini, Marco ;
Galizia, Francesco Gabriele ;
Mora, Cristina ;
Botti, Lucia ;
Rosano, Michele .
JOURNAL OF CLEANER PRODUCTION, 2018, 184 :375-388
[6]   An oracle-based algorithm for robust planning of production routing problems in closed-loop supply chains of beverage glass bottles [J].
Borumand, Ali ;
Marandi, Ahmadreza ;
Nookabadi, Ali S. ;
Atan, Zuembuel .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2024, 122
[7]   Reformulations to improve the Lagrangian relaxation approach for the capacitated multi-product dynamic lot sizing problem with batch ordering [J].
Bunn, Kevin A. ;
Ventura, Jose A. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2024, 62 (08) :2868-2887
[8]   Process Location and Product Distribution with Uncertain Yields [J].
Caro, Felipe ;
Rajaram, Kumar ;
Wollenweber, Jens .
OPERATIONS RESEARCH, 2012, 60 (05) :1050-1063
[9]   Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items [J].
Carvalho, Desiree M. ;
Nascimento, Maria C. V. .
COMPUTERS & OPERATIONS RESEARCH, 2016, 71 :137-148
[10]  
Chen D., 2023, 2023 IEEE INT C NETW, P1