Description: 用禁忌搜索解决TSP问题，程序中使用对路径长度禁忌的方法，运行效率比较高。-Tabu search solution TSP, procedures for the use of the taboo path length, operating more efficient. Platform: |
Size: 48128 |
Author:yinhui |
Hits:
Description: 开发环境：Visual C++ .net2003
功能：利用禁忌搜索思想求解TSP问题。-Development Environment: Visual C++. Net2003 functions: thinking of the use of tabu search for solving TSP problems. Platform: |
Size: 27648 |
Author:jimin |
Hits:
Description: 禁忌算法的源程序和一个示例的PPT演示稿
以及几个使用的关于禁忌算法的HTML文稿-Tabu algorithm source code and an example of the PPT presentations, as well as several taboos algorithm used on the HTML document Platform: |
Size: 591872 |
Author:lhf |
Hits:
Description: 利用禁忌搜索算法解决50个城市的tsp问题，简单易懂，适合初学者-The use of tabu search algorithm to solve 50 problems tsp city, easy-to-read, suitable for beginners Platform: |
Size: 3072 |
Author:dayong |
Hits:
Description: TabuSearch的一个小程序。用禁忌搜索解决TSP问题，程序中使用对路径长度禁忌的方法。-TabuSearch a small program. Using tabu search to solve TSP problems, procedures used on the path length taboo method. Platform: |
Size: 28672 |
Author:GaoTiexin |
Hits:
Description: 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 from cycling in a small set of solutions, some attribute of recently visited solutions is stored in a Tabu List, which prevents their occurrence for a limited period. For our problem, the attribute used is a pair of nodes that have been exchanged recently. A Tabu structure stores the number of iterations for which a given pair of nodes is prohibited from exchange. Platform: |
Size: 17408 |
Author:amilcar |
Hits:
Description: 禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期和长期禁忌列表存储器来保证算法能搜索到全和分局空间的每一点, 并且不重复搜索。经过验算析, 证明它是一种较好的全局启发式搜索法.-Tabu search method, the initial solution, neighborhood and tabu list size of the number of parameters such as have more stringent requirements, these parameters directly affect the ability to optimize the algorithm. This paper presents an improved tabu search method, it is used effectively to compress the search space, so that can improve search efficiency and global search capabilities. Short-term and long-term memory tabu list to ensure the algorithm can search the whole and the sub-space, each point, and do not repeat the search. After checking analysis to prove that it is a good global heuristic search method. Platform: |
Size: 475136 |
Author:logspace |
Hits:
Description: 提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局
部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具
体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。
关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu search techniques, using I & D strategies, while designed for the local optimal solution of the two kinds of mutation operator. The improved algorithm can effectively compensate for the standard tabu search algorithm depends on the initial solution defect, but also to avoid the phenomenon of search stagnation. Through specific examples and random-question test, indicating that the improved tabu search algorithm has better performance. Guan Platform: |
Size: 6144 |
Author:logspace |
Hits:
Description: it is a matlab program for ga sa tabu sworm opt heuristics we can also use matlab here. or there can Platform: |
Size: 9216 |
Author:virendra |
Hits:
Search - tabu-search-for-tsp