摘要
介绍了基于贪心思想的改进遗传算法,并用该算法解决0-1背包问题,试验数据证明该算法能有效求解0-1背包问题,而且比原遗传算法效率高。
An improved genetic algorithm based on greedy strategy is introduced; this algorithm is proposed for solving 0-1 knapsack problem. Compared with original genetic algorithm on the basis of large quantity of numerical experiments,this algorithm is proved to be able to solve 0-1 knapsack problem effectively with higher efficiency.
出处
《计算机应用与软件》
CSCD
2010年第12期238-239,260,共3页
Computer Applications and Software
基金
宁夏自然科学基金项目(NZ0729)
关键词
0-1背包
遗传算法
贪心策略
0-1 knapsack problem Genetic algorithm Greedy strategy
