搜索资源列表
EX04
- 遗传算法,用此算法可以得到很多计算背包问题的方法,可以和其他的算法进行比较。-Genetic algorithm, using this algorithm for calculating the backpack can be a lot of problems, and other algorithms can be compared.
pack
- 一个简化的背包问题:一个背包能装总重量为 T,现有 n 个物件,其重量分别为(W1、W2、…、Wn)。问能否从这 n 个物件中挑选若干个物件放入背包中,使其总重量正好为 T ?若有解则给出全部解,否则输出无解。-A simplified knapsack problem: a backpack can hold a total weight for the T, the existing n-object, its weight, respectively (W1, W2, ..., Wn).
01knapsackMFC
- 01背包问题演示程序 用mfc实现01背包问题的dp算法-01 knapsack problem with mfc demo program to achieve 01 knapsack problem algorithm dp
Fac3_9
- //0-1背包问题动态规划解法,原自王晓东算法设计,该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm
gafor01
- 遗传算法求解典型的组合优化问题,复杂背包问题的设计-Genetic Algorithm for typical combinatorial optimization problem, the complexity of the design of knapsack problem
KnapsacksProblem1
- 利用遗传算法解决背包问题,对遗传算法和编程的学习有一定帮助-The use of genetic algorithms to solve knapsack problem, genetic algorithms and programming of learning to some extent help the
GA
- 本程序是在MATLAB平台上,利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中,需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品,每件物品i 的重量为wi ,价值为pi 。对于可行的背包装载,背包中物品的总重量不能超过背包的容量,最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm t
beibaowent
- 一群算法解决背包问题 -A group of algorithms to solve knapsack problem a group of algorithms to solve knapsack problem
Beibao-JAVA
- 提供一个用Java实现背包问题的解法,如果有必要可以自行修改相关参数后再做仿真-Used to provide a Java implementation of the solution of knapsack problem and, if necessary modify the relevant parameters can then make simulation
gabags
- 网站上关于遗传算法开发可谓工具箱满天飞。可工具箱超级难用。鉴于此,本人自己完全用matlab实现遗传算法解决多背包问题并留了qq。-Web site development on the genetic algorithm toolbox is all over the place. Toolbox can be super hard to use. In view of this, I am not at all with the realization of genetic algorith
beibao
- 背包问题的主函数很有用啊 本程序主要用到遗传算法-背包
a
- 简单的背包问题,用了回溯,里面有详细的解说-aaaaaaaaaaaaaaaaaaaaaaaaaaa
beibao
- 贪心法求解背包问题,希望对大家有帮助,还 的的的 -Knapsack problem greedy method, we would like to help, but also of the
bbwt
- 遗传算法解决背包问题,即装入物体容量有限,每个物体有不同价值,使得最终价值最高。-Genetic algorithm to solve knapsack problem, namely the limited capacity of loaded objects, each object has a different value, making the final value.
GaBin
- 遗传算法解决复杂背包问题,用Java编写。 该背包拥有3个属性,500个东西,50个包。 求解包与包之间物品重量差最小,并且同一个背包的物品属性有特殊要求。 该程序容易修改。-Genetic Algorithm on Bin Packing Proglem. 500 items, 3 parameters of each item. 50 containers, target: All 50 containers has the smallest weight differe
KnapsackProblem
- 这是用MATLAB编写的模拟退火算法求解背包问题的程序-This is prepared using MATLAB algorithm simulated annealing procedure for Knapsack Problem
0-1knapsack_problem
- 0/1背包问题:给定n种物品和一个容量为C的背包,物品i的重量是wi,其价值为vi,0/1背包问题是如何选择装入背包的物品(物品不可分割),使得装入背包中物品的总价值最大?回溯法解决0/1背包问题-0/1 knapsack problem: given n types of items and a knapsack of capacity C, the weight of item i is wi, the value of vi, 0/1 knapsack problem is how to
POS_c
- 本程序是用PSO用于求解NP难问题,如0-1背包问题,效果很好-This procedure is used PSO for solving the NP hard problems, such as 0-1 knapsack problem, well
beibaoVC6
- VC6实现背包问题,内容详实,易懂,非常适合初学者-VC——beibao
PSO_Solving_Multi_Aims
- 货物配装问题实质上是背包问题与装箱问题的混合,有着广泛的应用。配装,是指充分利用运输工具(如火车、货车、轮船等,本文主要是指货车) 的载重量和容积,采用先进的装载方法,合理安排货物的装载计划,最大限度地发挥货车容积和承载能力,从而降低配送成本。-Cargo loading problem and knapsack problem is essentially a mixture of bin-packing problem, with a wide range of applications.