Using the Group Technology and a Heuristic Algorithm for Storage Location Assignment Problem

Different policies in the arrangement and storage of items in stock there. This paper deal with correlated storage location problem by considering whole of the impact factors on products storing process. A warehouse with large, heavy and varied products was studied. The primary objective of this research is effective space utilization and information’s about the relationships between products; orders and warehouse are included of clustering factors. The research has two major steps, including the clustering of items and the assignment of products in storage locations.A non-hierarchical k-mean clustering approach used for solve the clustering problem and a heuristic algorithm is used for solving the location assignment problem. In the first step Ten clusters were extracted and named then the warehouse space was divided into some storage locations and Heuristic algorithm assigned groups to storage locations. The results shown close to 30 percent improved in the occupied area in the studied warehouse.