In this paper, we introduce an inventory routing problem with network disruptions. In this problem, not only decisions on inventory levels and vehicle routing are made simultaneously, but also, we consider disruptions over the networks in which a number of arcs are vulnerable to these disruptions, leading to an increase in travel times. We develop a dynamic programming approach to deal with this situation, and we also evaluate some policies adapting well-known instances from the literature.
