Description: Ant colony algorithm to find the following 10 cities TSP shortest path.
X, Y coordinates of the 10 cities were: (0.1,0.6), (0.2,0.3), (0.4,0.1), (0.5,0.5), (0.7,0.2), (0.8,0.4), (0.2, 0.8), (0.5, 0.9), (0.7,0.6), (0.9, 0.8).
The shortest path required output sequence and its length, and the ant colony algorithm iterations shortest path length evolution curve.
To Search:
File list (Check if you may need any files):
Ant colony algorithm
....................\main2.m
....................\说明.txt
Download