Mutation Ant Colony Algorithm of Milk-Run Vehicle Routing Problem with Fastest Completion Time Based on Dynamic Optimization

Table 1

Locations and demands of settlement.

Settlement	1	2	3	4	5	6	7	8	9	10
Location	(74,29)	(64,26)	(67,80)	(88,15)	(21,65)	(72,42)	(92,80)	(46,38)	(76,86)	(30,46)
Demand	3	7	5	6	2	9	7	4	4	3.5
Settlement	11	12	13	14	15	16	17	18	19	20
Location	(63,48)	(23,11)	(36,72)	(29,54)	(66,16)	(10,10)	(15,50)	(10,10)	(20,70)	(70,12)
Demand	4	3	8	6	5	1.5	5	2.5	3	3.5