MATLAB-Code-for-Simulated-Annealing
于 2009-11-20 发布
文件大小:13KB
0 400
下载积分: 1
下载次数: 14
代码说明：
TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. After an initial solution a neighborhood solution is selected by an exchange of a randomly selected pair of nodes. The randomly generated neighbor solution is selected if it improves the solution else it is selected with a probability that depends on the extent to which it deteriorates from the current solution.
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
发表评论
