Using the Efficient Frontier to Obtain the Best Solution for the Storage Location Assignment Problem

Table 3

Space reduction by class-based formation.

Class		Space				Max	Demand	COI	Place	Required rows ()	Average distance	Total distance
		1	2	3	4
Without space reduction
1		35	30	30	30	35	5	7.00	3	7	13.5	67.5
2	+	25	30	30	25	40	60	0.67	1	8	4.0	240.0
		5	5	5	10
3		10	5	10	5	10	10	1.00	2	2	9.0	90.0
						85						397.5
With space reduction
1		35	30	30	30	35	5	7.00	3	7	12.5	62.5
2	+	30	35	35	35	35	60	0.58	1	7	3.5	210.0
3		10	5	10	5	10	10	1.00	2	2	8	80.0
						80						352.5

Adapted from Muppani and Adil [27].