TY - JOUR
T1 - Designing a closed-loop supply chain network considering multi-task sales agencies and multi-mode transportation
AU - Zahedi, Ali
AU - Salehi-Amiri, Amirhossein
AU - Hajiaghaei-Keshteli, Mostafa
AU - Diabat, Ali
N1 - Publisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH, DE part of Springer Nature.
PY - 2021/4
Y1 - 2021/4
N2 - Current national and international regulations, along with growing environmental concerns, have deeply influenced the design of supply chain networks. These decisions stem from the fact that decision-makers try to design the supply chain network to align with their economic and environmental objectives. In this paper, a new closed-loop supply chain network with sales agency and customers is formulated. The proposed model has four echelons in the forward direction and five echelons in the backwards direction. The model not only considers several constraints from previous studies, but also addresses new constraints in order to better explore real-life problems that employ different transportation modes and that rely on sale agency centers. The objective function is to maximize the total profit. In addition, this study firstly considers distinct cluster of customers based on the product life cycle. These customers are utilized in different levels of the proposed network in order to purchase the final products, returned products, and recycled products. The structure of the model is based on linear mixed-integer programming, and the proposed model has been investigated through a case study regarding the manufacturing industry. To verify the model efficiency, a set of metaheuristics and hybrid algorithm are applied in various test problems along with a data from a real-world case study in a building construction industry. The findings of the proposed network illustrated that using the attributes of sale agency centers and clusters of customers both increase the problem total revenue and the number of the collected returned products.
AB - Current national and international regulations, along with growing environmental concerns, have deeply influenced the design of supply chain networks. These decisions stem from the fact that decision-makers try to design the supply chain network to align with their economic and environmental objectives. In this paper, a new closed-loop supply chain network with sales agency and customers is formulated. The proposed model has four echelons in the forward direction and five echelons in the backwards direction. The model not only considers several constraints from previous studies, but also addresses new constraints in order to better explore real-life problems that employ different transportation modes and that rely on sale agency centers. The objective function is to maximize the total profit. In addition, this study firstly considers distinct cluster of customers based on the product life cycle. These customers are utilized in different levels of the proposed network in order to purchase the final products, returned products, and recycled products. The structure of the model is based on linear mixed-integer programming, and the proposed model has been investigated through a case study regarding the manufacturing industry. To verify the model efficiency, a set of metaheuristics and hybrid algorithm are applied in various test problems along with a data from a real-world case study in a building construction industry. The findings of the proposed network illustrated that using the attributes of sale agency centers and clusters of customers both increase the problem total revenue and the number of the collected returned products.
KW - Closed-loop supply chain
KW - Keshtel algorithm
KW - Revenue management
KW - Reverse logistics
KW - Supply chain design
UR - http://www.scopus.com/inward/record.url?scp=85100343802&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85100343802&partnerID=8YFLogxK
U2 - 10.1007/s00500-021-05607-6
DO - 10.1007/s00500-021-05607-6
M3 - Article
AN - SCOPUS:85100343802
SN - 1432-7643
VL - 25
SP - 6203
EP - 6235
JO - Soft Computing
JF - Soft Computing
IS - 8
ER -