| 求解0-1背包问题的混合遗传算法 |
| |
| 引用本文： | 宋海洲,魏旭真.求解0-1背包问题的混合遗传算法[J].华侨大学学报(自然科学版),2006,27(1):16-19. |
| |
| 作者姓名： | 宋海洲 魏旭真 |
| |
| 作者单位： | 华侨大学数学系,福建,泉州,362021 |
| |
| 基金项目： | 福建省自然科学基金资助项目(20511028) |
| |
| 摘 要： | 对于0-1背包问题设计一种价值密度,并在此基础上提出求解0-1背包问题的混合遗传算法.经大量数值实验比较该方法与传统方法及简单遗传算法,结果表明算法能有效求解0-1背包问题.
|
| 关 键 词： | 背包问题 不可行解 贪心法 遗传算法 |
| 文章编号： | 1000-5013（2006）01-0016-04 |
| 收稿时间： | 2005-06-24 |
| 修稿时间： | 2005-06-24 |
A Hybrid Genetic Algorithm for Solving 0-1 Knapsack Problem |
| |
| Song Haizhou,Wei Xuzhen.A Hybrid Genetic Algorithm for Solving 0-1 Knapsack Problem[J].Journal of Huaqiao University(Natural Science),2006,27(1):16-19. |
| |
| Authors: | Song Haizhou Wei Xuzhen |
| |
| Institution: | Department of Mathematics, Huaqiao University, 362021, Quanzhou, China |
| |
| Abstract: | A value density is designed for 0-1 knapsack problem and on this basis,a bybrid genetic algorithm is proposed for solving 0-1 knapsack problem.Compared with conventional method and single genetic algorithm on the basis of large quantity of numerical experiments,as shown by experimental results,this algorithm is very effective. |
| |
| Keywords: | knapsack problem infeasible solution greedy method genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
