Envanter rotalama optimizasyonunda entegre bir makine öğrenmesi çözüm yaklaşımı

Inventory Routing Problem (IRP) arises from vendor-managed inventory business set- tings where the supplier is responsible for replenishing the inventories of its customers over a planning horizon. In the IRP, the supplier makes the routing and inventory decisions together to improve the overall performance of the system. In our setting, the supplier's goal is to minimize total transportation costs over a planning horizon while avoiding stock-outs at the customer locations. We assume that the supplier has a fleet of homogeneous capacitated delivery vehicles and abundant availability of the product to be delivered to the customers. Each customer has a constant de- mand/consumption rate and limited storage capacity to keep inventory. To address this problem, we propose a novel integrated clustering and routing algorithm. In the clustering phase, we partition the customer set into clusters, ensuring that each cluster is served by a single vehicle. To accomplish this, we employ a novel deep learning model within the clustering framework. In the routing phase, we develop the delivery schedule for each cluster. What sets our approach apart is its consider- ation of the three key decisions—when to deliver, how much to deliver, and how to route—by integrating both a mathematical model and a machine learning model in the decision-making process. We evaluate the performance of the proposed clustering and routing algorithms against existing literature, and our results demonstrate sig- nificant improvements. Furthermore, the proposed neural network-based clustering approach serves as an effective representation of how machine learning algorithms can enhance decision-making structures. Keywords: inventory routing problem; integer programming-based heuristic; neural network; machine learning based decision-making