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

Table 3

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

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