2. Locations are indexed from l ¼ 1; 2; . . . ; L in the increasing order of distance from I/O point. If there is a
clash, it is resolved by ranking based on Euclidean distance of the locations as proposed by Malmborg and
Bhaskaran (1990).
3. Solutions are formed by partitioning the products into class 1, class 2, . . . , etc. and assigning the required
storage locations to these classes sequentially. The process of formation of classes is explained next using a
tree structure described next.