Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Multi-Objective Optimization for Sustainable Closed-Loop Supply Chain Network Under Demand Uncertainty: A Genetic Algorithm (2009.06047v2)

Published 13 Sep 2020 in cs.CY, cs.SY, and eess.SY

Abstract: Supply chain management has been concentrated on productive ways to manage flows through a sophisticated vendor, manufacturer, and consumer networks for decades. Recently, energy and material rates have been greatly consumed to improve the sector, making sustainable development the core problem for advanced and developing countries. A new approach of supply chain management is proposed to maintain the economy along with the environment issue for the design of supply chain as well as the highest reliability in the planning horizon to fulfill customers demand as much as possible. This paper aims to optimize a new sustainable closed-loop supply chain network to maintain the financial along with the environmental factor to minimize the negative effect on the environment and maximize the average total number of products dispatched to customers to enhance reliability. The situation has been considered under demand uncertainty with warehouse reliability. This approach has been suggested the multi-objective mathematical model minimizing the total costs and total CO2 emissions and maximize the reliability in handling for establishing the closed-loop supply chain. Two optimization methods are used namely Multi-Objective Genetic Algorithm Optimization Method and Weighted Sum Method. Two results have shown the optimality of this approach. This paper also showed the optimal point using Pareto front for clear identification of optima. The results are approved to verify the efficiency of the model and the methods to maintain the financial, environmental, and reliability issues.

Citations (5)

Summary

We haven't generated a summary for this paper yet.