Title:
Heuristic-method-for-the-Traveling-Salesman-Probl
Download
Description: Heuristic method for the Traveling Salesman Problem
A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.
function tspplot(p,X,nodenum) #ok
TSPPLOT Plot 2D tour
TSPPLOT(P,X), P is the tour and X is the coordinate matrix
TSPPLOT(P,X,1) also adds node numbers
To Search:
File list (Check if you may need any files):
Heuristic method for the Traveling Salesman Problem.txt
