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

Table 17

Data of the demands for each supplier and plant.

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

The capacity of each truck is 100. is equal to 0.02. The speed of each vehicle is equal to 40.