Abstract
In a closed-loop supply chain network, the aim is to ensure a smooth flow of materials and attaining the maximum value from returning and end-of-life goods. This paper presents a single-objective deterministic mixed integer linear programming (MILP) model for the closed-loop supply chain (CLSC) network design problem consisting of plants, collection centers, disposal centers, and customer zones. Our model minimizes the total costs comprising fixed opening cost of plants, collection, disposal centers, and transportation costs of products among the nodes. As supply chain network design problems belong to the class of NP-hard problems, a novel league championship algorithm (LCA) with a modified priority-based encoding is applied to find a near-optimal solution. New operators are defined for the LCA to search the discrete space. Numerical comparison of our proposed encoding with the existing approaches in the literature is indicative of the high quality performance of the proposed encoding.
Highlights
Nowadays, supply chain management (SCM) has received attention in several organizations
This paper presents a single-objective deterministic mixed integer linear programming (MILP) model for the closed-loop supply chain (CLSC) network design problem consisting of plants, collection centers, disposal centers, and customer zones
The present paper proposes a MILP model for design of a CLSC network consisting of plants, collection centers, disposal centers, and customer zones
Summary
Supply chain management (SCM) has received attention in several organizations. The forward supply chain is defined as a set of activities converting raw materials to products as well as storing and distributing products to the customers, while the reverse supply chain consists of a series of activities such as collection, inspection, repair, recovery, and disposal of used products. Integration of reverse and forward supply chains creates a CLSC. The present paper proposes a MILP model for design of a CLSC network consisting of plants, collection centers, disposal centers, and customer zones. It addresses two different problems, i.e., the facility location problem and the quantity of flow between facility optimization. A discrete LCA with a Mathematical Problems in Engineering new modified priority-based encoding is applied to solve the proposed model to minimize the total network costs
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
