一.问题分析
1.问题描述:一个联通无向图中,求最短路径回路.也就是求出一个最佳序列,并且终点和起点有直接路径.
2.问题分析:
① 约束条件:因为存在着两个结点不直接相连的情况,有些序列一开始就不可能出现.约束函数存在
记录连接情况的二维数组 T[ t – 1 ][ i ] != // t-1表示上一个结点; i表示全部剩余节点
②限界函数:现有距离+上一站到某个分支的距离优于现有最优值. 当最优解是最小值时,它的初值应该设为
当前距离 cn + 新增距离T[ x[t-1] ][ x[i] ] < 一次递归最优解 bestn //
2022-05-23 17:31:30
57KB
1
.tsp文件读入，模拟退火算法函数接口，测试文件，运行结果全在里面了
Tabu Search (TS) is a local search-based metaheuristic, which is proposed by Fred W. Glover, in 1986. Tabu Search is completely based on the definition of neighborhood and actions converting a solution to its neighboring solutions. This algorithm starts with a single solution, and searches for better solutions, applying actions and moving between neighbor solutions. However, acceptance, applicability and availability of actions, are managed using a set of rules. One of most important rules used in Tabu Search, is that: when action is performed, it will be not available, until a certain amount of other actions performed.
2022-05-18 01:35:39
43KB
1