An Improved Genetic Algorithm for 0-1 Knapsack Problems

The 0-1 knapsack problems is a problem in combinatorial optimization, which is NP-complete to solve exactly. A genetic algorithm is a kind of heuristic that mimics the process of natural evolution. We derived an improved solution for 0-1 knapsack problem based on the dual population genetic algorithm, which can overcome the defect of precocious and local convergence in iterative processes. The performance evaluation shows that the solution is better than the traditional genetic algorithm.