In this paper, we formally introduce a variant of the inventory routing problem (IRP) that we call the fixed-partition policy IRP (FPP-IRP). In contrast to the classical IRP in which delivery routes are arbitrary, the FPP-IRP partitions customers into mutually exclusive clusters that are fixed throughout the optimization horizon, and distribution is performed separately for each cluster. By restricting the flexibility inherent in the classical IRP, the FPP-IRP attains many potential advantages. First, partitioning reduces the operational complexity of the system and allows a simpler organization of the distribution service. Second, it improves the robustness of the system by isolating disruptions to affected clusters. Third, it can fit the needs and requirements of specific applications in which consistency in the distribution policy, such as familiarity between customers and drivers and route invariance, is required. We present two fixed-partition policies for the IRP together with mathematical formulations and valid inequalities. We also present a worst-case analysis on the performance of these policies. Extensive computational results are presented to show the behavior of these policies and glean insights into their potential benefits.
DIABAT, A., ARCHETTI, C. et NAJY, W. (2021). The Fixed-Partition Policy Inventory Routing Problem. Transportation Science, 55(2), pp. 275-552.