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

Table 3

An example of the suboptimal solution of TSP obtained by minimum cost merging.

Load travels					No-load travels determined by assignment	Subloops
Number	Start point		End point
	Column	Layer	Column	Layer
SP/EP	10	1	—	—	SP ⟶ 6	SC1
1	29	4	40	1	6 ⟶ 2	SC1
2	5	1	21	5	2 ⟶ 5	SC1
3	41	4	45	1	5 ⟶ 7	SC1
4	35	1	49	3	7 ⟶ EP	SC1
5	17	2	25	1	1 ⟶ 4	SC2
6	5	1	22	5	4 ⟶ 9	SC2
7	15	1	18	3	9 ⟶ 1	SC2
8	45	3	50	1	3 ⟶ 8	SC3
9	37	5	45	1	8 ⟶ 3	SC3

Note. The horizontal speed and vertical speed of stacker are 1.4 s/column and 6 S/layer respectively.