scholarly journals A novel algorithm to allocate customers and retailers in a closed-loop supply chain under probabilistic demand

2022 ◽  
Author(s):  
Omid Keramatlou ◽  
Nikbakhsh Javadian ◽  
Hosein Didehkhani ◽  
Mohammad Amirkhan
Keyword(s):  
Supply Chain ◽  
Closed Loop ◽  
Heuristic Algorithms ◽  
Programming Model ◽  
Solution Process ◽  
Closed Loop Supply Chain ◽  
Optimization Software ◽  
Minimum Value ◽  
Proposed Model ◽  
Nonlinear Programming Model

Abstract In this paper, a closed-loop supply chain (CLSC) is modeled to obtain the best location of retailers and allocate them to other utilities. The structure of CLSC includes production centers, retailers’ centers, probabilistic customers, collection, and disposal centers. In this research, two strategies are considered to find the best location for retailers by focusing on 1- the type of expected movement 2- expected coverage (distance and time) for minimizing the costs and maximizing the profit by considering the probabilistic customer and uncertainly demand. First of all, the expected distances between customers and retailers are calculated per movement method. These values are compared with the Maximum expected coverage distance of retailers, which is displayed in algorithm 1 heuristically, and the minimum value is picked. Also, to allocate customers to retailers, considering the customer's movement methods and comparing it with Maximum expected coverage time, which is presented in Algorithm 2 heuristically, the minimum value is chosen to this end, a bi-objective nonlinear programming model is proposed. This model concurrently compares Strategies 1 and 2 to select the best competitor. Based on the chosen strategy, the best allocation is determined by employing two heuristic algorithms, and the locations of the best retailers are determined. As the proposed model is NP-hard, a meta-heuristics (non-dominated sorting genetic) algorithm is employed for the solution process. Afterward, the effectiveness of the proposed model is validated and confirmed, and the obtained results are analyzed. For this purpose, a numerical example is given and solved through the optimization software.

scholarly journals A hybrid NSGA-II algorithm for the closed-loop supply chain network design in e-commerce  

2021 ◽  
Author(s):  
Shayan Shafiee Moghadam ◽  
Amir Aghsami ◽  
Masoud Rabbani
Keyword(s):  
Supply Chain ◽  
Closed Loop ◽  
Programming Model ◽  
Mixed Integer ◽  
Modern World ◽  
Supply Chain Network ◽  
Nsga Ii ◽  
Closed Loop Supply Chain ◽  
Proposed Model ◽  
Nonlinear Programming Model

Designing the supply chain network is one of the significant areas in e-commerce business management. This concept plays a crucial role in e-commerce systems. For example, location-inventory-pricing-routing of an e-commerce supply chain is considered a crucial issue in this field. This field established many severe challenges in the modern world, like maintaining the supply chain for returned items, preserving customers' trust and satisfaction, and developing an applicable supply chain with cost considerations. The research proposes a multi-objective mixed integer nonlinear programming model to design a closed-loop supply chain network based on the e-commerce context. The proposed model incorporates two objectives that optimize the business's total profits and the customers' satisfaction. Then, numerous numerical examples are generated and solved using the epsilon constraint method in GAMS optimization software. The validation of the given model has been tested for the large problems via a hybrid two-level non-dominated sort genetic algorithm. Finally, some sensitivity analysis has been performed to provide some managerial insights.

The Uncertain Programming of the Closed-Loop Supply Chain with Remanufacturing System

2012 ◽  
Vol 190-191 ◽  
pp. 218-221 ◽  
Author(s):  
Yu Juan Chen ◽  
Dong Bo Liu ◽  
Hong Wei Mao ◽  
Zi Qiang Zhang
Keyword(s):  
Supply Chain ◽  
Hybrid System ◽  
Closed Loop ◽  
Programming Model ◽  
Uncertain Programming ◽  
Fuzzy Simulation ◽  
Closed Loop Supply Chain ◽  
Proposed Model ◽  
Uncertain Model ◽  
Intelligent Optimization Algorithm

This paper addresses an integrated uncertain programming model for a closed-loop supply chain with manufacturing/remanufacturing hybrid system. The hybrid system is studied under the grey fuzzy uncertainty and grey uncertainty. The hybrid intelligent optimization algorithm integrating the grey fuzzy simulation, neural network and genetic algorithm can optimize the uncertain model. One numerical example is given to illustrate the effectiveness of the proposed model and algorithm.

scholarly journals A Nonlinear Integer Programming Model for Integrated Location, Inventory, and Routing Decisions in a Closed-Loop Supply Chain

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-17 ◽  
Author(s):  
Hao Guo ◽  
Congdong Li ◽  
Ying Zhang ◽  
Chunnan Zhang ◽  
Yu Wang
Keyword(s):  
Supply Chain ◽  
Integer Programming ◽  
Facility Location ◽  
Vehicle Routing ◽  
Closed Loop ◽  
Programming Model ◽  
Nonlinear Integer Programming ◽  
Inventory Routing ◽  
Closed Loop Supply Chain ◽  
Integer Programming Model

Facility location, inventory management, and vehicle routing are three important decisions in supply chain management, and location-inventory-routing problems consider them jointly to improve the performance and efficiency of today’s supply chain networks. In this paper, we study a location-inventory-routing problem to minimize the total cost in a closed-loop supply chain that has forward and reverse logistics flows. First, we formulate this problem as a nonlinear integer programming model to optimize facility location, inventory control, and vehicle routing decisions simultaneously in such a system. Second, we develop a novel heuristic approach that incorporates simulated annealing into adaptive genetic algorithm to solve the model efficiently. Last, numerical analysis is presented to validate our solution approach, and it also provides meaningful managerial insight into how to improve the closed-loop supply chain under study.

