|
A novel algorithm to allocate customers and retailers in a closed-loop supply chain under probabilistic demand
|
O. Keramatlou   , N. Javadian * , H. Didehkhani , M. Amirkhan |
| Department of Industrial Engineering, Mazandaran University of Science and Technology, babol, Iran , Nijavadian@ustmb.ac.ir |
|
|
Abstract: (792 Views) |
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 and 2) expected coverage. 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.
|
|
| Keywords: Closed-loop supply chain, expected coverage distance, Expected coverage time, NSGA-II |
|
|
Full-Text [PDF 788 kb]
(279 Downloads)
|
Type of Study: Original |
Subject:
Supply Chain Management and Logistics
Received: 2023/12/31 | Accepted: 2024/02/6 | Published: 2024/02/6
|
|
|
|
|
|
|
| Send email to the article author |
|
|
|
| Add your comments about this article |
|
|
|
