Inventory Routing Problems: Mathematical Models and Heuristics

Shippers are emphasizing logistics, since networking has become complex due to the globalization and demand variability has become huge for various products across countries. In order to meet customer demands, vendors must ensure appropriate quantities of storages at the point of demand and must ensure optimal distribution plans that include routing of the distribution vehicles. Managing such complex logistic networks, with high level of customization and services expected by customers, require various strategies to keep the transportation and inventory costs low. This requirement has evolved as the Inventory Routing Problem (IRP) which focuses on timing of deliveries, sizes of shipments and routing of vehicles. With the objective of enabling logistics planners to determine the distribution quantities and routing schedules to warehouses, few prominent variants of the inventory routing problems are addressed. The proposed mathematical models and heuristic approaches can assist planners in logistic decisions at operational level. These approaches will be useful in Oil industries, Retail industries, Blood banks, Automobile Industries and Vendor managed inventory systems.