关键词: 背包问题, 遗传算法, 贪心算法, 贪心遗传算法

Abstract:

A greedy-genetic algorithm is proposed combining greedy algorithms and genetic algorithms.The algorithm constructs a new and better operator than the original one.It not only accelerates the convergence speed but also avoids the local optimum trap of the traditional method,thus improving search efficiency.The computer simulation results show that the greedy genetic algorithm has better approximate solutions than the average genetic algorithms,demonstrating the effectiveness and practicality of greedy- genetic algorithms in solving the knapsack problem.

Key words: knapsack problem;greedy algorithm;genetic algorithm;Greedy-Genetical gorith