Abstract:
In this study, it is aimed to present a heuristic solution procedure for the Inventory Routing Problem, which is an important extension of the Vehicle Routing Problem. The Inventory Routing Problem has the same basic structure as the Vehicle Routing Problem. However, it leads to a very complex and large mathematical programming formulation since additional consideration is given to vehicle travel time constraints as well as to inventor fluctuations and stockouts. A computer program is developed incbrder to obtain computational results for the suggested heuristic solution procedure.
