本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm t

matlab模拟退火算法，处理背包问题，相比较与遗传算法模拟退火原理简单，编译容易-matlab simulated annealing algorithm to handle the knapsack problem, compared with the genetic simulated annealing algorithm is simple, easy to compile

算法效果较为良好，实现背包问题价值最大，采用遗传算法实现的比较不错的结果(The algorithm effect is good, the maximum value of the knapsack problem, genetic algorithm is used to achieve good results)

使用遗传算法解决0-1背包问题，调试成功，非常适合初学者了解遗传算法和0-1背包问题(Using genetic algorithm to solve 0-1 knapsack problem, debugging is successful. It is very suitable for beginners to understand genetic algorithm and 0-1 knapsack problem.)