A novel method for solving knapsack problem base on Hybrid Genetic Algorithm

Knapsack problem is a typical computer algorithm of NP complete (Nondeterministic Polynomial Completeness) problem. The research of solving this problem has great significance not only in theory, but also in application, for example, resource management, investment decisions and so on. For solving this problem, scholars have developed a number of algorithms, however, they are all have some drawbacks. This paper represents a greedy Genetic Algorithm based on Hybrid Algorithm through the study of Genetic Algorithm and Hybrid Algorithm to solve the knapsack problem, and also demonstrate its feasibility and effectiveness throng an example.