| 基于遗传算法的背包问题求解 |
| |
| 引用本文： | 张永兵,王斌,张永飞,杨晓鸿,陈海鹏.基于遗传算法的背包问题求解[J].大理学院学报,2005,4(5):24-26. |
| |
| 作者姓名： | 张永兵 王斌 张永飞 杨晓鸿 陈海鹏 |
| |
| 作者单位： | 大理学院附属医院信息科,云南,大理,671000 |
| |
| 摘 要： | 背包问题是计算机算法研究中NP完备类的一个困难问题,对这个问题国内外很多学者已经研究出了不少经典的方法,但是这些传统的优化方法存在一些缺点。本文介绍了近年来兴起的一种机器学习算法——遗传算法解决背包问题的基本思路,并通过实例计算证明了此方法的可行性和有效性。
|
| 关 键 词： | 背包问题 遗传算法 |
| 文章编号： | 1672-2345(2005)05-0024-03 |
| 收稿时间： | 11 30 2004 12:00AM |
| 修稿时间： | 04 19 2005 12:00AM |
Knapsack's Solution Based on Genetic Algorithms |
| |
| ZHANG Yong-bing,WANG Bin,ZHANG Yong-fei,YANG Xiao-hong,CHEN Hai-peng.Knapsack''''s Solution Based on Genetic Algorithms[J].Journal of Dali University,2005,4(5):24-26. |
| |
| Authors: | ZHANG Yong-bing WANG Bin ZHANG Yong-fei YANG Xiao-hong CHEN Hai-peng |
| |
| Institution: | Department of Information, Affiliated Hospital of Dali University, Dali, Yunnan 671000, China |
| |
| Abstract: | Recent years many computer experts have designed a lot of algorithms to solve knapsack,which is regarded as a difficult NP problem.But there still exist bugs in these traditional algorithms.Based on Genetic Algorithm,this text provides a new solution for knapsack problem and proves its feasibility and validity through experiments. |
| |
| Keywords: | Knapsack Solution Genetic Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
