提出了解决多背包问题的遗传算法。
A genetic algorithms is applied to solute such a complex problem.
函数优化和背包问题实验验证了PEA的有效性。
The function optimization and knapsack problem show the effectiveness of PEA.
实验结果表明，采用此算法能快速有效地解决背包问题。
The experimental results show that it is a fast and efficient method for knapsack problem.
结合0 / 1背包问题的求解，阐明这种方法求解问题的过程。
The solution process is described with the solution of 0/1 knapsack problem.
问题6：一般你可以在一个空背包里面放多少本书？
QUESTION 6: On average, how many books can you put in an empty backpack?
问题6：一般你可以在一个空背包里面放多少本书？
QUESTION 6: On average, how many books can you put in an empty backpack?
应用推荐