搜索资源列表
beibaoPSO
- 粒子群算法解决0-1背包问题,对于n个体积为aj、价值分别为cj的物品,如何将它们装入总体积为b的背包中,使得所选物品的总价值最大。-Particle swarm algorithm to solve the 0-1 knapsack problem, for n volume for aj, value for cj items, how they are loaded in the total volume of the backpack, b, making the total value
beibaoPSO
- PSO背包問題 用PSO求解背包問題 對於n個體積為aj、價值分別為cj的物品,如何將它們裝入總體積為b的背包中,使得所選物品的總價值最大。-PSO PSO knapsack problem using knapsack problem for n volume aj, respectively cj value items, how they can be loaded into a total volume of b backpack, making the total value
beibaoPSO
- 用粒子群算法解决0/1背包问题,解决在背包体积有限的情况下,如何最大化的实现有效资源分配-Solve knapsack problem with particle swarm algorithm to solve the limited volume of the backpack, how to maximize the efficient allocation of resources to achieve
beibaoPSO
- 基于MATLAB的pso算法解决背包问题-Pso algorithm based on MATLAB to solve knapsack problem