Location:
Search - knap
Search list
Description: 背包问题的遗传算法解法 背包问题的遗传算法解法-knapsack problem genetic algorithm method knap sack problem GA knapsack asked Solution that the genetic algorithm method knapsack problem Genetic Algorithm Solution
Platform: |
Size: 1019339 |
Author: my name |
Hits:
Description: 0-1背包问题（0-1 Knapsack Problem）的定义为：设集合 代表m件物品,正整数 分别表示第 件物品的价值与重量，那么0-1背包问题KNAP(A,c)定义为,求A的子集，使得重量之和小于背包的容量c，并使得价值和最大。
Platform: |
Size: 1844 |
Author: chj |
Hits:
Description: 用贪婪法的策论，用非递归实现背包问题的求解，并求出放如背包中的物品．-greedy law with political discourse, the use of non - recursive Knapsack Problem Solving and sought release if the items backpack.
Platform: |
Size: 1335 |
Author: 郭宏慧 |
Hits:
Description: 用贪婪法的策论，用非递归实现背包问题的求解，并求出放如背包中的物品．-greedy law with political discourse, the use of non- recursive Knapsack Problem Solving and sought release if the items backpack.
Platform: |
Size: 1024 |
Author: 郭宏慧 |
Hits:
Description: 设有n种物品，每一种物品数量无限。第i种物品每件重量为wi公斤，每件价值ci元。现有一只可装载重量为W公斤的背包，求各种物品应各取多少件放入背包，使背包中物品的价值最高。-with n product, every kind of infinite number of copies. I first product for each weight wi kilograms, each worth ci yuan. Existing a carrying weight of the backpack W kilograms, should seek various items each for the number of pieces Add backpack, so backpack maximum value items.
Platform: |
Size: 30720 |
Author: 汤烈 |
Hits:
Description: 背包问题的遗传算法解法 背包问题的遗传算法解法-knapsack problem genetic algorithm method knap sack problem GA knapsack asked Solution that the genetic algorithm method knapsack problem Genetic Algorithm Solution
Platform: |
Size: 1018880 |
Author: |
Hits:
Description: 0-1背包问题（0-1 Knapsack Problem）的定义为：设集合 代表m件物品,正整数 分别表示第 件物品的价值与重量，那么0-1背包问题KNAP(A,c)定义为,求A的子集，使得重量之和小于背包的容量c，并使得价值和最大。-0-1 knapsack problem (0-1 Knapsack Problem) is defined as: set up a collection on behalf of m items, respectively, the first positive integer value of items and weight, then the 0-1 knapsack problem KNAP (A, c) is defined as, A subset of demand, making less than the weight of the backpack and the capacity c, and make the value and the greatest.
Platform: |
Size: 2048 |
Author: chj |
Hits:
Description: this file solve 0/1 knapsack problem
Platform: |
Size: 5120 |
Author: morteza |
Hits:
Description: this file solve knap sack
Platform: |
Size: 41984 |
Author: shint |
Hits:
Description: 矩形条带装箱问题(RSPP)是指将一组矩形装入在一个宽度固定高度不限的矩形容器中，以期
获得最小装箱高度．RSPP理论上属于NP难问题，在新闻组版、布料下料以及金属切割等工业领域中
有着广泛的应用．为解决该问题，采用了一种混合算法，即将一种新的启发式算法—— 动态匹配算
法—— 与遗传算法结合起来．混合算法中，动态匹配算法能根据4类启发式规则动态选择与装填区域相
匹配的下一个待装矩形，同时将装箱后所需容器高度用遗传算法的进化策略进行优化．对2组标准测试
问题的计算结果表明，相对于文献中的已有算法，提出的算法更加有效．-Given a set of small rectangular pieces of different sizes and a rectangular container of fixed
width and infinite length，the rectangular strip packing problem (RSPP) consists of orthogonally
placing all the pieces within the container，without overlapping，such that the overall length of the
packing is minimized． RSPP belongs to NP—hard problem in theory and has many industrial
applications such as the composition of news，the cutting of elothing and the cutting of metal，etc．To
solve the rectangular strip packing problem ，a hybrid algorithm ，which combines a novel heuristic
algorithm- dynamic—fit heuristic algorithm (DFHA)，with the genetic algorithm，is adopted． The
DFHA algorithm can dynamically select the better-fit rectangle for packing，according to the width—fit
first(W FF)rule，the height—fit first(HFF) rule，the placeable first(PF) rule，and the biggest—
rectangle first(BRF)rule，and the evolutionary capability of genetic algorithm is used to optimize the
height of the packing
Platform: |
Size: 477184 |
Author: 郭事业 |
Hits:
Description: 分支限界求背包问题相对于贪心法等有很大的优势-fenzhi xianjie beibao
Platform: |
Size: 1208320 |
Author: chuanye |
Hits:
Description: 这个合格程序具有很高的所使用价值，认真学习会有一想不到的收获-in fact,it is still a knap problem
Platform: |
Size: 176128 |
Author: chuanye |
Hits:
Description: this is a knap problem solution with getic algorithm.
Platform: |
Size: 3072 |
Author: shinhyung |
Hits:
Description: THIS PROGRAM SOLVES A 0-1 MULTIPLE KNAPSACK PROBLEM OF N ITEMS AND M KNAPSACKS.
-THIS PROGRAM SOLVES A 0-1 MULTIPLE KNAPSACK PROBLEM OF N ITEMS AND M KNAPSACKS.
Platform: |
Size: 6144 |
Author: LB |
Hits:
Description: 用动态规划解决背包问题，分别用递归和非递归方式实现-Knapsack problem using dynamic programming solution, respectively, recursive and non-recursive way to achieve
Platform: |
Size: 1024 |
Author: 李小青 |
Hits:
Description: 0-1背包问题是个NP难问题，本程序基于遗传算法，求解0——1背包问题。-Solve 0_1 knap problem with genetic algorithm
Platform: |
Size: 598016 |
Author: |
Hits:
Description: 采用c++语言实现动态规划问题、0-1背包问题、背包问题knap1.cpp、knap.cpp、dynamic.cpp！-The c++ language realize dynamic planning 0-1 knapsack problems knapsack problem knap1. CPP knap.CPP dynamic.CPP
Platform: |
Size: 393216 |
Author: 房凌霄 |
Hits:
Description: 利用c++语言进行01背包问题回溯法解决实际问题-knapsack problem
Platform: |
Size: 1024 |
Author: wangxuejun |
Hits:
Description: 采用回溯法解决01背包问题，数据输入为当前目录下的data.txt文件；-Backtracking to solve knapsack problem 01, data input data.txt file in the current directory
Platform: |
Size: 1026048 |
Author: 张帆 |
Hits:
Description: Cuckoo Optimization Algorithm
*Matlab Toolbox Ver. 1.0.1
*Ramin Rajabioun, 2011
solution&coding for knap-sack by cuck-Cuckoo Optimization Algorithm
*Matlab Toolbox Ver. 1.0.1
*Ramin Rajabioun, 2011
solution&coding for knap-sack by cuckoo
Platform: |
Size: 4096 |
Author: nadem |
Hits: