Benders Decomposition for Inventory Routing Problem Under Milk-Run

The inventory routing problem emerges as a result of the integration of supply chain, aiming to collectively optimize inventory management and routing strategies. In this paper, the inventory routing problem of applying milk-run is proposed. This study adopts a multi period approach to handle multi frequency problems, which compensates for the gap of the traditional milk-run model. In addition, to solve the problem efficiently, this paper applies the exact algorithm Benders decomposition algorithm and accelerates it on the basis of traditional algorithms. Furthermore, data experiments are conducted using randomly generated data and the results of numerical experiments demonstrate the feasibility and superiority of the algorithm.