Description: 本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm to solve the 01 knapsack problem. In the 0/1 knapsack problem, there is a need for a capacity of c for the loaded backpack. From the n-items, select the items into the backpack, each item i the weight of wi, the value of pi. Feasible for loading backpack, backpack items total weight can not exceed the capacity of backpack, the best load is the value of the items loaded the highest. Platform: |
Size: 1024 |
Author:周薇 |
Hits:
Description: 本程序利用遗传算法解决背包文件问题。本程序利用遗传算法解决背包文件问题。-This procedure using the genetic algorithm to solve knapsack problem document. This procedure using the genetic algorithm to solve knapsack problem document. Platform: |
Size: 3072 |
Author:woshitian |
Hits:
Description: 采用遗传算法解决0-1背包问题，即装入物体容量有限，每个物体有不同价值，使得最终价值最高-Using genetic algorithm to solve the 0-1 knapsack problem, that is, limited capacity into objects, each object has a different value, making the final value of the maximum Platform: |
Size: 277504 |
Author:遆菲菲 |
Hits:
Description: 基本遗传算法带最优保存思想的背包问题，其中，目标值那段代码使用的是惩罚函数法，选择是概率选择，交叉是双点随机交叉，变异是概率变异-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 probability of selection, crossover is a two-point random crossover and mutation is the probability of mutation Platform: |
Size: 2048 |
Author:田文杰 |
Hits:
Description: Knapsack Problem - Genetic Algorithm. Results can be compared with optimal value obtained from function using Dynamic Programming. Platform: |
Size: 10240 |
Author:lazy_moose |
Hits:
Description: 本程序将遗传算法应用于背包问题。借助了大自然的演化过程,是多线索而非单线索的全局优化方法,采用的是种群和随机搜索机制. -This procedure will be applied to knapsack problem genetic algorithm. With the evolution of nature, is more than a single clue leads the global optimization method, using population and random search mechanism. Platform: |
Size: 273408 |
Author:刘浏 |
Hits:
Description: 背包问题，用遗传算法解决，并在VC++环境下调试通过，得到正确结果，可供参考，源码C文件中有较详细的注释-Knapsack problem, using genetic algorithm, and in the VC++ debugging environment through, get the correct results, for reference, source C files in more detailed comments Platform: |
Size: 12288 |
Author:paradise |
Hits:
Description: 用遗传算法计算背包问题的经典程序,word的文档里面有说明和程序。-Knapsack problem using genetic algorithm the classic program, word document which has instructions and procedures. Platform: |
Size: 26624 |
Author:孙磊 |
Hits:
Description: 使用遗传算法解决经典的背包问题，即整数规划问题。-Using genetic algorithm to solve the classic knapsack problem, that is, the problem of integer programming. Platform: |
Size: 6144 |
Author:王志成 |
Hits:
Description: 利用遗传算法解决背包问题给定10个物品及其重量，放入总重量为25的背包(Using genetic algorithm to solve knapsack problem, give 10 items and their weight, and put them in a total weight of 25 knapsack.) Platform: |
Size: 1024 |
Author:LEEay |
Hits:
Description: 使用遗传算法解决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.) Platform: |
Size: 21504 |
Author:MR安眠 |
Hits:
Description: 用遗传算法解决背包问题，供大家参考交流。。。(Using genetic algorithm to solve the knapsack problem, for your reference and exchange...) Platform: |
Size: 6144 |
Author:刘一凡1 |
Hits:
Search - knapsack problem using genetic algorithm