遗传算法在0-1一维背包问题上的应用研究

Research of the Genetic Algorithm to Slove the 0-1’s Knapsack Problem

遗传算法是改进式启发算法,模拟自然界生物进化过程的计算模型。本文将多种改进的遗传算法应用于背包问题,并通过算例来证明该算法解决背包问题的可行性与有效性,以及评价各算法得优缺点。

The genetic algorithm is an improved algorithm of Heuristic, a compute mode of imitate the nature life evolvement. Introduce many improved genetic algorithms into knapsack problem. Then use a compute instance to proved the feasibility and efficiently, and evaluate these algorithms efficiency.