The improved genetic algorithm for solving knapsack problem based on Handel-C

Knapsack problem is applied broadly to practice in resource allocation, investment decision-making, storage allocation, loading problem and so on. The paper adopts Handel-C language to program for the simple and improved genetic algorithm that solve knapsack problem. The procedures of the two algorithms are provided in detail in the paper. The improved genetic algorithm enhances obviously global search ability and converging velocity through contrasting the experiment results of the two algorithms. Thus the effectiveness of the improved algorithm is demonstrated.