搜索资源列表
a
- 禁忌搜索算法,解决三十个城市间的旅行商问题,求出最短距离-Tabu search algorithm to solve thirty cities between the traveling salesman problem, find the shortest distance
Codes(multiple-Bin-Packing)
- 利用C语言,解决多为背包问题的禁忌搜索算法!世界名家所写!-Tabu search code for multimentional bin packing problem
tabu-search-for-tsp
- 利用禁忌搜索算法解决50个城市的tsp问题,简单易懂,适合初学者-The use of tabu search algorithm to solve 50 problems tsp city, easy-to-read, suitable for beginners
SimpleOpenTSTutorial
- TabuSearch的一个小程序。用禁忌搜索解决TSP问题,程序中使用对路径长度禁忌的方法。-TabuSearch a small program. Using tabu search to solve TSP problems, procedures used on the path length taboo method.
tabu-matlabcode-tsp
- tabu禁忌求TSP 禁忌搜索是对局部领域搜索的一种扩展,是一种全局逐步寻优算法。搜索过程可以接受劣解,有较强的爬山能力。-solve TSP problem
tabu-matlabcode-tsp
- matlab编写的禁忌搜索算法,解决了TSP问题,对初学者有重要的参考价值-tb algorithm for tsp problem
ModernAlgorithmCosole
- 多进程实现现代优化算法包括采用SSS的局部搜索、禁忌搜索算法和模拟退火算法的控制台-a console platform for modern optimization algorithm such as sss based local search taboo search and simulated annealing algorithm and so on
tabusearch
- metlab求解的禁忌搜索算法,求解的实例在有效的时间范围内可得。-Solving metlab taboo search algorithm for solving the example in the effective time frame available.
gafuzzymatlab
- 模拟退火,禁忌搜索,遗传算法,神经网络-MATLAB程序合集 -Simulated annealing, tabu search, genetic algorithm, neural network-MATLAB collection procedures simulated annealing, tabu search, genetic algorithm, neural network-MATLAB collection procedures
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.
fbsc
- 禁忌搜索算法C/C++源代码,比较经典的算法。初学者可以看看 -Tabu search algorithm C/C++ source code, compare the classic algorithms. Beginners can look at the
sA-TS-for-TSP
- 模拟退火算法及禁忌搜索算法解tsp的比较,文章及matalb源码-Simulated annealing algorithm and tabu search algorithm for solving tsp comparison, articles and matalb source
tabu_matlab
- 采用禁忌搜索算法和模拟退火法来求解旅行商问题,PDF文件,说明很详细-Using tabu search algorithm and simulated annealing method to solve the traveling salesman problem, PDF document describing in great detail
The_Intelligent_Optimization_Methods
- 有关智能优化方法(模拟退火,遗传算法,禁忌搜索,等等)-The intelligent optimization methods (simulated annealing,genetic algorithm,tabu search,etc)
TS_TSP
- 禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能 力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期 和长期禁忌列表存储器来保证算法能搜索到全局空间的每一点, 并且不重复搜索。经过验算和分析, 证明它是一种较好的 全局启发式搜索法-Tabu search method, the initial solution, neighborhood and tabu list siz
TSP
- 提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu
tspmatlab
- 提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu
sfsf
- 提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu
method1
- 讲述现代优化算法中的禁忌搜索算法,及其应用,时运筹与优化课程的提高。-About the modern optimization algorithms in the tabu search algorithm, its application, when the improvement of logistics and optimization programs.
jinjisousuobeibao
- 禁忌搜索求解01背包问题,VC++6.0编译通过,有运行结果显示-01 Tabu Search for solving knapsack problems, VC++6.0 to compile, run the results are