Heuristics Algorithm for Knapsack Problem Based on the Tabu Search

The paper design a genetic algorithm based on the tabu search. By utilizing the main frame of parallel search supplied by the genetic algorithm and the individual serial search mode of the tabu algorithm, this method can enlarge the search space and swiftly implement the overall optimization. If it is combined with the heuristics algorithm to solve the knapsack problem, according to the results of computer simulation, it can effectively improve the index of optimization performance and search efficiency.