OPTIMIZATION OF MULTI-CAPACITATED CLOSED-LOOP SUPPLY CHAIN NETWORK PROBLEM WITH MULTI-PRODUCTS AND MULTI-TIME PERIOD USING SMA
Guman Singh1, Mohammad Rizwanullah2, Jay Chandra Yadav3
1,2,3Department of Mathematics and Statistics Manipal University Jaipur, Jaipur, Rajasthan, India
Abstract: Now a days, the Closed-loop Supply Chain Networks Problem (CLSCNP) is a most popular optimization problem. We examine closed-loop supply chains that are multi-capacitated and multi-time period, involving producers, distributors, and recyclers in an unpredictable setting. Examining the retail costs of new products and rewards given to customers for returning their used goods is the main objective. In this study, possibility theory is used to enable Saving Matrix Approach (SMA) to find the best answers in uncertain situations. The primary goal of the study is to reduce the overall cost of closed-loop supply chain network by determining the total number of facilities that will be opened and by maximizing the cost of all forward and reverse flow between the various CLSC network levels. Lastly, sample data is used to analyze theoretical results. To demonstrate the benefits of the suggested strategy, the outcomes.
Keywords: Closed Loop Supply Chain, Network Problem, Saving Matrix Approach, Route, Distance