内蒙古民族大学学报：自然科学版2011，Vol.26Issue(4)：405-407,3.
基于遗传算法求解背包问题的算法探讨
On the Algorithmin of Solving the Knapsack Problem Based on Genetic Algorithm
程春英 1张鹏2
作者信息
- 1. 内蒙古民族大学计算机科学与技术学院,内蒙古通辽028043
- 2. 内蒙古民族大学数学学院,内蒙古通辽028043
- 折叠
摘要
Abstract
This paper analyzes the traditional knapsack problem using the idea of genetic algorithm, designs codes according to basic structure of genetic algorithm and also gives results of comparison with recursive algorithm and illustrates that genetic algorithm is feasible and eftlcient to solve the knapsack problem关键词
0-1背包问题/遗传算法/选择/交叉/变异Key words
0-1 Knapsack problem/Genetic algorithm/Select/Crossover/Mutation分类
信息技术与安全科学引用本文复制引用
程春英,张鹏..基于遗传算法求解背包问题的算法探讨[J].内蒙古民族大学学报：自然科学版,2011,26(4):405-407,3.
