格雷码混合遗传算法求解0-1背包问题

Gray coded hybrid genetic algorithm for 0-1 knapsack problem

给出0-1背包问题的数学模型,修改传统二进制编码为格雷码混合遗传算法,使用贪心算法来解决约束问题,对每个个体使用价值密度来衡量,提高了算法搜索效率,同时使用精英保留机制来加速算法收敛的速度。最后通过数值实验证明了算法的有效性。

This paper gave an athematic mode of 0-1 knapsack problem, and modified the binary coding to establish a gray coded hybrid genetic algorithm used greedy algorithm to handle with the constraint conditions, And this paper proposed a value density operator to the individual,which could improve the search effciency, used the elitism mechanism to accelerate the convergence process. The numerical experiment proves the affectivity of the algorithm.