这是一个关于商人visit许多城市，怎样走法才能使距离最短的例子，采样的了退火算法的经典案例-Traveling Salesman Problem (TSP) has been an interesting problem for a l

me in classical optimization techniques which are based on linear and nonlin

ogramming. TSP can be described as follows: Given a numberof cities to v

d their distances from all other cities know, an optimal travel route has to

und so that each city is visited one and only once with the least possible dista

aveled. This is a simple problem with handful of cities but becomes complica

the number increases.