Closed-Loop Supply Chain Network Design with Recovery of Glass Containers

2012 ◽  
Vol 3 (4) ◽  
pp. 1-26 ◽  
Author(s):  
Sina Golara ◽  
Nasim Mousavi ◽  
Mohammad Jafar Tarokh ◽  
Mostafa Hosseinzadeh

Reverse logistics (RL) and closed-loop supply chains (CLSC) have recently received enormous attention due to growing environmental concerns and legislations coupled with the lucrative business potential. The main purpose of this paper is to develop a closed-loop supply chain network design model capable of recovering glass containers. A multi-period multi-product mixed-integer linear programming model is proposed to maximize profit. The strategic design of the supply chain is dealt simultaneously with the tactical planning of its operation, which covers procurement, production, storage, distribution, take-back, reprocessing, reuse, and recycling. To illustrate the efficiency and practicability of the model, it is applied to a real-world case of beverage supply chain where the glass containers are either re-used or recycled into their original form, as raw materials. Finally, sensitivity analyses, from a financial perspective, have been conducted to reveal the determinants of profitable product recovery and grasp their managerial implications. The analyses showed that return rate and return acquisition cost have determinant impact on the economic viability of product recovery practice.

2020 ◽  
Vol 12 (2) ◽  
pp. 544 ◽  
Author(s):  
Guanshuang Jiang ◽  
Qi Wang ◽  
Ke Wang ◽  
Qianyu Zhang ◽  
Jian Zhou

Increasing concerns for sustainable development have motivated the study of closed-loop supply chain network design from a multidimensional perspective. To cope with such issues, this paper presents a general closed-loop supply chain network comprising various recovery options and further formulates a multi-objective mixed-integer linear programming model considering enterprise profit and service level simultaneously. Within this model, market segmentation is also considered to meet real-world operating conditions. Moreover, an ε -constraint method and two interactive fuzzy approaches are applied to find a global optimum for this model together with the decisions on the numbers, locations, and capacities of the facilities, as well as the material flow through the network. Ultimately, numerical experiments are conducted to demonstrate the viability and effectiveness of both the proposed model and solution approaches.


Author(s):  
Nasrin Mohabbati-Kalejahi ◽  
Alexander Vinel

Hazardous materials (hazmat) storage and transportation pose threats to people’s safety and the environment, which creates a need for governments and local authorities to regulate such shipments. This paper proposes a novel mathematical model for what is termed the hazmat closed-loop supply chain network design problem. The model, which can be viewed as a way to combine several directions previously considered in the literature, includes two echelons in the forward direction (production and distribution centers), three echelons in the backward direction (collection, recovery, and disposal centers), and emergency response team positioning. The two objectives of minimizing the strategic, tactical, and operational costs as well as the risk exposure on road networks are considered in this model. Since the forward flow of hazmat is directly related to the reverse flow, and since hazmat accidents can occur at all stages of the lifecycle (storage, shipment, loading, and unloading, etc.), it is argued that such a unified framework is essential. A robust framework is also presented to hedge the optimization model in case of demand and return uncertainty. The performance of both models is evaluated based on a standard dataset from Albany, NY. Considering the trade-offs between cost and risk, the results demonstrate the design of efficient hazmat closed-loop supply chain networks where the risk exposure can be reduced significantly by employing the proposed models.


2021 ◽  
pp. 107191
Author(s):  
Subramanian Pazhani ◽  
Abraham Mendoza ◽  
Ramkumar Nambirajan ◽  
T.T. Narendran ◽  
K. Ganesh ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document