文件名称:TSP(TravelingSalesmanProblem)
介绍说明－－下载内容均来自于网络，请自行研究使用
Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases.
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
新建文件夹
..........\distance.m
..........\plotcities.m
..........\simulatedannealing.m
..........\Simulated_Annealing_Support_Document.pdf
..........\swapcities.m
..........\distance.m
..........\plotcities.m
..........\simulatedannealing.m
..........\Simulated_Annealing_Support_Document.pdf
..........\swapcities.m