Research Article

Large-Scale Storage/Retrieval Requests Sorting Algorithm for Multi-I/O Depots Automated Storage/Retrieval Systems

Table 4

Comparisons of unload times between EA and proposed method for small-scale problem.

N_rEnumerationAssignmentDiff1
T_NLaCPUT_NLbCPUN_SLEMTMinMT

7177.80.016177.80.0062010
7188.20.004188.20.0030000
7181.80.015181.80.0033110
7244.80.016244.80.0042100
7208.20.015208.20.0040000
7193.20.016193.20.0043020
7168.60.016168.60.0033110
7249.60.015249.60.0032010
7167.40.016167.40.0043020
7203.00.015203.00.0022100
8213.00.043213.00.0042010
8219.80.045219.80.0040000
8301.40.054301.40.0042100
8210.40.035210.40.0074120
8238.40.047238.40.0023110
8220.80.062220.80.0160000
8246.40.046246.40.0163200
8275.80.047275.80.0020000
9243.20.330243.20.0083110
9230.60.323230.60.0044210
9255.60.323255.60.0022010
9285.80.329285.80.0040000
9212.00.312212.00.0063200
9253.40.329253.40.0033110
9240.40.342240.40.0020000
9201.80.338201.80.0032100
9266.00.316266.00.0030000
9247.80.311247.80.0053200
9239.80.326241.20.0043111.4
10229.83.385229.80.0163200
10292.83.229292.80.0030000
10232.43.245232.40.0163110
10349.03.198349.00.0022100
10271.03.213271.00.0023110
10332.43.229332.40.0022100
10291.63.230291.60.0153200
10272.63.229272.60.0022100
10280.83.182280.80.0150000
10241.83.244241.80.0123020
10251.63.354251.60.0153110
11317.449.134317.40.0164210
11243.451.510243.40.0163110
11286.245.344286.20.0152100
11267.841.389267.80.0163110
11283.248.496283.20.0153110
11267.842.226267.80.0163110
11283.249.931283.20.0153110
11294.840.909294.80.0152100
11300.444.486302.00.0153111.6

Note. Five-layer double row shelf with 15 I/O depots, N_r: number of S/R requests; T_NL: no-load travel time of stacker (sec); CPU: computation time (sec); N_SL: the number of subloops; EMT: the equivalent merging times of subloops; MinMT: the minimum cost merging times of subloops; Diff1 = T_NLa − T_NLb.