Research Article

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

Table 5

Set of viable alternatives.

AlternativesCase 1Case 2Case 3Case 4
SpaceDistanceSpaceDistanceSpaceDistanceSpaceDistance

Dedicated0.000.070.000.410.000.000.000.56
Random1.000.001.000.001.000.491.000.36
Class-based
 010.410.570.620.990.480.660.070.05
 020.190.380.380.720.700.980.020.04
 030.190.350.000.410.240.470.020.03
 040.650.570.951.000.891.000.210.06
 050.350.490.390.720.810.740.160.66
 060.350.470.010.400.350.520.160.65
 070.220.290.620.990.240.190.050.57
 080.000.100.380.720.460.510.000.56
 090.350.290.490.670.810.530.180.01
 100.350.260.110.360.350.310.180.00
 110.811.000.620.880.590.530.190.67
 120.460.290.951.000.650.530.190.58
 130.890.920.620.100.590.290.200.03
 140.810.210.960.881.000.900.981.00