Introduction - If you have any usage issues, please Google them yourself
The file containing the papers and source code. The paper first introduces the basic principles of the basic genetic algorithm, the characteristics of its basic implementation techniques, and then for the knapsack problem, discusses the genetic algorithm coded representation and genetic operators (including selection operator, crossover operator mutation operator three count sub), and other aspects of the application. And the combination of an instance of the knapsack problem, given specific encoding method, operating parameters, population size, maximum number of iterations, and appropriate genetic operators. Finally, a brief description of the genetic algorithm Knapsack problem and genetic algorithm to solve the knapsack problem prospects prospect.