Description: 用遗传算法解0/1背包问题，背包问题是著名的NP完备类困难问题，此处给出解法。-Genetic Algorithm for 0 / 1 knapsack problem, knapsack problem is a well-known class of NP-complete problems. Solution is here. Platform: |
Size: 2126 |
Author:李博宁 |
Hits:
Description: 用遗传算法解0/1背包问题，背包问题是著名的NP完备类困难问题，此处给出解法。-Genetic Algorithm for 0/1 knapsack problem, knapsack problem is a well-known class of NP-complete problems. Solution is here. Platform: |
Size: 2048 |
Author:李博宁 |
Hits:
Description: 遗传算法求解01背包问题＋实验报告＋参考文献。如果你看了这个程序还是不能明白遗传算法的巧妙，那么还是不要再看这个问题了。-Genetic Algorithm for Knapsack Problem 01 experimental report references. If you read this procedure should not understand the genetic algorithm or clever, then it is better not to look at this issue. Platform: |
Size: 201728 |
Author:gouyabin |
Hits:
Description: 遗传算法求解典型的组合优化问题，复杂背包问题的设计-Genetic Algorithm for typical combinatorial optimization problem, the complexity of the design of knapsack problem Platform: |
Size: 10240 |
Author:pengyang |
Hits:
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: 遗传算法编程求解旅行商问题；图论中最短路问题的Matlab程序实现；背包问题模型的Matlab程序实现。-Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab model implementation process. Platform: |
Size: 504832 |
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: 本文件含论文及源代码。论文首先介绍了基本遗传算法的基本原理、特点及其基本实现技术，接着针对背包问题，论述了遗传算法在编码表示和遗传算子（包括选择算子、交叉算子变异算子这三种算子）等方面的应用情况。并且结合背包问题实例，给出了具体的编码方法，运行参数，群体大小，最大迭代次数，以及合适的遗传算子。最后，简单说明了遗传算法在求解背包问题中的应用并对遗传算法解决背包问题的前景提出了展望。-The file containing the papers and source code. The paper first introduces the basic principles of the basic genetic algorithm, the characteristics of its basic implementation techniques, and then for the knapsack problem, discusses the genetic algorithm coded representation and genetic operators (including selection operator, crossover operator mutation operator three count sub), and other aspects of the application. And the combination of an instance of the knapsack problem, given specific encoding method, operating parameters, population size, maximum number of iterations, and appropriate genetic operators. Finally, a brief description of the genetic algorithm Knapsack problem and genetic algorithm to solve the knapsack problem prospects prospect. Platform: |
Size: 420864 |
Author:李海波 |
Hits:
Description: 本源程序里面实现了基本的遗传算法与量子遗传算法实现0-1背包问题，并对实现结果截图并分析了。-The source of which the realization of the genetic algorithm and the quantum genetic algorithm to achieve the basic 0-1 knapsack problem, and the results were analyzed. Platform: |
Size: 4538368 |
Author:黄山 |
Hits:
Search - genetic algorithm for knapsack problem