USER REVIEWS
Heuristic method for the Traveling Salesman Problem (TSP)A number of nearest neighbour tours are generated from randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.
WRITE USER REVIEW