搜索资源列表
-
0下载：
采用遗传算法解决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
-
-
0下载：
本程序将遗传算法应用于背包问题。借助了大自然的演化过程,是多线索而非单线索的全局优化方法,采用的是种群和随机搜索机制. -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 ran
-
-
0下载：
背包问题，用遗传算法解决，并在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
-
-
1下载：
利用遗传算法解决的背包问题，程序开发环境：Visual C++6.0-Using genetic algorithm to solve the knapsack problem, program development environment: Visual C++6.0
-
-
0下载：
主要采用遗传算法解决背包问题。是值得学习算法。-By using the genetic algorithm to solve the main knapsack problem. Is worth learning algorithm.
-
