An improved tabu search algorithm to solve knapsack problem. The algorithm is ba...

　提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用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