搜索资源列表
tsp-mpi
- 关于tsp问题的基于windows环境下的mpi实现源代码。-tsp of the windows environment based on the realization of the source code mpi.
遗传算法用于tsp问题的研究
- 此文件是用VC编写的关于编译原理遗传算法用于tsp问题的研究-this document is prepared by the VC on the principle of genetic algorithms compiled for the study tsp
GA-TSP--MATLAB
- GA TSP MATLAB this source code implement TSP in matlab by Genetic Algorithm... TSP is a classic problem in AI
hopfiledTsp
- 模拟Hopfield网络求解TSP问题 旅行商问题-Analog Hopfield network to solve TSP problems traveling salesman problem
SCCA
- tsp 问题的解决 希望对大家有帮助 -tsp problem we want to help
tsp
- tsp源程序 解决实际的旅行商问题 简单但是十分有用-tsp source code of the traveling salesman problem to solve real easy but very useful
TSP
- 八个点的tsp问题，matlab的源代码的m文件，要把txt文档放到指定文件夹中才能运行，能运行出路线结构-Tsp eight points of the problem, matlab source code of the m documents to txt files on the specified folder in order to run, to run a route structure
tsp
- tsp算法，遗传算法解决tsp问题，用到MATLAB编程-tsp algorithm, genetic algorithm to solve the tsp problem, use MATLAB Programming
TSP
- 是用归并排序 开发环境是C++ 算法代码经acm测试通过 -无
tabu-matlabcode-tsp
- 禁忌搜索解决TSP的Matlab程序.一个很简单的禁忌搜索程序，效果一般，以后还要努力改善。-Tabu search to solve TSP, Matlab program. A very simple tabu search procedure, the effect in general, we still have to improve.
psotsp
- 用粒子群算法解决tsp问题,其粒子群算法为离散粒子群算法。-Using particle swarm algorithm to solve the problem tsp its discrete particle swarm PSO.
TSP
- 这是用Delphi编写的程序，目的是用TSP（分支限界法）实现旅行商问题-This is a program written with Delphi, the purpose is to use TSP (branch and bound method) to achieve the traveling salesman problem
tspapp_src
- TSP algorithm for C and openmp
TSP
- TSP分支限界法求最短路径，可读取代价矩阵的txt。-Use TSP branch and bound Method to find the shortest path. Cost matrix can be read from txt.
ant-tsp-ndd
- 该算法能够蚁群算法在TSP问题上的实现，能取得比较好的效果，但并非本人编写。-This programming can solving TSP problem,the effect is good ,but it is not created by me.
mat.a-TSP-
- 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？ -Known n city between the distance, the existing of a salesman to be visited this n city, and each city can only be visited once, finally to return to the starti
TSP
- 基于蒙特卡洛的TSP问题算法，方便学习使用。主要是近似算法-Based on the TSP Monte Carlo algorithm
TSP
- 经典旅行商问题的并行解法。精确旅行商问题是NP问题，这里使用并行的办法获得一个精确解，大概在15个节点用8台1.7Ghz节点运行耗时30min-basic tsp algorithm code. using mpich2.
ACO-for-TSP
- tsp aco algorithm with simulation
禁忌算法求解tsp
- 利用禁忌搜索算法求解经典TSP问题。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Tabu search algorithm for solving classical TSP problems)