| 改进的遗传算法在背包问题中的应用 |
| |
| 引用本文： | 潘玉奇,栾虹,张茜.改进的遗传算法在背包问题中的应用[J].信息技术与信息化,2007(2):119-120. |
| |
| 作者姓名： | 潘玉奇 栾虹 张茜 |
| |
| 作者单位： | 济南大学信息科学与工程学院,山东济南,250022;中国地质大学(北京)地球物理与信息技术学院,100083 |
| |
| 摘 要： | 介绍了一种最优保存遗传算法，针对该算法提出一种改进方案，一方面改变了保存最优个体的方法，另一方面对不满足约束条件的个体采用贪心策略进行改造，使其满足条件。最后通过一个具体的背包问题实例验证了改进算法的可行性和有效性。
|
| 关 键 词： | 遗传算法 背包问题 贪心策略 |
Improved Genetic Algorithm Applied to the Knapsack Problem |
| |
| PAN Yu-qi,LUAN Hong,ZHANG Qian.Improved Genetic Algorithm Applied to the Knapsack Problem[J].Information Technology & Informatization,2007(2):119-120. |
| |
| Authors: | PAN Yu-qi LUAN Hong ZHANG Qian |
| |
| Institution: | PAN Yu-qi LUAN Hong ZHANG Qian |
| |
| Abstract: | A genetic algorithm with best elitist preserved method is introduced. In allusion to this algorithm an improved project is proposed. On the one hand best elitist preserved method is changed,on the other hand those individuals ,which aren't satisfied with restrict condition, are reconstructed with greedy strategy. The fea- sibility and validity of improved algorithm is proved through a knapsack problem instance. |
| |
| Keywords: | Genetic algorithm Knapsack problem Greedy strategy |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
