Description: Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.Here,we use the procedure of ant colony algorithm
to work out the TSP.
To Search:
File list (Check if you may need any files):
蚁群算法求解TSP问题.pdf
ACA_TSP.m
Download