搜索资源列表
包括蚁群，模拟退火，遗传，神经网络，禁忌搜索等智能优化算法对TSP问题的解决
- 包括蚁群，模拟退火，遗传，神经网络，禁忌搜索等智能优化算法对TSP问题的解决，matlab程序。
禁忌搜索解决TSP的Matlab程序
- 禁忌搜索程序
tuba.rar 禁忌搜索算法的例子程序求解Tsp问题
- 禁忌搜索算法的例子程序求解Tsp问题, The taboo search algorithm example procedure solves the Tsp question
TS-TSP.rar
- 使用禁忌搜索算法求解TSP（旅行商问题）的JAVA源程序,The use of tabu search algorithm for solving TSP (Traveling Salesman Problem) the JAVA source code
666tabu
- 禁忌搜索的matlab程序，包括求解TSP问题，介绍和ppt-Matlab tabu search procedures, including the TSP problem solving, presentation and ppt
tabu-search-for-tsp
- 利用禁忌搜索算法解决50个城市的tsp问题，简单易懂，适合初学者-The use of tabu search algorithm to solve 50 problems tsp city, easy-to-read, suitable for beginners
tabu-matlabcode-tsp
- tabu禁忌求TSP 禁忌搜索是对局部领域搜索的一种扩展，是一种全局逐步寻优算法。搜索过程可以接受劣解，有较强的爬山能力。-solve TSP problem
tabu-matlabcode-tsp
- matlab编写的禁忌搜索算法，解决了TSP问题，对初学者有重要的参考价值-tb algorithm for tsp problem
tabu_search-Solve-the-TSP-problem
- 基于禁忌搜索算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Tabu search algorithm based on the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
sA-TS-for-TSP
- 模拟退火算法及禁忌搜索算法解tsp的比较，文章及matalb源码-Simulated annealing algorithm and tabu search algorithm for solving tsp comparison, articles and matalb source
TSP
- 提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu
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问题及其掌握禁忌搜索算法的应用(For beginners to learn TSP problems and master limited searching algorithm applications)
Tabu Search
- 通过禁忌搜索算法求解TSP问题最优解问题(The tabu search algorithm is used to solve the optimal solution of the TSP problem)
TS-TSP
- 本禁忌搜索算法主要用于求解经典的TSP问题(Tabu search algorithm is used to solve the classical TSP problem)
禁忌算法求解tsp
- 利用禁忌搜索算法求解经典TSP问题。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Tabu search algorithm for solving classical TSP problems)
tabu_search
- 基禁忌搜索于31城市TSP问题,Base tabu search in the 31 city TSP problem(Base tabu search in the 31 city TSP problem)
禁忌搜索
- matlab实现的利用禁忌搜索解决tsp问题，代码可以运行(Matlab implements the use of tabu search to solve the TSP problem, the code can run)
禁忌搜索解决TSP加注释
- matlab程序编写 应用禁忌搜索解决TSP（商旅）问题(Using Tabu Search to Solve TSP (Business Travel) Problem in Matlab Programming)
禁忌搜索算法
- 禁忌搜索算法解决tsp问题，matlab程序(tabu search algorithm to solve tsp problem, matlab program)