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

Table 2

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

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