Probabilidad de Éxito Aplicada al IRP con Ventanas de Tiempo

Abstract

Inventory Routing Problem (IRP) is an inventory optimization problem that descends of vendor-managed inventory (VMI) which is an integration strategy for a supply chains in which the vendor is responsible for making inventory control decisions of his customers and how to supply them. This problem has been extensively treated in the literature, however, in the multiple models that have been developed exist several factors that have not been contemplated. One of them is the delivery success probability, since in real life not all delivery is successful, there are other factors that may make it impossible to deliver a product in the established time such as traffic, accidents, vehicle failures among others. This will vary the planned route in order to satisfy the demand of the nodes. For this reason want to plan an optimization model which takes into account the probability of delivery associated with the vehicles within the established time windows.