Robust optimization model for sustainable supply chain for production and distribution of polyethylene pipe

2020 ◽  
Vol 15 (4) ◽  
pp. 1613-1653
Author(s):  
Jaber Valizadeh ◽  
Ehsan Sadeh ◽  
Zainolabedin Amini Sabegh ◽  
Ashkan Hafezalkotob
Keyword(s):  
Genetic Algorithm ◽  
Supply Chain ◽  
Environmental Impacts ◽  
Closed Loop ◽  
Optimal Location ◽  
Computational Time ◽  
Closed Loop Supply Chain ◽  
Content Type ◽  
Proposed Model ◽  
Production And Distribution

Purpose In this study, the authors consider the key decisions in the design of the green closed-loop supply chain (CSLC) network. These decisions include considering the optimal location of suppliers, production facilities, distribution, customers, recycling centers and disposal of non-recyclable goods. In the proposed model, the level of technology used in recycling and production centers is taken into account. Moreover, in this paper is the environmental impacts of production and distribution of products based on the eco-indicator 99 are considered. Design/methodology/approach In this study, the author consider the key decisions in the design of the green CLSC network. These decisions include considering the optimal location of suppliers, production facilities, distribution, customers, recycling centers and disposal of non-recyclable goods. In the proposed model, the level of technology used in recycling and production centers is taken into account. Moreover, the environmental impacts of production and distribution of products based on the eco-indicator 99 are considered. Findings The results indicate that the results obtained from the colonial competition algorithm have higher quality than the genetic algorithm. This quality of results includes relative percentage deviation and computational time of the algorithm and it is shown that the computational time of the colonial competition algorithm is significantly lower than the computational time of the genetic algorithm. Furthermore, the limit test and sensitivity analysis results show that the proposed model has sufficient accuracy. Originality/value Solid modeling of the green supply chain of the closed loop using the solid optimized method by Bertsimas and Sim. Development of models that considered environmental impacts to the closed loop supply chain. Considering the impact of the technology type in the manufacture of products and the recycling of waste that will reduce emissions of environmental pollutants. Another innovation of the model is the multi-cycle modeling of the closed loop of supply chain by considering the uncertainty and the fixed and variable cost of transport.

Multi-objective robust optimization for multi-stage-multi-product agile closed-loop supply chain under uncertainty in the context of circular economy

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Saeid Jafarzadeh Ghoushchi ◽  
Iman Hushyar ◽  
Kamyar Sabri-Laghaie
Keyword(s):  
Supply Chain ◽  
Robust Optimization ◽  
Circular Economy ◽  
Closed Loop ◽  
Mixed Integer ◽  
Closed Loop Supply Chain ◽  
Content Type ◽  
Multi Objective ◽  
Multi Stage ◽  
Proposed Model

PurposeA circular economy (CE) is an economic system that tries to eliminate waste and continually use resources. Due to growing environmental concerns, supply chain (SC) design should be based on the CE considerations. In addition, responding and satisfying customers are the challenges managers constantly encounter. This study aims to improve the design of an agile closed-loop supply chain (CLSC) from the CE point of view.Design/methodology/approachIn this research, a new multi-stage, multi-product and multi-period design of a CLSC network under uncertainty is proposed that aligns with the goals of CE and SC participants. Recycling of goods is an important part of the CLSC. Therefore, a multi-objective mixed-integer linear programming model (MILP) is proposed to formulate the problem. Besides, a robust counterpart of multi-objective MILP is offered based on robust optimization to cope with the uncertainty of parameters. Finally, the proposed model is solved using the e-constraint method.FindingsThe proposed model aims to provide the strategic choice of economic order to the suppliers and third-party logistic companies. The present study, which is carried out using a numerical example and sensitivity analysis, provides a robust model and solution methodology that are effective and applicable in CE-related problems.Practical implicationsThis study shows how all upstream and downstream units of the SC network must work integrated to meet customer needs considering the CE context.Originality/valueThe main goal of the CE is to optimize resources, reduce the use of raw materials, and revitalize waste by recycling. In this study, a comprehensive model that can consider both SC design and CE necessities is developed that considers all SC participants.

A Mathematical Programming Model with Equilibrium Constraints for Competitive Closed-Loop Supply Chain Network Design

2017 ◽  
Vol 34 (05) ◽  
pp. 1750026 ◽  
Author(s):  
Yuxiang Yang ◽  
Zuqing Huang ◽  
Qiang Patrick Qiang ◽  
Gengui Zhou
Keyword(s):  
Supply Chain ◽  
Mathematical Programming ◽  
Network Design ◽  
Closed Loop ◽  
Programming Model ◽  
Market Competition ◽  
Network Design Problem ◽  
Equilibrium Constraints ◽  
Mathematical Programming Model ◽  
Closed Loop Supply Chain

A firm sets up his facilities including manufacturing/remanufacturing plants and distribution/collection centers, incorporating an existing closed-loop supply chain (CLSC) network. The entering firm has to compete with the existing firms in the existing network. The entering firm behaves as the leader of a Stackelberg game while the existing firms in the existing network are followers. We assume that the entering firm can anticipate the existing firms’ reaction to his potential location decision before choosing his optimal policy. We use a CLSC network equilibrium model in which the decision makers are faced with multiple objectives to capture the existing firms’ reaction. A mathematical programming model with equilibrium constraints is developed for this competitive CLSC network design problem by taking into account the market competition existing in the decentralized CLSC network. A solution method is developed by integrating Genetic algorithm with an inexact logarithmic-quadratic proximal augmented Lagrangian method. Finally, numerical examples and the related results are studied for illustration purpose.

Sign in / Sign up

Export Citation Format

Share Document