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

Table 4

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

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