Highlights Model an inventory routing problem under replenishment lead time and inventory inaccuracy. Propose the methods of updating the probability of the current inventory level and predicting those in future periods. Develop a Robust TQL Algorithm to optimize the replenishment time, replenishment quantity and replenishment stage length.
Abstract In this paper, we study an inventory routing problem under replenishment lead-time and inventory inaccuracy, which exist extensively in distribution systems for fresh products, but are often ignored in existing research. To solve the problem, a robust inventory routing policy is developed in three steps. At first, we propose the methods of updating the probability of the current net inventory and predicting those in future periods. For each candidate route, we develop a Robust TQL Algorithm to optimize the replenishment time, replenishment quantity and replenishment stage length. Finally, a genetic algorithm-based method is developed to optimize the delivery route.
A robust inventory routing policy under inventory inaccuracy and replenishment lead-time
2016-05-02
16 pages
Article (Journal)
Electronic Resource
English
A robust inventory routing policy under inventory inaccuracy and replenishment lead-time
Online Contents | 2016
|Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy
British Library Online Contents | 2009
|Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy
Online Contents | 2009
|Robust Inventory Routing Under Demand Uncertainty
British Library Online Contents | 2012
|Robust Inventory Routing Under Demand Uncertainty
Online Contents | 2012
|