基于遗传算法的背包问题求解

Knapsack's Solution Based on Genetic Algorithms

背包问题是计算机算法研究中NP完备类的一个困难问题,对这个问题国内外很多学者已经研究出了不少经典的方法,但是这些传统的优化方法存在一些缺点。本文介绍了近年来兴起的一种机器学习算法——遗传算法解决背包问题的基本思路,并通过实例计算证明了此方法的可行性和有效性。

Recent years many computer experts knapsack, which is regarded as a difficult NP problem. have designed a lot of algorithms to solve 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.