Description: 解决TSP问题的TS算法MATLAB实现，其中加入了变异算法，当然也可以去掉这个步骤，调用TS_TSP(N, inStart, IsBianYi)，N是城市数目，inStart是起始城市的序号，IsBianYi就是选择变异否，如果为0则不要变异，否则就是结合变异算子的TS算法。
至于下面的参数可以自己调：
T：总的循环次数；
tabulength：禁忌长度；
Pby：变异概率；
-Solve the TSP problem MATLAB realize TS algorithm, which joined the variance algorithm, of course, this step can also be removed, call TS_TSP (N, inStart, IsBianYi), N is the number of cities, inStart is the serial number of the starting cities, IsBianYi is to choose variation has, if not for the variation of 0, otherwise, it is combined with mutation of the TS algorithm. As for the following parameters can be their own tune: T: total number of the cycle tabulength: taboo length Pby: mutation probability Platform: |
Size: 5120 |
Author:rty |
Hits:
Description: TSP问题,即旅行商问题,matlab环境下可以运行-TSP problem, that is, traveling salesman problem, matlab environment can run Platform: |
Size: 59392 |
Author:刘琴 |
Hits:
Description: 采用禁忌搜索算法解决中国城市tsp问题，语言环境为matlab(Using tabu search algorithm to solve the problem of Chinese city tsp) Platform: |
Size: 39936 |
Author:yunhao123321
|
Hits:
Description: 用TS算法解决推销商最短路径问题，数据是中国的各个省会和直辖市(Salesman to solve the shortest path problem with TS algorithm, the data is Chinese all provincial capitals and municipalities directly under the central government) Platform: |
Size: 3072 |
Author:漆膜
|
Hits:
Search - tsp problem ts algorithm