TY - JOUR
T1 - A Multi Echelon Location-Routing-Inventory Model for a Supply Chain Network: NSGA II and Multi-Objective Whale Optimization Algorithm
AU - Reza Pourhassan, Mohammed
AU - Reza Khadem Roshandeh, Mohammed
AU - Ghasemi, Peiman
AU - Sadat Seyed Bathaee, Mehrnaz
N1 - Publisher Copyright:
© 2025 Kharazmi University. All rights reserved.
PY - 2025/2
Y1 - 2025/2
N2 - In this study, we aim to explore the modeling and solution approach for a multi-objective location-routing-inventory problem. The focus is on planned transportation with the goal of minimizing total costs and reducing the maximum working hours of drivers. To achieve these objectives, we need to consider the routing of vehicles between customers and distribution centers, as well as the optimal allocation of product transfer flow between the production center and customers. Therefore, the proposed model incorporates location, routing-inventory, and allocation simultaneously. To solve the two-objective model, we employed the Epsilon-constraint method for small-sized problems. For large-sized problems, we utilized the NSGA-II and MOWOA meta-heuristic algorithms with a new chromosome. The computational results indicate that in order to reduce the maximum working hours of drivers, it is necessary to increase the number of vehicles and minimize travel distances. However, this leads to higher costs due to vehicle utilization and the need for constructing distribution centers closer to customers, which in turn increases construction costs. Finally, based on the analysis, the NSGA-II algorithm outperformed the MOWOA algorithm with a weighted value of 0.983 compared to 0.016, making it the selected algorithm.
AB - In this study, we aim to explore the modeling and solution approach for a multi-objective location-routing-inventory problem. The focus is on planned transportation with the goal of minimizing total costs and reducing the maximum working hours of drivers. To achieve these objectives, we need to consider the routing of vehicles between customers and distribution centers, as well as the optimal allocation of product transfer flow between the production center and customers. Therefore, the proposed model incorporates location, routing-inventory, and allocation simultaneously. To solve the two-objective model, we employed the Epsilon-constraint method for small-sized problems. For large-sized problems, we utilized the NSGA-II and MOWOA meta-heuristic algorithms with a new chromosome. The computational results indicate that in order to reduce the maximum working hours of drivers, it is necessary to increase the number of vehicles and minimize travel distances. However, this leads to higher costs due to vehicle utilization and the need for constructing distribution centers closer to customers, which in turn increases construction costs. Finally, based on the analysis, the NSGA-II algorithm outperformed the MOWOA algorithm with a weighted value of 0.983 compared to 0.016, making it the selected algorithm.
KW - Allocation
KW - Facility location
KW - Inventory
KW - Meta-heuristic Algorithm
KW - Vehicle Routing
UR - https://www.scopus.com/pages/publications/85216463822
U2 - 10.22034/IJSOM.2023.109996.2804
DO - 10.22034/IJSOM.2023.109996.2804
M3 - Article
SN - 2383-2525
VL - 12
SP - 81
EP - 104
JO - International Journal of Supply and Operations Management
JF - International Journal of Supply and Operations Management
IS - 1
ER -