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

Table 15

Data of the demands and (pipeline inventory cost per unit time per unit of product ) for each supplier and plant.

Plants	Suppliers
	A		B		C		D		E		F		G		H		I		J		K		L
	M	0.75	5	0.66	1	0.63	7	0	5	0.2	3	0.27	9	0.2	2	0.71	3	0.1	3	0.95	1	0.05	8	0.4	1
N	0.23	5	0	1	0	7	0.05	5	0.05	3	0.13	9	0.07	2	0.63	3	0.03	3	0.68	1	0.01	8	0.05	3
O	0.3	5	0.07	1	0.17	7	0.07	5	0	3	0.07	9	0.1	2	0.88	3	0.06	3	0.73	1	0.03	8	0	2
P	0.17	5	0.23	1	0.3	7	0.1	5	0.13	3	0.17	9	0.22	2	0.65	3	0.19	3	0.98	1	0.05	8	0	2
Q	0.66	5	0.1	1	0.33	7	0.08	5	0.06	3	0.11	9	0.13	2	0.76	3	0.09	3	0.94	1	0.01	8	0.1	5

Suppliers: A(38, 45) supplier of bean pulp; B(40, 37) cottonseed meal; C(12, 47) distiller’s grains; D(7, 33) peanut meal; E(24, 18) corn gluten meal; F(34, 37) fermented soybean meal; G(48, 29) rice bran meal; H(28, 20) flour; I(33, 6) wheat; J(18, 13) corn; K(23, 53) whey powder; and L(24, 9) amino acids, calcium hydrogen phosphate, protein powder, and so forth.
Plants: M(25, 25); N(16, 33); O(28, 29); P(11, 22); and Q(17, 29).