Research Article
Using the Efficient Frontier to Obtain the Best Solution for the Storage Location Assignment Problem
Table 2
Product location in the dedicated storage system using COI.
| Class | | Space (m2) | Max* | Demand () (units) | COI | Place | Required rows () ( = Max/) | Average distance () (m) | Total distance () | 1 | 2 | 3 | 4 |
| 1 | | 35 | 30 | 30 | 30 | 35 | 5 | 7.00 | 4 | 7 | 13.5 | 67.5 | 2 | | 25 | 30 | 30 | 25 | 30 | 35 | 0.85 | 2 | 6 | 5.0 | 175.0 | 3 | | 10 | 5 | 10 | 5 | 10 | 10 | 1.00 | 3 | 2 | 9.0 | 90.0 | 4 | | 5 | 5 | 5 | 10 | 10 | 25 | 0.40 | 1 | 2 | 1.0 | 25.0 |
| | | Total space | 85 | | | | 17 | | 357.5 |
|
|
Max = maximum space required. Adapted from Muppani and Adil [27].
|