Description: TSP (Travelling Salesman Problem, abbreviated TSP, also known as the traveling salesman problem): with n cities and the distance matrix D = [dij], where dij that city i to city j the distance, i, j = 1, 2 ... n, then the problem is to find out I visited each city exactly once and make a loop for the shortest path length
To Search:
- [SA_TSP] - TSP (Travelling Salesman Problem, Jane H
File list (Check if you may need any files):
ant.cpp
Download