Comparative Study of Several Intelligent Algorithms for Knapsack Problem

Knapsack problem in the field of combinatorial optimization is a typical, easy-to-describe but difficult to deal with NP-complete problems. Knapsack problem for large-scale, are not yet very effective way, how quickly and effectively solve the knapsack problem has important theoretical and practical significance, is widely used in engineering practice. We introduce the knapsack problem, discusses the current knapsack problem several intelligent algorithm is more effective (simulated annealing algorithm, ant colony algorithm, taboo search method), a simple illustration of their solution process, respectively, and pointed out their advantages and disadvantages the prospects for solving knapsack problem raised outlook.