A partition approach to the inventory/routing problem

In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment of a single item to the retailers with demands occurring at a specific constant (but retailer-dependent) rate, combining deliveries into efficient routes. This research proposes a fixed partition policy for this type of problem, in which the replenishment interval of each of the retailers’ partition region as well as the warehouse is accorded the power of two (POT) principle. A lower bound of the long-run average cost of any feasible strategy for the considered distribution system is drawn. And a tabu search algorithm is designed to find the retailers’ optimal partition regions under the fixed partition policy proposed. Computational results reveal the effectiveness of the policy as well as of the algorithm. Ó 2006 Elsevier B.V. All rights reserved.

• Type: Journal
• Year: 2007
• Where: EOR
• Authors: Qiu-Hong Zhao, Shouyang Wang, Kin Keung Lai
• Keywords: EOR 2007, Long-run Average Cost, Partition Regions, fixed Partition Policy