This paper aims to describe the storage constrained, inbound inventory routeing problem and presents bounds and heuristics for solutions to this problem. It also seeks to analyze various characteristics of this problem by comparing the solutions generated by the two proposed heuristics with each other and with the lower bound solutions.
The purpose of this paper is to develop efficient heuristics for determining the route design and inventory management of inbound parts which are delivered for manufacturing, assembly, or distribution operations and for which there is limited storage space. The shipment frequencies and quantities are coordinated with the available storage space and the vehicle capacities.