中文说明：背包问题或背包问题是组合优化的一个问题：给定一组项目，每一个块和一个值，确定每个项目的数目在一个集合，包括使总重量小于或等于一个定限制，总价值是尽可能地大。它的名字来源于面对别人的问题，谁是由一个固定大小的背包限制，必须用最贵重的物品填充。这个文件是有关使用PSO算法是一种群体智能方法的背包问题。我们有2种背包问题。其中之一是一个实数，另一个是真实背包问题。
English Description：
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a mass and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.this file is about using PSO method which is a kind of swarm intelligence method for the Knapsack problem. we have two kind of Knapsack problem. one of them is for a real number and another for real Knapsack problem.