A Two-Stage Simulated Annealing Algorithm for the Many-to-Many Milk-Run Routing Problem with Pipeline Inventory Cost

Table 9

Vehicle routes of Mode 1.

Vehicles	Routes of each vehicle
1	C-29-14-9-28-24-30-H-J-C
2	A-19-18-25-8-I-E-A
3	F-17-23-16-15-26-G-F
4	H-21-6-11-2-B-J-H
5	B-28-9-14-29-13-3-4-H-B
6	H-11-1-23-A-E-I-H
7	I-29-14-15-E-A-I
8	F-28-9-29-14-G-F
9	J-8-25-18-19-7-H-J
10	B-2-1-11-30-9-G-F-B
11	E-28-9-4-I-A-E
12	D-19-5-7-30-4-C-D
13	I-3-13-26-22-A-E-I
14	D-3-9-14-13-C-D
15	D-27-26-22-C-D
16	C-29-12-10-D-C
17	A-6-21-20-I-E-A
18	D-8-24-18-25-28-C-D
19	E-10-12-27-26-I-A-E
20	I-26-27-13-3-4-H-J-I
21	B-11-1-H-B
22	G-22-20-21-6-8-F-G
23	D-15-17-23-16-I-C-D
24	J-26-27-12-10-20-H-B-J
25	C-7-5-2-11-I-A-E-D-C
26	F-19-5-7-8-G-F
27	J-1-6-21-20-C-D-J
28	J-17-23-16-15-22-H-B-J
29	B-7-30-24-8-25-18-19-5-B
30	F-25-18-24-4-3-G-F
31	H-7-5-30-20-22-I-J-H
32	G-12-10-27-13-F-G
33	J-17-23-16-E-A-J
34	A-30-24-I-E-A