A local search method for periodic inventory routing problem

摘要

Inventory routing problem considers inventory allocation and routing problems simultaneously, in which the replenishment policies and routing arrangement are determined by the supplier under the vendor managed inventory mode. What we consider here is a periodic inventory routing problem that once the delivery time, quantity and routing are determined, they will remain the same in the following periods. The problem is modeled concisely, and then it is decomposed into two subproblems, inventory problem and vehicle routing problem. The inventory problem is solved by proposing a local search method, which is achieved by four operators on delivery quantity and retailer's demand. Insertion operator aims to insert a new replenishment point of a retailer while removal operator is to remove a replenishment point. Besides, addition operator is adopted as an assistant tool, and crossover operator is proposed for some special cases. We also propose a tabu search method to solve the routing problem. Finally, the computational results show that the method is efficient and stable.