A Summary of Genetic Algorithm on 0/1 Knapsack Problem

Knapsack problem is a combinatorial optimization problem,there are many types,such as multidimensional knapsack problem;0/1 knapsack problem discussed in this paper is the most primitive and the most basic knapsack problem.Genetic algorithm(GA) on the knapsack problem has been shown to great advantage.This paper analyzed the main problems of 0/1 knapsack problem using genetic algorithm,summarized and analyzed the related documents for the past six years,pointed out the future research directions,provided a reference for the genetic algorithm for solving 0/1 knapsack problem.