搜索资源列表
TSP
- TSP双种群蚁群算法。还包括了“30城市TSP问题数据与最优解.mat”，“75城市TSP问题数据.mat”，和“442TSP问题数据与算法对比.mat”-TSP-Stocks ant colony algorithm. Also include "30 cities TSP data and the optimal solution. Mat, " "75 cities TSP data. mat, &q
TSP
- TSP双种群蚁群算法。还包括了“30城市TSP问题数据与最优解.mat”，“75城市TSP问题数据.mat”，和“442TSP问题数据与算法对比.mat”-TSP-Stocks ant colony algorithm. Also include "30 cities TSP data and the optimal solution. Mat, " "75 cities TSP data. mat, &q
GA_TSP_lunwen+yuanma
- 利用遗传算法求解TSP问题。TSP问题描述如下：给定一组n个城市和他们两两之间地直达距离，寻找一条闭合的旅程，使得每个城市刚好经过一次而且总的旅行距离最短。 -The use of genetic algorithm to solve TSP problems. TSP problem described as follows: given a set of n cities and their 22 direct distance
Matlab
- 用matlab解决TSP旅行商问题，30个城市的路线优化问题-Matlab solving TSP traveling salesman problem
tsp
- 旅行商问题，总共30个城市，计算最优路线和最短路径-Traveling Salesman Problem, a total of 30 cities, calculating the optimal route and the shortest path
TSPsolutions75city
- 30城市、44城市、75城市框架下的旅行商寻优问题代码-TSP solutions under30，44， 75 city
Simulated
- 用模拟退火算法求30个城市的旅行商问题的C程序-Simulated Annealing Algorithm with 30 cities of the TSP C program
TSP
- 用matlab解决TSP旅行商问题,针对30个城市最短路径进行优化-Using matlab to solve the traveling salesman problem TSP for 30 cities to optimize the shortest path
TSP-gene
- 是用遗传算法解决TSP问题，测例包括10个城市和30个城市。使用PMX交叉算子。-Is to use genetic algorithms to solve TSP problems, test cases, including 10 cities and 30 cities. Using the PMX crossover.
TSP
- 遗传算法解决TSP问题代码，其为了解决30个城市行走的最佳路径-Code genetic algorithm to solve TSP problems, and its 30 cities to address the best path to walk
aunt
- 蚁群算法实现TSP问题，30城市，不考虑代价问题-Ant colony algorithm for TSP, 30 cities, regardless of cost in the
TspSA
- 模拟退火实现TSP问题，30城市，不考虑代价-Simulated Annealing TSP, 30 cities, does not consider costs
30-city-TSP
- 自己编写的用禁忌搜索编写的30个城市的TSP问题，希望对刚刚学习算法编程的有点帮助-This is what I have written written with Tabu Search 30 cities TSP problem, hoping for just a little help learning algorithm programming, because I am also learning ^ _ ^
TSP
- 30个城市的TSP问题的遗传算法，可以对数据稍加修改来计算类似的问题-30 cities TSP genetic algorithm, the data can be slightly modified to calculate the similar problems
30TSP-Cs
- 使用C#算法解决30个城市的旅行商问题（TSP），程序代码内有详细的说明，适合C#语言的入门学习。-Using C# algorithm to solve the traveling salesman problem in 30 cities (TSP), the program code with detailed instructions for the C# language learning portal.
TSP_30
- 选择30城市TSP问题作为研究对象，解题思路源自于：“由固定点围成的多边形，其面积与其周长成反比（李氏定则）”。-Select TSP 30 city as the research object, problem-solving ideas from: "surrounded by a fixed point of the polygon, the area of its week inversely proportional to
g05
- matlab源码，利用遗传算法求解30个城市的tsp问题-matlab source code, the use of genetic algorithm to solve 30 problems tsp city
tsp-GA
- 遗传算法解决TSP问题，词程序为30个城市的TSP问题，其中交叉和变异函数有点问题，在结果中可能无法遍历30个城市-Genetic algorithm to solve TSP, the word program is 30 cities TSP problem where a problem with the crossover and mutation function, the result may not traverse 30
Tsp
- 用GA算法解决30城市的TSP问题，城市的数量和距离需要手动输入。-30 city TSP problem solving with GA algorithm, the number and distance of the city' s need to manually enter.
yichaun
- 30城市TSP问题，用遗传算法解决，比较典型，有数据源文件。(30, the city TSP problem is solved by genetic algorithm.)