文件名称:HM-TSP
介绍说明--下载内容均来自于网络,请自行研究使用
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-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
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-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
(系统自动生成,下载前可以参看下载内容)
下载文件列表
HM-TSP.txt