SimulatedAnnealing

代码说明：

  提供一种求解最优哈密尔顿的算法---三边交换调整法，要求在运行jiaohuan3（三交换法）之前，给定邻接矩阵C和节点个数N，结果路径存放于R中。(Hamilton provides an algorithm for solving optimal--- trilateral exchange adjustment method requires running jiaohuan3 (c exchange) before the given node number of the adjacency matrix C and N, the result stored in R in the path.)

文件列表：

哈密尔顿回路
............\TSP模拟退火
............\...........\accept.m,71,2003-09-05
............\...........\annealing.m,687,2003-09-05
............\...........\calculate.m,204,2003-09-05
............\...........\cost.mat,22672,2003-09-05
............\...........\cost_sum.m,100,2003-08-02
............\...........\exchange2.m,366,2003-09-05
............\...........\exchange3.m,1314,2003-09-05
............\...........\说明.txt,97,2003-09-05
............\三边交换简单算法
............\................\bianquan.m,550,2003-08-17
............\................\cost_sum.m,100,2003-08-02
............\................\jiaohuan3.m,1293,2003-09-05
............\................\哈密尔顿回路.rar,1327,2003-08-17
............\................\说明.txt,424,2003-08-17