An improved approach for solving 0/1 Knapsack Problem in polynomial time using Genetic Algorithms

The 0/1 knapsack is a very well known problem and many approaches have been proposed such as dynamic programming and greedy strategy to solve this problem. But 0/1 knapsack problem is an NP-complete problem. Solving it in a polynomial time is a challenge. It is becoming an important problem because there are many real life applications based on this. Genetic Algorithms have been proved to be a good approach in solving these types of problem and with the help of Genetic Algorithms it will no longer remain a NP-complete problem. A number of numerical experiments are performed and the outcome shows how this approach is better than the previous approach of Genetic Algorithm for solving 0/1 Knapsack Problem.