背囊优化问题主要用于解决如何使野外训练中背囊内物品价值最大化的研究。我们引入背包问题的基本模型，具体结合两种实际情况，分别应用贪婪算法以及粒子群算法，得出了满足约束条件的满意解。-Backpack optimization problem to solve how to maximize the value of items in the backpack field training. We introduce the basic model of the knapsack problem, the specific combination of both the actual situation, the greedy algorithm and particle swarm algorithm were applied and obtained satisfactory solution satisfy the constraints.