搜索资源列表
GA-TSP--MATLAB
- GA TSP MATLAB this source code implement TSP in matlab by Genetic Algorithm... TSP is a classic problem in AI
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
AntColonAlgorithmforTSP
- c++程序 用于求解TSP问题，有说明注释 -Ant Colony Algorithm for TSP C++
tsp
- traveling salesman program
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.
109201286tsp
- 一种求解TSP问题的新算法.pdf -asdfasdfasdfasfd
ACO-for-TSP
- tsp aco algorithm with simulation
tsp-chang
- 5个城市TSP（旅行商问题）的基于遗传算法的C++源代码，希望对于你学习遗传算法会有一定的帮助-Five cities TSP (traveling salesman problem), genetic algorithm-based C++ source code, there will be some hope for you to learn the genetic algorithm help
TSP
- 这是焦李成团队编写的《免疫优化计算、学习与识别》的TSP问题的数据集-Immune optimization calculation, learning and recognition
tsp-vb
- 通过VB语言，实现TSP旅行商问题的求解，采用Ford算法实现-By VB language, to achieve for TSP Traveling Salesman Problem, using Ford algorithm
TS-For-Tsp
- tsp问题的禁忌搜索算法，matlab编程，智能计算-tabu search algorithm tsp problem, matlab programming, intelligent computing
PSO-GA-TSP-PID
- 压缩包包括5个群智能算法的程序，即PSOGA-PID优化，PSO的多目标perota优化问题，基于TSP-PSO算法，遗传算法求解TSP问题，遗传算法求解TSP问题-Compression package includes five swarm intelligence algorithm procedures, namely PSOGA-PID optimization, PSO perota multi-objective optimization problem, TSP-PSO algo
TSP
- 进化算法解决TSP问题的源代码，多个程序，非常详细-Evolutionary algorithm to solve the TSP problem of the source code, a number of procedures, very detailed
tsp
- 这个文件主要涉及tsp问题，即旅行商问题，采用遗传算法。-This paper mainly involves the TSP problem, the traveling salesman problem, using genetic algorithm.
antsystem-TSP
- matlab智能算法 蚁群算法的优化计算，旅行商问题优化（案例背景为巡回我国31个地区）-apply ant colony algorithm to solve TSP
TSP
- 经典的TSP变形问题，通过TSP可以帮助我们更加快速的学习TSP问题-Classical TSP deformation, can help us learn more quickly TSP problem
chapter4
- TSP是典型的NP完全问题，既其最坏情况下的时间复杂度随着问题规模的增大按指数方式增长，到目前为止还未找到一个多项式时间的有效算法。(TSP is a typical NP complete problem, and its worst-case time complexity increases exponentially as the problem size increases. So far, no polynomial time efficient algorithm has been
禁忌算法求解tsp
- 利用禁忌搜索算法求解经典TSP问题。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Tabu search algorithm for solving classical TSP problems)
TSP双蚁群算法
- 蚁群算法是一种用来寻找优化路径的概率型算法。它由Marco Dorigo于1992年在他的博士论文中提出，其灵感来源于蚂蚁在寻找食物过程中发现路径的行为(The ant colony algorithm is a probabilistic algorithm used to find the optimal path. It was proposed by Marco Dorigo in his doctoral dissertation in 1992, inspired by the wa