搜索资源列表
matlab
- 不错的程序，欢迎下载，登山算法，解决背包问题，不错-Good program, please download, climbing algorithm to solve knapsack problem, yes
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 h
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
POS_c
- 本程序是用PSO用于求解NP难问题，如0-1背包问题，效果很好-This procedure is used PSO for solving the NP hard problems, such as 0-1 knapsack problem, well
beibaowenti
- 量子免疫克隆用于求解背包问题 绝对私密 欢迎大家分享 下载-Quantum immune clone backpack for solving the problem is welcome to share download private
beibaoVC6
- VC6实现背包问题，内容详实，易懂，非常适合初学者-VC——beibao
PSO_Solving_Multi_Aims
- 货物配装问题实质上是背包问题与装箱问题的混合，有着广泛的应用。配装,是指充分利用运输工具(如火车、货车、轮船等,本文主要是指货车) 的载重量和容积,采用先进的装载方法,合理安排货物的装载计划，最大限度地发挥货车容积和承载能力，从而降低配送成本。-Cargo loading problem and knapsack problem is essentially a mixture of bin-packing problem, with
SA
- 这是用模拟退火算法解决0-1背包问题，下载后可直接运行，可以帮助有需要对模拟退火算法进行了解的朋友。-This is a simulated annealing algorithm to solve the 0-1 knapsack problem, after downloading, can be directly run, you can help those in need of the simulated annealing
KnapsackProblem
- 基本遗传算法带最优保存思想的背包问题，其中，目标值那段代码使用的是惩罚函数法，选择是概率选择，交叉是双点随机交叉，变异是概率变异-The basic genetic algorithm with elitist thinking knapsack problem, which is a target that part of the code using penalty function method, choice is the pr
pso_01
- 使用二进制PSO解决0-1背包问题的MATLAB程序-The use of PSO to solve 0-1 knapsack problem
0-1bag
- 实现0—1背包问题的分支限界搜索，为控制台应用程序，编译环境为vs2008-0-1 knapsack problem to achieve the branch and bound search for the console application, compile environment for vs2008
bags
- 四种算法（动态规划、回溯法、分支限界法、贪心法）实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
galy
- 遗传算法解决的背包问题，初学者遗传算法的同学必看。-Genetic algorithm to solve the knapsack problem, genetic algorithm beginner students must-see.
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 背包问题，遗传算法，基于遗传算法的背包问题求解-Knapsack problem, genetic algorithm, based on genetic algorithms for solving knapsack problem
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 背包问题，遗传算法，GAs，基于遗传算法求解背包问题，源码，方法-Knapsack problem, genetic algorithms, GAs, Knapsack Problem Based on Genetic Algorithm
simulateanneal
- 一个解决0-1背包问题的模拟退火程序，希望给有需要的人帮助-A solution to the 0-1 knapsack problem simulated annealing process, hoping to help those in need
yichuansuanfa
- 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题。-The greedy repair method and genetic algorithm are combined to form hybrid genetic algorithm, and solve the classical knapsack problem.