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

Table 11

Vehicle routes of Mode 2.

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