Novel chaos genetic algorithm for solving 0-1 knapsack problem
求解0-1背包问题的混沌遗传算法

This paper proposed a novel chaos genetic algorithm for solving the 0-1 knapsack problem. Enhanced the ergodicity of chaotic search by using power function carrier technology, improved genetic algorithm premature problem by embeding chaos optimal solution obtained into basic GA, and improved the capacity of algorithm to avoid the local extreme and to converge to the global optimal solution quickly. Results of the numerical experiment show that the proposed algorithm is effective and useful in solving 0-1 knapsack problem.