The inventory routing problem involves trading off inventory holding#R##N#costs at client locations with vehicle routing costs to deliver#R##N#frequently from a single central depot to meet deterministic client demands over a finite planing horizon. In this paper, we consider periodic solutions that visit clients in one of several specified frequencies, and focus on the case when the frequencies of visiting nodes are nested.  We give the first constant-factor approximation algorithms for designing optimum nested periodic schedules for the problem with no limit on vehicle capacities by simple reductions to prize-collecting network  design problems. For instance, we present a 2.55-approximation algorithm for the minimum-cost nested periodic#R##N#schedule where the vehicle routes are modeled as minimum Steiner trees. We also show a general reduction from the capacitated#R##N#problem where all vehicles have the same capacity to the uncapacitated#R##N#version with a slight loss in performance. This reduction gives a#R##N#4.55-approximation for the capacitated problem. In addition, we prove several structural results relating the values of optimal policies of various types.
['Takuro Fukunaga', 'Afshin Nikzad', 'R. Ravi']
Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem