搜索资源列表
tabu9
- tabu search, for optimization use
routing
- CN禁忌搜索法是用于路径搜索的方法可以对应编写各种语言来实现-CN tabu search method is used for path search method can be prepared corresponding to various languages to achieve
QueensProblem
- source code for Queens problem using tabu search
metslib-0.4.2.tar
- framwork for tabu search
tabu-matlabcode-tsp
- matlab编写的禁忌搜索算法，解决了TSP问题，对初学者有重要的参考价值-tb algorithm for tsp problem
vrpsd.aco.be.3
- vrpsd -tabu搜索求解-vrpsd tabusearch
TSM
- This program gives solution to the Travelling Salesman problem (TSP). I use genetic algorithm, tabu search, exhaustive search. It all combine in a windows application.
gafuzzymatlab
- 模拟退火，禁忌搜索，遗传算法，神经网络-MATLAB程序合集 -Simulated annealing, tabu search, genetic algorithm, neural network-MATLAB collection procedures simulated annealing, tabu search, genetic algorithm, neural network-MATLAB collection proce
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.
TabuSearch
- ebook for tabu search
TopicsinLocalSearch
- tabu search for solving tsp
mochilaBusquedaTabu
- Solucion problema de la mochila con busqueda tabu.
Tabusearch
- This function implements the tabu search algorithm for solving some problem
TabuSearchforTSP
- This gives source code of traveling salesman problem. The algorithm used is tabu search.
fbsc
- 禁忌搜索算法C/C++源代码,比较经典的算法。初学者可以看看 -Tabu search algorithm C/C++ source code, compare the classic algorithms. Beginners can look at the
wqwq
- tabu search algorithm
TSPusingTabuSearch(matlabcode)
- TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. Tabu Search is a heuristic that prevent the process fro
tabu_matlab
- 采用禁忌搜索算法和模拟退火法来求解旅行商问题，PDF文件，说明很详细-Using tabu search algorithm and simulated annealing method to solve the traveling salesman problem, PDF document describing in great detail
TSP
- 提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algo