Search - Knapsack Problem tabu search

Search - Knapsack Problem tabu search - List

[Other] TSP DL : 0: 　提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用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
Date : 2025-07-01 Size : 6kb User : logspace
[Crack Hack] tspmatlab DL : 0: 　提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用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
Date : 2025-07-01 Size : 38kb User : logspace
[Windows Develop] sfsf DL : 0: 　提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用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
Date : 2025-07-01 Size : 244kb User : logspace
[Data structs] ts-solve-0-1-knapsack-a-info DL : 0: 用禁忌搜索解决0-1背包问题，及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data
Date : 2025-07-01 Size : 5.17mb User : cmn
[matlab] 0-1beibaowenti DL : 0: 应用禁忌搜索算法解决0-1背包问题，可以快速得到最优结果，用matlab实现-Application of tabu search algorithm to solve 0-1 knapsack problem, you can quickly get the best results, using matlab realize
Date : 2025-07-01 Size : 3kb User : 1121261428
[matlab] 禁忌搜索算法 DL : 0: 禁忌搜索解决背包问题，matlab环境实现c流程(Tabu search solves knapsack problem, and C flow is realized in Matlab environment.)
Date : 2025-07-01 Size : 2kb User : sgdmc
[matlab] 应用禁忌搜索算法解决0-1背包问题 DL : 0: 利用禁忌搜索算法求解0-1背包问题。禁忌搜索算法相比其他搜索算法更优，设置藐视规则来避免陷入局部最优解。(Solve 0-1 Knapsack Problem based on Tabu search. The tabu search algorithm is superior to other search algorithms and sets contempt rules to avoid falling into local optimal solutions.)
Date : 2025-07-01 Size : 83kb User : 大白pu