搜索资源列表
tsp-ranee
- Hopfiled 实现TSP旅行商问题 CH-Traveling Salesman Problem TSP Hopfield realize CH
tsp
- 用分支定界法求解旅行商问题旅行商问题是一个经典NP问题：有n个城市，一个推销员要从其中的某一个城市出发，每个城市只能遍历一次，要求走遍所有的城市，再回到他出发的城市，求所有可能路径中路径最短的一条路径来。-Using branch and bound method for solving traveling salesman problem traveling salesman problem is a classic NP probl
TSPannealarithmetic
- 本文以著名的旅行商问题(TSP)为例说明如何利用MATLAB语言实现模拟退火算法。-In this paper, the well-known traveling salesman problem (TSP) as an example on how to use MATLAB language to achieve simulated annealing algorithm.
1
- 蚂蚁TSP算法--用蚁群算法解决旅行商问题-TSP algorithm ant ant colony algorithm to solve traveling salesman problem
mtsp_ga
- 由matlab解决多旅行商问题，并且包括矩阵计算等功能-From matlab to solve multi-traveling salesman problem, and includes features such as matrix calculation
tspmatlab
- matlab完美解决旅行商问题。蚁群算法。-traveling salesman problem matlab perfect solution. Ant colony algorithm.
GA
- vs2005开发 遗传算法求解144城市的旅行商问题-VS2005 to develop genetic algorithm 144 city traveling salesman problem
tspapp_src
- 用遗传算法解决旅行商问题，有详细的注释 -Genetic algorithm is used to solve the traveling salesman problem, there are detailed notes
as_tsp
- 蚁群算法 关于城市旅行商问题 ，有兴趣的可以参考下，也课参与交流-Ant colony algorithm on the city traveling salesman problem, interested can refer to, it is also involved in the exchange of lessons
tsp
- 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its descr iption of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path
tsp
- 结合旅行商问题，学习并掌握遗传算法。并从实例中体会遗传算法对解决NP问题的重要性。遗传算法解决旅行商问题-Combination of traveling salesman problem, to learn and master the genetic algorithm. Experience from the examples of genetic algorithm to solve the NP problem. Geneti
SA_TSP_Rev1
- 用matlab实现的利用模拟退火算法(SA)解决旅行商问题(TSP).-Matlab achieved with the use of simulated annealing algorithm (SA) to solve traveling salesman problem (TSP).
DPSO
- 处理旅行商问题的离散PSO算法的例程，动态生成路径串，算法本身保证了路径串的合法性-Traveling salesman problem to deal with discrete PSO algorithm routines, dynamically generated path string, the algorithm itself, guarantee the legitimacy of the path string
TspSA
- 用模拟退火算法求解旅行商问题的代码，采用C++编写-Using Simulated Annealing Algorithm for Solving Traveling Salesman Problem code, using C++ Prepared
TSP_ga
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序-TSP problem (also known as: traveling salesman problem, traveling salesman problem) genetic algorithm matlab common procedures
heredity
- 遗传算法 解旅行商问题 在命令行输入要读入的文件，文件主要描述旅行商问题中每个城市的坐标，本程序群体数是100，仅遗传了1000代，解20个城市时可以较大概率得到最优解，读入的文件格式见压缩包文件-Genetic Algorithm for Traveling Salesman Problem in the command-line input to read the documents, the paper s main desc
TS
- TSP问题,即旅行商问题,matlab环境下可以运行-TSP problem, that is, traveling salesman problem, matlab environment can run
TSP11
- 这是一个很好用的多算法求解旅行商问题的源码。-This is a very good algorithm used in multi-source for Traveling Salesman Problem.
Program
- 用很简单的方法描述了如何勇贪婪算法解决旅行商问题-Using very simple methods Yong describes how greedy algorithm to solve traveling salesman problem
sa_tsp
- 旅行商（TSP）问题一直以来都是一个NP难问题，旅行商问题（TSP问题）就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。本次软件设计是利用模拟退火算法解决TSP问题，通过该软件设计，对模拟退火算法和旅行商问题有个初步的认识。-Traveling Salesman (TSP) problem has always been a NP hard problem,