Optimal Scheduling for Retrieval Jobs in Double-Deep AS/RS by Evolutionary Algorithms

Table 1

The addresses of the stored cargo for simulation in Case  1.

Type and number of cargo	Address			Order
	R	C	D	GA	IGA	PSO
A1	9	8	1	2	10	2
A2	8	20	1	8	6	8
A3	20	13	1	5	5	7
A4	19	10	2	7	2	4
A5	2	12	2	10	7	10
A6	19	12	2	4	4	6
A7	6	4	1	1	1	1
A8	21	9	1	6	3	5
A9	9	9	1	3	9	3
A10	7	11	2	9	8	9
B1	29	4	2	16	18	15
B2	17	14	1	14	15	14
B3	23	7	2	17	17	16
B4	21	3	2	15	20	18
B5	6	7	2	12	12	20
B6	13	9	2	19	14	12
B7	11	7	1	20	13	19
B8	13	17	2	13	16	13
B9	23	5	2	18	19	17
B10	4	8	1	11	11	11
C1	17	7	2	23	28	23
C2	1	11	1	29	22	30
C3	27	4	1	22	29	22
C4	16	16	2	24	27	24
C5	1	18	1	27	24	28
C6	20	2	1	21	30	21
C7	7	14	1	28	23	27
C8	1	10	1	30	21	29
C9	11	20	1	25	26	25
C10	6	20	1	26	25	26
D1	29	14	1	35	36	36
D2	4	3	1	40	31	31
D3	15	8	2	33	40	40
D4	3	20	2	38	32	32
D5	17	9	2	31	39	39
D6	28	18	2	34	35	37
D7	14	20	2	37	34	34
D8	17	11	1	32	38	38
D9	23	15	1	36	37	35
D10	8	19	1	39	33	33