搜索资源列表
GA
- 本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm t
beibaoPSO
- 这份源代码是用粒子群算法解决0/1背包问题，可以正常运行。-The source code is the particle swarm algorithm to solve 0/1 knapsack problem, it works.
BB
- 对背包问题进行研究 用MATLAB来实现-Knapsack problem using MATLAB to realize
NP-hard-problem
- matlab模拟退火算法，处理背包问题，相比较与遗传算法模拟退火原理简单，编译容易-matlab simulated annealing algorithm to handle the knapsack problem, compared with the genetic simulated annealing algorithm is simple, easy to compile
Matlab
- quantm computing applicad to knapsack problem
modelCenter
- 粒子群算法和基于ModelCenter求解背包问题的对比研究,包括了matlab版的粒子群算法，ModelCenter程序，以及自己的报告 -Particle swarm optimization algorithm and a comparative study based on ModelCenter knapsack problem, including the matlab version of the particle swarm algorithm, ModelCenter pr
GA-knapsack
- solved knap sack with genetic algorithm in matlab
GA0-1beibao
- Matlab 代码，用遗传算法解决01背包问题-Matlab code, using genetic algorithms to solve knapsack problem 01
ACO-knapsack
- Ant colony optimization matlab code for solving Knapsack problem
背包问题
- 算法效果较为良好，实现背包问题价值最大，采用遗传算法实现的比较不错的结果(The algorithm effect is good, the maximum value of the knapsack problem, genetic algorithm is used to achieve good results)
matlab程序（解决0-1背包问题）
- 使用遗传算法解决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.)