A hybrid heuristic for inventory routing problem. (1st January 2011)

• Record Type: Journal Article
• Authors: Ramkumar, N.; Subramanian, P.; Narendran, T.T.; Ganesh, K.
• Is Part Of: International journal of electronic transport. Volume 1:Number 1(2011)
• Page Start: 45
• Page End: 63
• Publication Date: 2011-01-01
• Subjects: inventory routing problem -- IRP -- integer linear programme -- ILP -- heuristic -- simulated annealing -- SA; Logistics -- Information technology -- Periodicals; Transportation -- Information technology -- Periodicals; Logistics -- Data processing -- Periodicals; Transportation -- Data processing -- Periodicals; 658.500285
• DOI: 10.1504/IJET.2011.043113
• Languages: English
• ISSNs: 1742-6952

Abstract

This paper addresses an inventory routing problem in vendor managed inventory systems with explicit consideration of buffer stock levels at warehouses. The problem involves a manufacturer delivering a product to a set of warehouses with available fleet capacity with the objective of minimising transportation and inventory costs. We have developed an integer linear programme (ILP) and proposed a hybrid heuristic for the problem. In the proposed heuristic, inventory is allocated using an ILP, vehicles are allotted to customers on the basis of proximity and routes for vehicles are determined using simulated annealing. The proposed heuristic is validated with different datasets and found to be performing well.